A model of elitist qualification

Size: px
Start display at page:

Download "A model of elitist qualification"

Transcription

1 Group Decision and Negotiation manuscript No. (will be inserted by the editor) A model of elitist qualification Miguel A. Ballester 1, José Luis García-Lapresta 2 1 Dep. d Economia i d Història Econòmica, Universitat Autònoma de Barcelona, Bellaterra (Barcelona), Spain. miguelangel.ballester@uab.es 2 Dep. de Economía Aplicada (Matemáticas), Facultad de Ciencias Económicas y Empresariales, Universidad de Valladolid, Avda. Valle de Esgueva 6, Valladolid, Spain. lapresta@eco.uva.es Received: date / Revised version: date Abstract This paper deals with the collective qualification of members of society as belonging to a certain category or group based on a fixed attribute. Our model contains three main features: the existence of individual gradual opinions, the notion of elitism (only the opinions of certain individuals are taken into account to delineate the reference group), and the idea of sequentiality (elites are successively created by using the previous elites opinions on a social decision scheme). The main results of the paper characterize when this sequential procedure converges for some intuitive ways of aggregating individual opinions. Finally, we analyze the role of convergence for two extra basic properties (symmetry and contractiveness) that elitist rules should possess. Key words social choice; voting systems; liberalism; consensus; social identity; sequential elitism; gradual assessments 1 Introduction In this paper we deal with how individuals within a society are collectively perceived as belonging to a certain category or group. In particular, we discuss a set of rules that rest on the idea that qualified members might have special significance when evaluating other individuals. That is, certain members opinions deserve favored treatment by virtue of their perceived superiority (elitism). However, elitism only arises from social evaluations Send offprint requests to: José Luis García-Lapresta.

2 2 Miguel A. Ballester, José Luis García-Lapresta in such a way that in each step the elite is built from the opinions of the previous elite (sequential elitism). The delineation of identity seems to be crucial in several economic and social problems. Some axiomatic studies have been built on this issue, starting with Kasher and Rubinstein [10]. 1 As discussed in Çengelci and Sanver [4], most of the rules introduced thereafter, to which we refer as simple rules, (see Samet and Schmeidler [12], Sung and Dimitrov [13], Houy [7, 8] or Miller [11]) are shown to share a common group of properties. However, there exists a literature dealing with a more complicated set of rules (multi-stage rules), that cannot be expressed as simple rules. They initially determine a group of individuals by means of a simple rule. This set of qualified individuals may be modified, taking into account the opinions of the individuals qualified in the previous stage. This recursive process finally generates the qualified set of individuals within the society. Dimitrov, Sung and Xu [5] and Çengelci and Sanver [4] provide axiomatic characterizations of some of these recursive procedures based on the original ideas of Kasher [9] and Kasher and Rubinstein [10]. The main features of our model are the following. First, each member of society gradually assesses all individuals, including herself. In the previous literature, for any individual i, the judgement regarding if an individual j possesses a certain attribute is a dichotomous assessment, i.e., individual i either does or does not qualify individual j. Our model is more general, since opinions can include cardinal information. Secondly, this information is aggregated and those individuals who reach a given threshold are qualified. As in the multi-stage rules, in the next stage only the opinions of this emergent elite are taken into consideration and a new subset of qualified individuals is selected; and so the procedure continues. As pointed out, we first focus on the convergence of the sequence of elites. In Kasher [9], Dimitrov, Sung and Xu [5] or Çengelci and Sanver [4], the issue of convergence was not substantially covered. In their specific rules, looking at convergence is not complicated, since all their procedural rules are intuitively convergent. 2 Our main results provide some necessary and sufficient conditions for the convergence of sequential elitism when using other classes of aggregators that reflect natural ways of combining individual opinions. We complement these results by analyzing two further properties of sequential elitism, symmetry and contractiveness. The former refers to classical notions of anonymity in Social Choice. The latter is related to the idea that stricter committees should select less individuals as qualified. 1 In a non-axiomatic approach, Kasher [9] first considered (Jewish) identity and proposed some rules in order to decide the subset of individuals who belong to that group. 2 The corresponding dichotomous procedures are based on invitation rules: in each stage qualified members can qualify as many members as they desire. Thus, the set of qualified members does not decrease in any stage and, consequently, the procedures are convergent. For a more technical reasoning, see Section 3.

3 A model of elitist qualification 3 The paper is organized as follows. Section 2 introduces the main features of our model of sequential elitism, providing some archetypal social evaluations as the basis of the model. In Section 3, we provide necessary and sufficient conditions for the convergence of our sequential elitism model. Finally, Section 4 analyzes two extra properties of the rules that our model defines and concludes the paper. 2 Collective assessment and qualification functions 2.1 Gradual assessments A society is conformed as a finite set of individuals N = {1, 2,..., n} with n 2. We use 2 N to denote the power set of N, i.e., the set of all the subsets of N, and for any S N, S is the cardinal of S. A profile is an n n matrix P = (p ij ) with values in the unit interval, where p ij is interpreted as the assessment with which individual i evaluates individual j as being qualified to belong to the group in question. The set of profiles is denoted by P. 2.2 Sequential elitism A social qualification consists merely of a rule or mechanism that, given a profile of opinions, specifies the set of qualified members. Definition 1 A rule is a mapping f : P 2 N which assigns, to any profile P P, the set of qualified members of the society, f(p ) N. We are interested in sequential elitist rules, where the final set of qualified individuals (the final elite) is the result of a sequential process in which an initial elite determines which members should be included in the next elite or reference group. To formalize these ideas we first need to specify the method that qualifies individuals on the basis of the assessments of any subset of N. A natural way to do so combines a collective assessment function, which provides an evaluation of any individual according to the (reference) set of individuals S N, and the profile P P, and a threshold family (to be explained below). Definition 2 A collective assessment function is a mapping ( ) v : 2 N \ { } P N [0, 1]. A collective assessment function determines individual qualification only in gradual terms. A very natural way to convert a gradual opinion into a dichotomic assessment is by means of thresholds.

4 4 Miguel A. Ballester, José Luis García-Lapresta Definition 3 A family of values {α S }, with = S N and α S [0, 1] for every S, is called a threshold family. Given a collective assessment function v and a threshold family {α S }, the function g {α S} v : 2 N P 2 N defined by: { {j N v(s, P, j) αs }, if S, g {α S} v (S, P ) =, otherwise, for all S N and P P, is called the collective qualification function associated with {α S } and v. Remark 1 One may convert each individual opinion into a dichotomous one before the aggregating process. However, given that thresholds can be different across different elites, a unique matrix of dichotomous opinions would not necessarily arise. Non-constant thresholds are precisely a key of the following results. Moreover, even with constant thresholds, gradual assessments are far richer than dichotomous assessments. The former can be aggregated in plenty of different ways before the application of the threshold. Thus, the case of gradual opinions becomes substantially richer than the one of dichotomous opinions, for which parallel results to ours can be derived easily. Our model should also specify the idea of sequentiality. First of all, given a profile, our society determines a first set of qualified individuals. This can be done through the collective qualification function g {α S} v, merely calculating the set S 1 = g {α S} v (N, P ). Once the group S 1 has been qualified as a significant elite, the recursive process moves from this set to another one, considering again the collective qualification function g {α S} v, S 2 = g {α S} v (S 1, P ), and this process is iterated. 3 In this way, a sequence of subsets of N is obtained, and the limit set of such sequences can be considered the solution of a sequential elitist model to the problem of qualifying the members of a society. At this point, a natural question arises. Do collective qualification functions always specify a final set of qualified members? In other words, is it possible to assign an (elitist) rule f to any collective qualification function? To answer this question, the following definition makes sense. Definition 4 Given a collective qualification function g {α S} v and a profile P P, the sequence {S t }, where S 0 = N and S t+1 = g {α S} v (S t, P ), is called a chain. A chain is said to be convergent if {S t } has a limit lim S t, i.e., there exists a positive integer q such that S t = S q for every t q (and it is also said that the chain converges to lim S t ). The collective qualification 3 Notice how the profile of opinions remains the same in each of the stages of the process. The modification of opinions would also arise interesting economic questions, as other models of committees show. See for instance Barberà, Maschler and Shalev [1].

5 A model of elitist qualification 5 function g {α S} v is said to be convergent if every chain generated by g {α S} v is convergent. Remark 2 A variant of Definition 3 is that only the members of the elite can be qualified by that elite: g {α S} v (S, P ) = { {j S v(s, P, j) αs }, if S,, otherwise, for all S N and P P. Now, if an individual is expelled from the elite, this individual cannot enter in a subsequent stage. Obviously, this collective qualification function converges to a final set of qualified individuals. Due to it being a trivial case, we do not consider it. Remark 3 A variant of Definition 4 is that the initial elite is any subset S 0 of N. However, the convergence of the elitist model is seriously flawed. The following example shows how, for any natural collective qualification function, convergence cannot be ensured. Consider = S 0 N and the profile P defined by: ) 1, if (i S 0 and j N \ S 0 p ij = 0, otherwise. or (i N \ S 0 and j S 0 ), Most natural qualification functions should determine S 1 = N \ S 0. 4 Similarly, once N \ S 0 is the elite, the new group of selected individuals should be S 0, thus provoking a cycle. In Kasher [9] and Dimitrov, Sung and Xu [5], the initial sets S 0 are determined using (in our terminology) a different collective qualification function than the one used in subsequent stages. To study the cases considered in the above mentioned papers, very minor modifications should be included in our model. 2.3 Some remarkable collective assessment functions To test the validity of the (sequential) elitist methods, we now present some specific cases that constitute natural ways to aggregate evaluations. In Section 3, we look at the convergence of the elitist procedure when using such methods. 4 Notice that the cases presented in 2.3, excluded the extreme liberal case, verify this fact.

6 6 Miguel A. Ballester, José Luis García-Lapresta The extreme liberal case Similarly to Kasher and Rubinstein [10], we consider the extreme liberal case, where the only opinion taken into account to reach a decission is that of the individual being judged: v 1 (S, P, j) = p jj. Given a threshold family {α S }, an individual j is qualified by the elite S if the opinion of j about herself reaches the corresponding threshold: j g {α S} v 1 (S, P ) p jj α S. Remark 4 The extreme liberal case is, in some sense, a degenerated elitist function, as elites play almost no role in judging individuals. Nevertheless, there exists a partial influence of elitism, as different elites may impose different thresholds. The results within the paper give the hint that very mild conditions over the thresholds allow the convergence of any of these degenerated sequential procedures. We have included this case for the sake of illustration, although for elitism to be fully explored, it seems natural to think that a set of members should use only their own opinions to provide an assessment. In this spirit, the remaining list of collective assessment functions tries to cover a wide range of intuitive and philosophical aggregation methods The benevolent case Following the view of Kasher [9], the benevolent case corresponds to making social opinion be the opinion of the most enthusiastic member of the elite: v 2 (S, P, j) = max{p ij i S}. So, given a threshold family {α S }, an individual j is qualified by the elite S if the opinion of some member of the elite reaches the corresponding threshold: j g {α S} v 2 (S, P ) p ij α S for some i S. This function generalizes the dichotomous case corresponding to an invitation rule, where one member of the elite is sufficient to qualify an individual The consensus We could consider a more restrictive collective assessment, reached through consensus: v 3 (S, P, j) = min{p ij i S}. Given a threshold family {α S }, an individual j is qualified by the elite S if the opinion of each member of the elite reaches the corresponding threshold: j g {α S} v 3 (S, P ) p ij α S for every i S. This function generalizes the dichotomous case corresponding to the (elitist) consensus idea, where individuals are qualified only if they are qualified by each member of the elite.

7 A model of elitist qualification The average Balancing the two previous extreme cases, additive methods try to combine all the opinions into a compensative collective view. As a special case, we consider that the social opinion is neither the most optimistic nor the most pessimistic, but the average of all the elite opinions: v 4 (S, P, j) = 1 S p ij. Given a threshold family {α S }, an individual j is qualified by the elite S if the average of the elite opinions reaches the corresponding threshold: j g {α S} v 4 (S, P ) 1 S i S p ij α S. We note that the arithmetic mean, as an aggregation operator, satisfies interesting properties, which have been characterized in the Social Choice framework (see Candeal et al. [2], Candeal and Induráin [3] and García- Lapresta and Llamazares [6]). i S Liberalism and elitism Liberalism and elitism may be combined in a very natural way. Whenever an individual is part of the elite (but only in this case), it is possible to assign a special weight for this person s evaluation of herself. Consider the collective assessment function: γ S p jj + 1 γ S p ij, if j S and S {j}, S 1 (S, P, j) = 1 S p ij, i S i S\{j} otherwise, where γ S [0, 1], for every S N such that S 2. In the case of S = 1, the second part of the definition guarantees that only the opinion of the individual in S is considered, i.e., ({i}, P, j) = p ij. Whenever γ S = 1 S for any non-empty subset S N with at least two individuals, v 4 is recovered. The γ S = 1 case essentially considers for some cases only the opinion of the individual herself as the collective assessment of the group S. Notice that, while v 1 (S, P, j) = p jj for every S, it is the case that (S, P, j) = 1 p ij whenever j S. S i S Although not from a liberal point of view, the γ S = 0 case may have some interest. Suppose that a committee is evaluating the merits of its members. It is common practice to exclude a member s opinion of herself, and then assign zero weight to her opinion. Finally, we also note that v k ({j}, P, j) = p jj for all k {1,..., 5}, j N and P P.

8 8 Miguel A. Ballester, José Luis García-Lapresta 3 Analysis of convergence Probably the most natural threshold families are those where all the elites use the same threshold α, i.e., α S = α for every S N. In this case, we denote by gv α the collective qualification function associated with α and v. Individuals are qualified whenever the elite opinion about them reaches the corresponding threshold. However, as Corollaries 1, 2, 3 and Theorem 2 highlight, such assumption would extremely restrict the convergence of sequential elitism. These facts may be interpreted as a partial impossibility result. Whenever constant thresholds are at stake, convergence of collective qualification functions leads to a very relaxed notion of group identification. Indeed, only the degenerated case (the extreme liberal) and the benevolent cases ensure convergence under any constant threshold. This result also shows the reason why the rules introduced in Kasher [9], Dimitrov, Sung and Xu [5] and Çengelci and Sanver [4] are well-defined. 5 In the following results, we establish necessary and sufficient conditions on the (general) family of thresholds to guarantee the convergence of collective qualification functions g {α S} v k, for k = 1,..., 5. Theorem 1 Given a family of strictly positive thresholds {α S } S N, the following conditions are equivalent: 1. g {α S} v 1 is convergent. 2. g {α S} v 2 is convergent. 3. For all non-empty sets S, T N, α S α T whenever S T. Proof: To prove that 1 (and 2) implies 3, suppose, by contradiction, that 3 is not true. In this case, there exist two non-empty sets S T such that α S < α T. Consider the profile P defined by: 0, if j N \ T, p ij = α S, if j T \ S, 1, if j S. It is easy to see that for v 1 (and v 2 ), either S 2 = T (whenever α S α N ) or S 2 = S (whenever α S < α N ), and after that, the qualification chain oscillates cyclically between these two sets. Therefore, g {α S} v 1 (and g {α S} v 2 ) is not convergent, which is absurd. To prove that 3 implies 1 (and 2), it is sufficient to note that any qualification chain is decreasing for v 1 (and v 2 ), and therefore, convergent. Convergence in the case of constant thresholds can be directly derived from Theorem 1. Corollary 1 The functions g α v 1 g α v 2 converge for every α [0, 1]. 5 Although the rules introduced in these papers only apply the benevolent case after S 1 is defined, minor modifications have to be included to derive the previous intuition.

9 A model of elitist qualification 9 As we show in the following theorem, convergence is not achievable in the consensus case. Theorem 2 For any family of strictly positive thresholds {α S } S N, g {α S} v 3 is not convergent. Proof: Take a profile P P in which all individual assessments are 1 except p ii = 0 for a given individual i N. It is not hard to see that S 2t 1 = N \ {i} and S 2t = N, for every positive integer t. Therefore, the qualification chain associated with P does not converge. Theorem 3 Given a family of strictly positive thresholds {α S } S N, the following two conditions are equivalent: 1. g {α S} is convergent. 2. For all non-empty sets S, T N, (1 γ T ) S α S ( T 1) α T whenever S T. Proof: See Appendix A. Convergence in the case of constant thresholds can be directly derived from Theorem 3. Corollary 2 The function g α converges if and only if α = 0 or (n = 2 and γ N = 0). Since v 4 is included in the family analyzed in Theorem 3, we can derive the following result. Corollary 3 Given a family of strictly positive thresholds {α S } S N, the following two conditions are equivalent: 1. g {α S} v 4 is convergent. 2. For all non-empty sets S, T N, S α S T α T whenever S T. In particular, g α v 4 is not convergent for any α (0, 1]. Proof: The function g {α S} v 4 is a specific case of g {α S} with γ S = 1 S for every S N such that S 2. Substituting this value in the convergence in Theorem 3, we obtain the condition S α S T α T for every pair of subsets S T N. In order to interpret the above results, we present some brief remarks condition of g {α S} that follow from the necessary and sufficient conditions for the convergence of g {α S} v k. Remark 5 Given a family of strictly positive thresholds {α S } S N, for g {α S} to be convergent, elitism cannot be freely combined with all kinds of liberalism. First, it is necessary that γ T 1 for every T N such that T 2: Taking into account Theorem 3, if γ T = 1, then 0 = (1 γ T ) S α S ( T 1) α T,

10 10 Miguel A. Ballester, José Luis García-Lapresta with S T, i.e., α T = 0, which is absurd. Other upper bounds can be found. Consider, for instance, the family of subsets of T with T 1 elements, i.e., those sets obtained by removing one individual. In this case, for each of these sets S, it must be that 1 γ T α T α S, or equivalently, γ T 1 α T α S. Therefore, the value α T 1 min{α T \{k} k T } is an upper bound for γ T. Naturally, other values can be obtained by considering subgroups of different cardinality. Remark 6 Higher thresholds allow a lower degree of liberalism (when the individual is in the elite group), and viceversa. In extreme cases, if γ T = 0, for every T, it is possible to have α T > 1 T, although it will be α T 1 T 1. If, on the other hand, making thresholds to vary considerably allows us to establish γ T as close to 1 as desired. The function g {α S} v 4 can be seen as a compromise result, in which thresholds vary restrictively, and the opinion about herself yet plays a significant role. Remark 7 Convergence might require the use of very relaxed thresholds. Especially remarkable is the case of g {α S} ˆ, where α T 1 T 1 for every T N, as mentioned in Remark 6. Thus, the described qualification process could end up with all the individuals in the limit set, even in those cases in which there are some individuals who are not highly evaluated by anyone. For instance, a society in which all assessments are α N leads to the qualification of every individual. To correct the problem to some extent, we can introduce a refinement of which enables us to obtain the same results on convergence, while at the same time partially avoiding the above-mentioned issue. To do this, consider an increasing and bijective function ϕ : [0, 1] [0, 1] and the collective assessment function ˆ defined by ˆ (S, P, j) = (S, ϕ(p ), j), where ϕ(p ) ij = ϕ(p ij ). Theorem 3 can be reproduced for g {α S} ˆ. In this case, it is possible to consider an increasing bijective function in the process, such that individual assessments are lowered before the aggregation process. Take, for instance, values p r ik with r > 1. In this case, in the introductory example, no individual passes the first qualification step. In the case of common assessments, an individual would require an evaluation of ϕ 1 (α N ) to be qualified, where this value could be as close to 1 as desired. Notice, however, that an individual j such that p jj = 1 would still be qualified at any step. 4 Symmetry and contractiveness The previous section contains necessary and sufficient conditions for the convergence of collective qualification functions. Under these conditions, for any profile we may interpret the limit set of the associated chain as the final set of qualified individuals in society. Thus, it is possible to conform an (elitist) rule.

11 A model of elitist qualification 11 Definition 5 Let g {α S} v : 2 N P 2 N be a convergent collective qualification function. The rule associated with g {α S} v, f : P 2 N, is defined by means of f(p ) = lim S t for every P P, where S t is the chain associated with g {α S} v and P. We now study two properties of rules associated with convergent collective qualification functions: symmetry and contractiveness. First, we consider that qualification should be symmetric, i.e., not depend on the individuals names. The following axiom reproduces the symmetry axiom in Samet and Schmeidler [12]. We consider permutations π of the set of individuals, N, and interpret π(i) as the former name of the individual whose new name is i. Given S N, we have πs = {π(j) j S}. Moreover, for any profile P P, we denote by πp the profile permutation obtained as (πp ) ij = p π(i)π(j). Definition 6 A rule f : P 2 N is symmetric if f(πp ) = πf(p ) for every P P and every permutation π. In the following proposition we establish a necessary and sufficient condition for symmetry in the case of rules associated with convergent qualification functions. Proposition 1 Let f : P 2 N be the rule associated with a convergent collective qualification function g {α S} v i, i = 1,..., 5. The following two conditions are equivalent: 1. f is symmetric. 2. α S = α T for all S, T N such that S = T. Proof: To prove that 1 implies 2, suppose by way of contradiction that f is symmetric but there exist S, T N such that S = T and α S α T. Without loss of generality, suppose that α S < α T. Consider a permutation π over the set of individuals such that πs = T, and the following profile: { αs, if j S p ij = 0, otherwise. Since f is convergent, Theorems 1, 2 and 3 guarantee that α N α S. Therefore, for any convergent f it must be clearly f(p ) = S and therefore πf(p ) = T. However, given that α S < α T, it is straightforward to see that f(πp ) =. This is an absurd and therefore, 1 implies 2. The proof that 2 implies 1 is trivial, concluding the proof of the proposition. To motivate the following property, consider a society endowed with a certain collective assessment function. Suppose that an individual has not been qualified when the society uses a threshold family which guarantees the convergence of sequential elitism. If this society becomes more demanding by rising all the thresholds it uses for selecting qualified individuals, preserving convergence, such individual should not be qualified either. In other words, the higher the thresholds a society uses, the smaller the set of qualified individuals is.

12 12 Miguel A. Ballester, José Luis García-Lapresta Definition 7 A collective assessment function v is said to be contractive if, for any pair of strictly positive threshold families {α S } S N, {α S } S N, such that g {α S} v and g {α S v } are convergent, then the following holds: α S α S for every S N f (P ) f(p ) for every P P, where f and f are the rules associated with g {α S} v and g {α S v }, respectively. To conclude our analysis, we provide necessary and sufficient conditions for contractiveness. Theorem 4 The collective assessment functions v 1 and v 2 are contractive. Proof: Let {α S } S N and {α S } S N be two strictly positive threshold families such that g {α S} v 1, g {α S} v 2, g {α S v } 1 and g {α S v } 2 are convergent, and α S α S for every S N. By Theorem 1, α S α T and α S α T whenever S T. Since g {α S v } 1 (N, P ) g {α S} v 1 (N, P ), we have f (P ) f(p ) and, consequently, v 1 is contractive. In order to justify that v 2 is contractive, we proceed by induction over each step of the qualification chains associated to g {α S} v 2 and g {α S v } 2. Obviously, S 1 = g {α S v } 2 (N, P ) g {α S} v 2 (N, P ) = S 1, for every P P. Suppose S t S t for a step t 1. If j S t+1 = g {α S v } 2 (S t, P ), then p ij α S for some i S t. Taking into account α t S α t St, we have p ij α St for some i S t, i.e., j S t+1 = g {α S} v 2 (S t, P ). Consequently, S t+1 S t+1 and v 2 is contractive. In the following result we establish a necessary condition for contractiveness for. Proposition { 2 Suppose γ} S = γ s for all S N such that 2 S = s < n and δ j = min 1 γ j, j 1 j for j = 2,..., n 2. If the collective assessment function is contractive, then γ S 1 γ S δ 2 δ s 1, for every S N such that 2 S < n. Proof: See Appendix A. The previous result can be generalized to the case in which thresholds associated to sets with the same cardinality do not necessarily coincide. However, the case presented here is the most natural and, according to Proposition 1, the one that corresponds to symmetric rules. Theorem 5 The collective assessment function v 4 is contractive. Proof: Let {α S } S N and {α S } S N be two strictly positive threshold families such that g {α S} v 4 and g {α S v } 4 are convergent, and α S α S for every S N. By a direct application of Theorem 3, the following conditions S α S T α T and S α S T α T whenever S T are necessary and

13 A model of elitist qualification 13 sufficient for the convergence of the specific v 4 case. For any profile P P, consider the limit sets S = f(p ), S = f (P ) associated with g {α S} v 4 and g {α S v } 4 and P, respectively. We prove that S is contained in S by induction over the sets of the chain that generates S. It is obvious for S 0 = N. Suppose it is true for certain S t. Then, for every j S, it holds that: p ij p ij S α S S α S S t α St i S t i S which implies that j S t+1. Consequently, S S t+1 and f (P ) f(p ). Thus, the induction reasoning proves that v 4 is contractive. Acknowledgements The authors are grateful to Dinko Dimitrov (who introduced us to the problem of Who is a J? and related literature), Carlos Hervés, Jordi Massó, Jorge Nieto, Pedro Rey-Biel, José Ramón Uriarte and two anonymous referees for their suggestions and comments. This work is partially financed by the Spanish Ministerio de Educación y Ciencia (Projects SEJ /ECON and SEJ /ECON), ERDF, Generalitat de Catalunya (grant 2005SJR00454) and Barcelona Economics Economics-XREA. Appendix A: Proofs Proof of Theorem 3 We first show that 1 implies 2. Suppose, by contradiction, that there exist S, T N such that S T and (1 γ T ) S α S < ( T 1) α T. Consider the profile P defined by: ( ) 0, if j N \ T or i N \ S and j T \ S, p ij = α S, if i S and j T \ S, 1, if j S. It is straightforward to see that 1, if j S, (N, P, j) = (1 γ N ) S α S, if j T \ S, n 1 0, if j N \ T. Consequently, S 2 = g {α S} (N, P ) = S, if α N > (1 γ N) S α S, n 1 T, if α N (1 γ N) S α S. n 1

14 14 Miguel A. Ballester, José Luis García-Lapresta Since 1, if j S, (S, P, j) = α S, if j T \ S, 0, if j N \ T, we have g {α S} (S, P ) = T. On the other hand, 1, if j S, (T, P, j) = (1 γ T ) S α S, if j T \ S, T 1 0, if j N \ T. Since (1 γ T ) S α S < ( T 1) α T, we have g {α T } (T, P ) = S. Hence, the collective qualification function g {α S} does not converge. To prove that 2 implies 1, take a family of thresholds satisfying (1 γ T ) S α S ( T 1) α T, whenever S T N. Given a profile P, we prove by induction that the qualification chain is decreasing, hence, convergent. Since S 0 = N, obviously S 1 = g {α S} (S 0, P ) S 0. Suppose S k+1 = g {α S} (S k, P ) S k is true for k = 1,..., t 1 (in particular S t S t 1 ). In order to prove S t+1 S t by contradiction, suppose there exists j S t+1 = g {α S} (S t, P ) such that j S t. In this case, it must be that i.e., (S t, P, j) = 1 p ij α St, S t i S t i S t p ij S t α St. Consider the greatest integer m such that j S m, with m t 1. Notice that this is well-defined, since S 0 = N. By the induction hypothesis, it must be that S t = S t \ {j} S m \ {j} and p ij p ij S t α St. i S t i S m\{j} Therefore, we can use this inequality to ensure that (S m, P, j) = γ Sm p jj + 1 γ S m S m 1 1 γ S m S m 1 i S m \{j} p ij i S m\{j} p ij 1 γ S m S m 1 S t α St.

15 A model of elitist qualification 15 Noticing that = S t S m, we can apply the hypothesis to the family of thresholds, by which we get 1 γ Sm S m 1 S t α St α Sm. Consequently, (S m, P, j) α Sm, i.e., j g {α S} (S m, P ) = S m+1, which either contradicts the definition of m or the fact that j S t. Therefore, the hypothesis that there exists j S t+1 \ S t is false, concluding the induction argument and the proof. Proof of Proposition 2 Suppose, by contradiction, that there exists T N, with 2 T = t < n, such that γ T 1 γ T < δ 2 δ t 1. Let R be a minimal subset satisfying the above property, i.e., γ R 1 γ R < δ 2 δ r 1 and γ S 1 γ S δ 2 δ s 1, for every S R such that S = s 2, and R = r. We now show that there exists a family of thresholds {α S } S N that α s = δ 2 δ s 1 (1 γ s ), such for every S R and S = s, allowing the convergence of. Taking into account Theorem 3, we need to justify that α j s j 1 α s (1 γ j ) for S = s = 2,..., j 1 and j = 3,..., r. First we note that α 2 = 1 γ 2. j = 3 and s = 2: α 3 = δ 2 (1 γ 3 ) (1 γ 2 ) (1 γ 3 ) = α 2 (1 γ 3 ). j = 4 and s = 2: α 4 = δ 2 δ 3 (1 γ 4 ) (1 γ 2 ) 2 3 (1 γ 4) = 2 3 α 2 (1 γ 4 ). j = 4 and s = 3: α 4 = δ 2 δ 3 (1 γ 4 ) δ 2 (1 γ 3 ) (1 γ 4 ) = α 3 (1 γ 4 ). It is straightforward to complete the proof for the rest of values of s and j. We choose α 1 = 1 and the remaining thresholds α S in order to satisfy the convergence conditions of Theorem 3. Now let α s = α s for all s < n and α N = α N ε for a sufficiently small value of ε > 0. Since α S α S for every S N, in order to obtain a contradiction, we now justify why is not contractive. We need to prove that f(p ) is not included in f (P ) for some profile P. Select the profile P defined by: p kk = 1, for some k R, p jj = α N, for every j R \ {k},

16 16 Miguel A. Ballester, José Luis García-Lapresta p ij = 0, for every j N \ R, p ij = 0, for all i, j R \ {k} such that i j, p ij = λ, for all i N \ R and j R, p ik = µ, for every i R \ {k}. The value λ [0, 1] is selected in such a way that: γ N α N + 1 γ N n 1 (n r) λ [α N, α N ). To see that this is possible, notice that, for λ = 0 it holds that: γ N α N + 1 γ N n 1 (n r) λ = γ N α N < α N < α N. On the other hand, for λ = 1 it holds: γ N α N + 1 γ N n 1 (n r) λ 1 γ N n 1 = (1 γ α 1 N) n 1 α N α N. The value µ is selected as follows: If γ N > 0, take µ = 0. If γ N = 0, let µ simultaneously satisfy the following inequalities: n r n 1 λ + r 1 n 1 µ α N = α N + ε µ < α r γ R 1 γ R, i.e., γ R + (1 γ R ) µ < α r = α r. Notice that the first inequality is possible because ε can be as small as we want. On the other hand, α r γ R > 0 is guaranteed by the selection of R and the family of thresholds. In order to see that g {α S v } 5 (N, P ) = R, it is necessary to justify that: (N, P, j) = γ N p jj + 1 γ N n 1 i N\{j} Some simple calculations prove this statement: (N, P, k) = γ N + 1 γ N ((r 1) µ + (n r) λ) n 1 γ N α N + 1 γ N n 1 (n r) λ α N. p ij α N j R. j R \ {k}: (N, P, j) = γ N α N + 1 γ N n 1 (n r) λ α N. j N \ R: (N, P, j) = 0 < α N. We now justify that g {α S } (R, P ) =, i.e., (R, P, j) < α r for every j N:

17 A model of elitist qualification 17 (R, P, k) = γ R + 1 γ R r 1 (r 1) µ = γ R + (1 γ R ) µ < α r (when either γ N = 0 or γ N > 0). j R \ {k}: (R, P, j) = γ R α N γ R < δ 2 δ r 1 (1 γ R ) = α r. j N \ R: (R, P, j) = 0 < α r. Then, f (P ) =. We now justify that g {α S} (N, P ) = {k}: (N, P, k) = γ N + 1 γ N ((r 1) µ + (n r) λ). n 1 1. When γ N > 0, taking into account that µ = 0 and α N < 1, an adequate selection of ε (as small as desired, allowing all requisites) guarantees that: (N, P, k) > γ N α N + ε + 1 γ N n 1 (n r) λ α N + ε = α N. 2. When γ N = 0, it holds that: (N, P, k) = n r n 1 λ + r 1 n 1 µ α N. j R \ {k}: (N, P, j) = γ N α N + 1 γ N n 1 (n r) λ < α N. j N \ R: (N, P, j) = 0 < α N. On the other hand, it is clear that g {α S} ({k}, P ) = {k}. Then, f(p ) = {k} is not included in f (P ) =, contrary to the hypothesis. References 1. Barberà, S., Maschler, M. and Shalev, J.: (2001), Voting for voters: a model of electoral evolution, Games and Economic Behavior 37: Candeal, J.C., Induráin, E. and Uriarte, J.R.: (1992), Some issues related to the topological aggregation of preferences, Social Choice and Welfare 9: Candeal, J.C. and Induráin, E.: (1995), Aggregation of preferences from algebraic models on groups, Social Choice and Welfare 12: Çengelci, M.A. and Sanver, M.R.: (forthcoming), Simple collective identity functions, Theory and Decision. 5. Dimitrov, D., Sung, S.C. and Xu, Y.: (2007), Procedural group identification, Mathematical Social Sciences 54: García-Lapresta, J.L. and Llamazares, B.: (2000), Aggregation of fuzzy preferences: Some rules of the mean, Social Choice and Welfare 17: Houy, N.: (2006), I want to be a J!: Liberalism in group identification problems, Hitotsubashi University. 8. Houy, N.: (2006), He said that he said that I am a J, Economics Bulletin 4(4): 1 6.

18 18 Miguel A. Ballester, José Luis García-Lapresta 9. Kasher, A.: (1993), Jewish collective identity. In: Goldberg, D.T. and Krausz, M. (eds.) Jewish Identity. Temple University Press, Philadelphia, pp Kasher, A. and Rubinstein, A.: (1997), On the question Who is a J?. A social choice approach, Logique & Analyse 160: Miller, A.D.: (2008), Group identification, Games and Economic Behavior, doi: /j.geb Samet, D. and Schmeidler, D.: (2003), Between liberalism and democracy, Journal of Economic Theory 110: Sung, S.C. and Dimitrov, D.: (2005), On the axiomatic characterization of Who is a J?, Logique & Analyse 48 ( ), pp

Using quasiarithmetic means in a sequential decision procedure

Using quasiarithmetic means in a sequential decision procedure Using quasiarithmetic means in a sequential decision procedure Miguel Ángel Ballester Dep. d Economia i d Història Econòmica Universitat Autònoma de Barcelona, Spain mballester@pareto.uab.es José Luis

More information

Identifying Groups in a Boolean Algebra

Identifying Groups in a Boolean Algebra Identifying Groups in a Boolean Algebra Wonki Jo Cho Biung-Ghi Ju June 27, 2018 Abstract We study the problem of determining memberships to the groups in a Boolean algebra. The Boolean algebra is composed

More information

THE UNIVERSITY OF KANSAS WORKING PAPERS SERIES IN THEORETICAL AND APPLIED ECONOMICS

THE UNIVERSITY OF KANSAS WORKING PAPERS SERIES IN THEORETICAL AND APPLIED ECONOMICS THE UNIVERSITY OF KANSAS WORKING PAPERS SERIES IN THEORETICAL AND APPLIED ECONOMICS AN EFFICIENCY CHARACTERIZATION OF PLURALITY SOCIAL CHOICE ON SIMPLE PREFERENCE DOMAINS Biung-Ghi Ju University of Kansas

More information

Favoring Consensus and Penalizing Disagreement in Group Decision Making

Favoring Consensus and Penalizing Disagreement in Group Decision Making Favoring Consensus and Penalizing Disagreement in Group Decision Making Paper: jc*-**-**-**** Favoring Consensus and Penalizing Disagreement in Group Decision Making José Luis García-Lapresta PRESAD Research

More information

Independence of Irrelevant Opinions and Symmetry Imply Liberalism

Independence of Irrelevant Opinions and Symmetry Imply Liberalism Independence of Irrelevant Opinions and Symmetry Imply Liberalism Wonki Jo Cho and Biung-Ghi Ju March 15, 2014 Abstract There are at least three groups and each person has to be identied as a member of

More information

Group Identification

Group Identification Group Identification Alan D. Miller March 26, 2006 Comments welcome. Abstract I study a model of group identification in which individuals opinions as to the membership of a group are aggregated to form

More information

A DISTANCE-BASED EXTENSION OF THE MAJORITY JUDGEMENT VOTING SYSTEM

A DISTANCE-BASED EXTENSION OF THE MAJORITY JUDGEMENT VOTING SYSTEM A DISTANCE-BASED EXTENSION OF THE MAJORITY JUDGEMENT VOTING SYSTEM EDURNE FALCÓ AND JOSÉ LUIS GARCÍA-LAPRESTA Abstract. It is common knowledge that the political voting systems suffer inconsistencies and

More information

Good and bad objects: the symmetric difference rule. Abstract

Good and bad objects: the symmetric difference rule. Abstract Good and bad objects: the symmetric difference rule Dinko Dimitrov Tilburg University Peter Borm Tilburg University Ruud Hendrickx Tilburg University Abstract We consider the problem of ranking sets of

More information

A Cooperative Approach to Queue Allocation of Indivisible Objects

A Cooperative Approach to Queue Allocation of Indivisible Objects A Cooperative Approach to Queue Allocation of Indivisible Objects Herbert Hamers a Flip Klijn b Marco Slikker c Bas van Velzen d September 2004 Abstract We consider the allocation of a finite number of

More information

Triple-acyclicity in majorities based on difference in support

Triple-acyclicity in majorities based on difference in support MPRA Munich Personal RePEc Archive Triple-acyclicity in majorities based on difference in support Bonifacio Llamazares and Patrizia Pérez-Asurmendi University of Valladolid 01 Online at http://mpra.ub.uni-muenchen.de/518/

More information

Coalitionally strategyproof functions depend only on the most-preferred alternatives.

Coalitionally strategyproof functions depend only on the most-preferred alternatives. Coalitionally strategyproof functions depend only on the most-preferred alternatives. H. Reiju Mihara reiju@ec.kagawa-u.ac.jp Economics, Kagawa University, Takamatsu, 760-8523, Japan April, 1999 [Social

More information

A Simplified Test for Preference Rationality of Two-Commodity Choice

A Simplified Test for Preference Rationality of Two-Commodity Choice A Simplified Test for Preference Rationality of Two-Commodity Choice Samiran Banerjee and James H. Murphy December 9, 2004 Abstract We provide a simplified test to determine if choice data from a two-commodity

More information

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements

More information

Rules for Aggregating Information

Rules for Aggregating Information Rules for Aggregating Information Christopher P. Chambers and Alan D. Miller May 1, 2010 Abstract We present a model of information aggregation in which agents information is represented through partitions

More information

PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms

PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION The Peano axioms The following are the axioms for the natural numbers N. You might think of N as the set of integers {0, 1, 2,...}, but it turns

More information

A NEW SET THEORY FOR ANALYSIS

A NEW SET THEORY FOR ANALYSIS Article A NEW SET THEORY FOR ANALYSIS Juan Pablo Ramírez 0000-0002-4912-2952 Abstract: We present the real number system as a generalization of the natural numbers. First, we prove the co-finite topology,

More information

Rationality and solutions to nonconvex bargaining problems: rationalizability and Nash solutions 1

Rationality and solutions to nonconvex bargaining problems: rationalizability and Nash solutions 1 Rationality and solutions to nonconvex bargaining problems: rationalizability and Nash solutions 1 Yongsheng Xu Department of Economics Andrew Young School of Policy Studies Georgia State University, Atlanta,

More information

arxiv: v1 [cs.gt] 10 Apr 2018

arxiv: v1 [cs.gt] 10 Apr 2018 Individual and Group Stability in Neutral Restrictions of Hedonic Games Warut Suksompong Department of Computer Science, Stanford University 353 Serra Mall, Stanford, CA 94305, USA warut@cs.stanford.edu

More information

Preference aggregation and DEA: An analysis of the methods proposed to discriminate efficient candidates

Preference aggregation and DEA: An analysis of the methods proposed to discriminate efficient candidates Preference aggregation and DEA: An analysis of the methods proposed to discriminate efficient candidates Bonifacio Llamazares, Teresa Peña Dep. de Economía Aplicada, PRESAD Research Group, Universidad

More information

UNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics CONSISTENT FIRM CHOICE AND THE THEORY OF SUPPLY

UNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics CONSISTENT FIRM CHOICE AND THE THEORY OF SUPPLY UNIVERSITY OF NOTTINGHAM Discussion Papers in Economics Discussion Paper No. 0/06 CONSISTENT FIRM CHOICE AND THE THEORY OF SUPPLY by Indraneel Dasgupta July 00 DP 0/06 ISSN 1360-438 UNIVERSITY OF NOTTINGHAM

More information

Individual Powers and Social Consent: An Axiomatic Approach

Individual Powers and Social Consent: An Axiomatic Approach Individual Powers and Social Consent: An Axiomatic Approach Biung-Ghi Ju March 8, 2005 Abstract We formalize a notion of conditionally decisive powers of which the exercise depends on social consent. Decisive

More information

On the Chacteristic Numbers of Voting Games

On the Chacteristic Numbers of Voting Games On the Chacteristic Numbers of Voting Games MATHIEU MARTIN THEMA, Departments of Economics Université de Cergy Pontoise, 33 Boulevard du Port, 95011 Cergy Pontoise cedex, France. e-mail: mathieu.martin@eco.u-cergy.fr

More information

Richter-Peleg multi-utility representations of preorders

Richter-Peleg multi-utility representations of preorders Richter-Peleg multi-utility representations of preorders José Carlos R. Alcantud a, Gianni Bosi b,, Magalì Zuanon c a Facultad de Economía y Empresa and Multidisciplinary Institute of Enterprise (IME),

More information

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite

More information

Paretian evaluation of infinite utility streams: an egalitarian criterion

Paretian evaluation of infinite utility streams: an egalitarian criterion MPRA Munich Personal RePEc Archive Paretian evaluation of infinite utility streams: an egalitarian criterion José Carlos R. Alcantud and María D. García-Sanz Universidad de Salamanca, Spain 17. December

More information

Collective transitivity in majorities based on difference in support

Collective transitivity in majorities based on difference in support Collective transitivity in majorities based on difference in support Bonifacio Llamazares a,, Patrizia Pérez-Asurmendi b, José Luis García-Lapresta a a PRESAD Research Group, IMUVA, Dep. of Applied Economics,

More information

Existence of Nash Networks in One-Way Flow Models

Existence of Nash Networks in One-Way Flow Models Existence of Nash Networks in One-Way Flow Models pascal billand a, christophe bravard a, sudipta sarangi b a CREUSET, Jean Monnet University, Saint-Etienne, France. email: pascal.billand@univ-st-etienne.fr

More information

A MAXIMAL DOMAIN FOR STRATEGY-PROOF AND NO-VETOER RULES IN THE MULTI-OBJECT CHOICE MODEL

A MAXIMAL DOMAIN FOR STRATEGY-PROOF AND NO-VETOER RULES IN THE MULTI-OBJECT CHOICE MODEL Discussion Paper No. 809 A MAXIMAL DOMAIN FOR STRATEGY-PROOF AND NO-VETOER RULES IN THE MULTI-OBJECT CHOICE MODEL Kantaro Hatsumi Dolors Berga Shigehiro Serizawa April 2011 The Institute of Social and

More information

Interval values for strategic games in which players cooperate

Interval values for strategic games in which players cooperate Interval values for strategic games in which players cooperate Luisa Carpente 1 Balbina Casas-Méndez 2 Ignacio García-Jurado 2 Anne van den Nouweland 3 September 22, 2005 Abstract In this paper we propose

More information

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries 1. Introduction In this paper we reconsider the problem of axiomatizing scoring rules. Early results on this problem are due to Smith (1973) and Young (1975). They characterized social welfare and social

More information

Rationalization of Collective Choice Functions by Games with Perfect Information. Yongsheng Xu

Rationalization of Collective Choice Functions by Games with Perfect Information. Yongsheng Xu Rationalization of Collective Choice Functions by Games with Perfect Information by Yongsheng Xu Department of Economics, Andrew Young School of Policy Studies Georgia State University, Atlanta, GA 30303

More information

Course 212: Academic Year Section 1: Metric Spaces

Course 212: Academic Year Section 1: Metric Spaces Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........

More information

Existence of Stability in Hedonic Coalition Formation Games

Existence of Stability in Hedonic Coalition Formation Games Existence of Stability in Hedonic Coalition Formation Games ABSTRACT Haris Aziz Department of Informatics Technische Universität München 85748 Garching bei München, Germany aziz@in.tum.de In this paper,

More information

Introduction. 1 University of Pennsylvania, Wharton Finance Department, Steinberg Hall-Dietrich Hall, 3620

Introduction. 1 University of Pennsylvania, Wharton Finance Department, Steinberg Hall-Dietrich Hall, 3620 May 16, 2006 Philip Bond 1 Are cheap talk and hard evidence both needed in the courtroom? Abstract: In a recent paper, Bull and Watson (2004) present a formal model of verifiability in which cheap messages

More information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

Arrow s Paradox. Prerna Nadathur. January 1, 2010

Arrow s Paradox. Prerna Nadathur. January 1, 2010 Arrow s Paradox Prerna Nadathur January 1, 2010 Abstract In this paper, we examine the problem of a ranked voting system and introduce Kenneth Arrow s impossibility theorem (1951). We provide a proof sketch

More information

A general class of simple majority decision rules based on linguistic opinions

A general class of simple majority decision rules based on linguistic opinions A general class of simple majority decision rules based on linguistic opinions José Luis García-Lapresta Dept. de Economía Aplicada (Matemáticas), Universidad de Valladolid Avda. Valle de Esgueva 6, 47011

More information

Existence of sparsely supported correlated equilibria

Existence of sparsely supported correlated equilibria Existence of sparsely supported correlated equilibria Fabrizio Germano fabrizio.germano@upf.edu Gábor Lugosi lugosi@upf.es Departament d Economia i Empresa Universitat Pompeu Fabra Ramon Trias Fargas 25-27

More information

Fair and Efficient Student Placement with Couples

Fair and Efficient Student Placement with Couples Fair and Efficient Student Placement with Couples Bettina Klaus Flip Klijn March 2006 Abstract We study situations of allocating positions to students based on priorities. An example is the assignment

More information

Regular finite Markov chains with interval probabilities

Regular finite Markov chains with interval probabilities 5th International Symposium on Imprecise Probability: Theories and Applications, Prague, Czech Republic, 2007 Regular finite Markov chains with interval probabilities Damjan Škulj Faculty of Social Sciences

More information

Social Choice. Jan-Michael van Linthoudt

Social Choice. Jan-Michael van Linthoudt Social Choice Jan-Michael van Linthoudt Summer term 2017 Version: March 15, 2018 CONTENTS Remarks 1 0 Introduction 2 1 The Case of 2 Alternatives 3 1.1 Examples for social choice rules............................

More information

Chapter One. The Real Number System

Chapter One. The Real Number System Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and

More information

ENCOURAGING THE GRAND COALITION IN CONVEX COOPERATIVE GAMES

ENCOURAGING THE GRAND COALITION IN CONVEX COOPERATIVE GAMES STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume LIV, Number 1, March 2009 ENCOURAGING THE GRAND COALITION IN CONVEX COOPERATIVE GAMES TITU ANDREESCU AND ZORAN ŠUNIĆ Abstract. A solution function for convex

More information

Introduction to Topology

Introduction to Topology Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about

More information

DR.RUPNATHJI( DR.RUPAK NATH )

DR.RUPNATHJI( DR.RUPAK NATH ) Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology

More information

The Axiomatic Method in Social Choice Theory:

The Axiomatic Method in Social Choice Theory: The Axiomatic Method in Social Choice Theory: Preference Aggregation, Judgment Aggregation, Graph Aggregation Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss

More information

Discussion Paper Series

Discussion Paper Series INSTITUTO TECNOLÓGICO AUTÓNOMO DE MÉXICO CENTRO DE INVESTIGACIÓN ECONÓMICA Discussion Paper Series Lower bounds and recursive methods for the problem of adjudicating conflicting claims Diego Domínguez

More information

The doubly negative matrix completion problem

The doubly negative matrix completion problem The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica

More information

Dividends and Weighted Values in Games with Externalities

Dividends and Weighted Values in Games with Externalities Dividends and Weighted Values in Games with Externalities Inés Macho-Stadler David Pérez-Castrillo David Wettstein August 28, 2009 Abstract In this paper, we provide further support for the family of average

More information

Entropic Selection of Nash Equilibrium

Entropic Selection of Nash Equilibrium Entropic Selection of Nash Equilibrium Zeynel Harun Alioğulları Mehmet Barlo February, 2012 Abstract This study argues that Nash equilibria with less variations in players best responses are more appealing.

More information

Chapter 2 Metric Spaces

Chapter 2 Metric Spaces Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics

More information

Seunghee Ye Ma 8: Week 2 Oct 6

Seunghee Ye Ma 8: Week 2 Oct 6 Week 2 Summary This week, we will learn about sequences and real numbers. We first define what we mean by a sequence and discuss several properties of sequences. Then, we will talk about what it means

More information

A BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox

A BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox A BRIEF INTRODUCTION TO ZFC CHRISTOPHER WILSON Abstract. We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular

More information

No-envy in Queueing Problems

No-envy in Queueing Problems No-envy in Queueing Problems Youngsub Chun School of Economics Seoul National University Seoul 151-742, Korea and Department of Economics University of Rochester Rochester, NY 14627, USA E-mail: ychun@plaza.snu.ac.kr

More information

Mathematical Reasoning & Proofs

Mathematical Reasoning & Proofs Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0

More information

Existence Theorems of Continuous Social Aggregation for Infinite Discrete Alternatives

Existence Theorems of Continuous Social Aggregation for Infinite Discrete Alternatives GRIPS Discussion Paper 17-09 Existence Theorems of Continuous Social Aggregation for Infinite Discrete Alternatives Stacey H. Chen Wu-Hsiung Huang September 2017 National Graduate Institute for Policy

More information

THREE BRIEF PROOFS OF ARROW S IMPOSSIBILITY THEOREM JOHN GEANAKOPLOS COWLES FOUNDATION PAPER NO. 1116

THREE BRIEF PROOFS OF ARROW S IMPOSSIBILITY THEOREM JOHN GEANAKOPLOS COWLES FOUNDATION PAPER NO. 1116 THREE BRIEF PROOFS OF ARROW S IMPOSSIBILITY THEOREM BY JOHN GEANAKOPLOS COWLES FOUNDATION PAPER NO. 1116 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY Box 208281 New Haven, Connecticut 06520-8281

More information

Tijmen Daniëls Universiteit van Amsterdam. Abstract

Tijmen Daniëls Universiteit van Amsterdam. Abstract Pure strategy dominance with quasiconcave utility functions Tijmen Daniëls Universiteit van Amsterdam Abstract By a result of Pearce (1984), in a finite strategic form game, the set of a player's serially

More information

MA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra

MA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra 206/7 MA03 Introduction to Abstract Mathematics Second part, Analysis and Algebra Amol Sasane Revised by Jozef Skokan, Konrad Swanepoel, and Graham Brightwell Copyright c London School of Economics 206

More information

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

CHAPTER 6. Prime Numbers. Definition and Fundamental Results CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n

More information

NUMBERS. Michael E. Taylor

NUMBERS. Michael E. Taylor NUMBERS Michael E. Taylor Contents 1. Peano arithmetic 2. The integers 3. Prime factorization and the fundamental theorem of arithmetic 4. The rational numbers 5. Sequences 6. The real numbers 7. Irrational

More information

Part III. 10 Topological Space Basics. Topological Spaces

Part III. 10 Topological Space Basics. Topological Spaces Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together

More information

Social Choice Theory. Felix Munoz-Garcia School of Economic Sciences Washington State University. EconS Advanced Microeconomics II

Social Choice Theory. Felix Munoz-Garcia School of Economic Sciences Washington State University. EconS Advanced Microeconomics II Social Choice Theory Felix Munoz-Garcia School of Economic Sciences Washington State University EconS 503 - Advanced Microeconomics II Social choice theory MWG, Chapter 21. JR, Chapter 6.2-6.5. Additional

More information

Comment on The Veil of Public Ignorance

Comment on The Veil of Public Ignorance Comment on The Veil of Public Ignorance Geoffroy de Clippel February 2010 Nehring (2004) proposes an interesting methodology to extend the utilitarian criterion defined under complete information to an

More information

An equity-efficiency trade-off in a geometric approach to committee selection Daniel Eckert and Christian Klamler

An equity-efficiency trade-off in a geometric approach to committee selection Daniel Eckert and Christian Klamler An equity-efficiency trade-off in a geometric approach to committee selection Daniel Eckert and Christian Klamler An equity-efficiency trade-off in a geometric approach to committee selection Daniel Eckert

More information

Theoretical Computer Science

Theoretical Computer Science Theoretical Computer Science 411 (2010) 3224 3234 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs N-player partizan games Alessandro

More information

Aggregation and Non-Contradiction

Aggregation and Non-Contradiction Aggregation and Non-Contradiction Ana Pradera Dept. de Informática, Estadística y Telemática Universidad Rey Juan Carlos. 28933 Móstoles. Madrid. Spain ana.pradera@urjc.es Enric Trillas Dept. de Inteligencia

More information

Hans Peters, Souvik Roy, Ton Storcken. Manipulation under k-approval scoring rules RM/08/056. JEL code: D71, D72

Hans Peters, Souvik Roy, Ton Storcken. Manipulation under k-approval scoring rules RM/08/056. JEL code: D71, D72 Hans Peters, Souvik Roy, Ton Storcken Manipulation under k-approval scoring rules RM/08/056 JEL code: D71, D72 Maastricht research school of Economics of TEchnology and ORganizations Universiteit Maastricht

More information

Antipodality in committee selection. Abstract

Antipodality in committee selection. Abstract Antipodality in committee selection Daniel Eckert University of Graz Christian Klamler University of Graz Abstract In this paper we compare a minisum and a minimax procedure as suggested by Brams et al.

More information

On Domains That Admit Well-behaved Strategy-proof Social Choice Functions

On Domains That Admit Well-behaved Strategy-proof Social Choice Functions On Domains That Admit Well-behaved Strategy-proof Social Choice Functions Shurojit Chatterji, Remzi Sanver and Arunava Sen May 2010 Paper No. 07-2010 ANY OPINIONS EXPRESSED ARE THOSE OF THE AUTHOR(S) AND

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

More information

Hierarchy among Automata on Linear Orderings

Hierarchy among Automata on Linear Orderings Hierarchy among Automata on Linear Orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 Abstract In a preceding paper, automata and rational

More information

GENERALIZATIONS OF SOME ZERO-SUM THEOREMS. Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad , INDIA

GENERALIZATIONS OF SOME ZERO-SUM THEOREMS. Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad , INDIA INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A52 GENERALIZATIONS OF SOME ZERO-SUM THEOREMS Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad

More information

Revealed Reversals of Preferences

Revealed Reversals of Preferences Revealed Reversals of Preferences Houy Nicolas October 5, 2009 Abstract We weaken the implicit assumption of rational choice theory that imposes that preferences do not depend on the choice set. We concentrate

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

Resource Allocation via the Median Rule: Theory and Simulations in the Discrete Case

Resource Allocation via the Median Rule: Theory and Simulations in the Discrete Case Resource Allocation via the Median Rule: Theory and Simulations in the Discrete Case Klaus Nehring Clemens Puppe January 2017 **** Preliminary Version ***** Not to be quoted without permission from the

More information

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed

More information

Extension of continuous functions in digital spaces with the Khalimsky topology

Extension of continuous functions in digital spaces with the Khalimsky topology Extension of continuous functions in digital spaces with the Khalimsky topology Erik Melin Uppsala University, Department of Mathematics Box 480, SE-751 06 Uppsala, Sweden melin@math.uu.se http://www.math.uu.se/~melin

More information

Málaga Economic Theory Research Center Working Papers

Málaga Economic Theory Research Center Working Papers Málaga Economic Theory Research Center Working Papers A Sensitive Flexible Network Approach Noemí Navarro WP 28-2 March 28 Revised September 28 Departamento de Teoría e Historia Económica Facultad de Ciencias

More information

Monotonic models and cycles

Monotonic models and cycles Int J Game Theory DOI 10.1007/s00182-013-0385-7 Monotonic models and cycles José Alvaro Rodrigues-Neto Accepted: 16 May 2013 Springer-Verlag Berlin Heidelberg 2013 Abstract A partitional model of knowledge

More information

Boolean Inner-Product Spaces and Boolean Matrices

Boolean Inner-Product Spaces and Boolean Matrices Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver

More information

Extending difference of votes rules on three voting models.

Extending difference of votes rules on three voting models. University of Louisville ThinkIR: The University of Louisville's Institutional Repository Electronic Theses and Dissertations 8-2017 Extending difference of votes rules on three voting models. Sarah Schulz

More information

arxiv: v1 [math.fa] 14 Jul 2018

arxiv: v1 [math.fa] 14 Jul 2018 Construction of Regular Non-Atomic arxiv:180705437v1 [mathfa] 14 Jul 2018 Strictly-Positive Measures in Second-Countable Locally Compact Non-Atomic Hausdorff Spaces Abstract Jason Bentley Department of

More information

An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees

An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees Francesc Rosselló 1, Gabriel Valiente 2 1 Department of Mathematics and Computer Science, Research Institute

More information

AN ORDINAL SOLUTION TO BARGAINING PROBLEMS WITH MANY PLAYERS

AN ORDINAL SOLUTION TO BARGAINING PROBLEMS WITH MANY PLAYERS AN ORDINAL SOLUTION TO BARGAINING PROBLEMS WITH MANY PLAYERS ZVI SAFRA AND DOV SAMET Abstract. Shapley proved the existence of an ordinal, symmetric and efficient solution for three-player bargaining problems.

More information

Economics 204 Fall 2011 Problem Set 1 Suggested Solutions

Economics 204 Fall 2011 Problem Set 1 Suggested Solutions Economics 204 Fall 2011 Problem Set 1 Suggested Solutions 1. Suppose k is a positive integer. Use induction to prove the following two statements. (a) For all n N 0, the inequality (k 2 + n)! k 2n holds.

More information

Isomorphisms between pattern classes

Isomorphisms between pattern classes Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.

More information

A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries

A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries Johannes Marti and Riccardo Pinosio Draft from April 5, 2018 Abstract In this paper we present a duality between nonmonotonic

More information

arxiv: v2 [cs.dm] 29 Mar 2013

arxiv: v2 [cs.dm] 29 Mar 2013 arxiv:1302.6346v2 [cs.dm] 29 Mar 2013 Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks Adrien Richard Laboratoire I3S, CNRS & Université de Nice-Sophia Antipolis, France.

More information

CS264: Beyond Worst-Case Analysis Lecture #11: LP Decoding

CS264: Beyond Worst-Case Analysis Lecture #11: LP Decoding CS264: Beyond Worst-Case Analysis Lecture #11: LP Decoding Tim Roughgarden October 29, 2014 1 Preamble This lecture covers our final subtopic within the exact and approximate recovery part of the course.

More information

FINITE ABELIAN GROUPS Amin Witno

FINITE ABELIAN GROUPS Amin Witno WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every

More information

Fairness and Redistribution: Response

Fairness and Redistribution: Response Fairness and Redistribution: Response By ALBERTO ALESINA, GEORGE-MARIOS ANGELETOS, AND GUIDO COZZI This paper responds to the comment of Di Tella and Dubra (211). We first clarify that the model of Alesina

More information

Journal of Informetrics

Journal of Informetrics Journal of Informetrics 2 (2008) 298 303 Contents lists available at ScienceDirect Journal of Informetrics journal homepage: www.elsevier.com/locate/joi A symmetry axiom for scientific impact indices Gerhard

More information

TitleList-based decision problems Author(s) Dimitrov, Dinko; Mukherjee, Saptars Citation Issue 2013-03 Date Type Technical Report Text Version publisher URL http://hdl.handle.net/10086/25504 Right Hitotsubashi

More information

Cooperative assignment games with the inverse Monge property

Cooperative assignment games with the inverse Monge property Cooperative assignment games with the inverse Monge property F. Javier Martínez-de-Albéniz a,1, Carles Rafels a a Dep. de Matemàtica Econòmica, Financera i Actuarial Universitat de Barcelona Av. Diagonal

More information

2. Prime and Maximal Ideals

2. Prime and Maximal Ideals 18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let

More information

ANDREW YOUNG SCHOOL OF POLICY STUDIES

ANDREW YOUNG SCHOOL OF POLICY STUDIES ANDREW YOUNG SCHOOL OF POLICY STUDIES On procedures for measuring deprivation and living standards of societies in a multi-attribute framework Prasanta K. Pattanaik Department of Economics, University

More information

Risk Aversion over Incomes and Risk Aversion over Commodities. By Juan E. Martinez-Legaz and John K.-H. Quah 1

Risk Aversion over Incomes and Risk Aversion over Commodities. By Juan E. Martinez-Legaz and John K.-H. Quah 1 Risk Aversion over Incomes and Risk Aversion over Commodities By Juan E. Martinez-Legaz and John K.-H. Quah 1 Abstract: This note determines the precise connection between an agent s attitude towards income

More information