Utility Representation of Lower Separable Preferences
|
|
- Jack Potter
- 5 years ago
- Views:
Transcription
1 Utility Representation of Lower Separable Preferences Özgür Yılmaz June 2008 Abstract Topological separability is crucial for the utility representation of a complete preference relation. When preferences are incomplete, this axiom has suitably defined counterparts: upper separability and lower separability (Ok (2002)). We consider the problem of representing an incomplete preference relation by means of a vector-valued utility function; we obtain representation results under the lower separability assumption. Our results extend the main representation theorems by Ok (2002) in terms of the separability axioms. Keywords: Incomplete Preferences, Utility Representation, Upper/Lower Separability, Near-completeness Journal of Economic Literature Classification Number: D11 1 Introduction Preference relations are usually assumed to satisfy completeness and transitivity. These two properties have been the core axioms, tying self-interest to rationality. They are also useful for analytical tractability. Particularly, the possibility of representation by real-valued functions owes much to the completeness axiom. However, for most problems of individual decision making, it seems unrealistic to assume completeness. Our focus is the utility representation without the completeness axiom. College of Administrative Science and Economics, Koç University, Sarıyer, İstanbul, Turkey 34450; Fax: ; address: ozyilmaz@ku.edu.tr 1
2 Obviously, an incomplete preorder can not be represented by a real-valued utility function. The scope of this limitation of analytical tractability is extensively discussed in the literature. 1 Basically, in the case of incomplete preferences, while utility representation is not possible, one may still find a utility function that represents the preference order in a weaker sense: as before, if x is preferred to y then u(x) > u(y), but the opposite implication is no longer true. This approach is explored by Richter (1966) and Peleg (1970). Clearly, this quasi-representation is very much problematic, because the preorder cannot be recovered from the utility function u. An alternative approach is representation by means of a vector-valued utility function. 2 The question is whether, given a preorder, it is possible to find a function u : X R n for some positive integer n such that, for each x, y X, x y if and only if u(x) u(y). As a natural extension of the classical utility representation, multi-criteria decision making is not only intuitive but also analytically convenient. Ok (2002) shows that, under certain topological separability assumptions, a not-too-incomplete preference relation, a preference relation such that any subset of mutually incomparable alternatives is finite, can be represented by a vector-valued utility function. First, he suggests two counterparts of the usual separability axiom, upper separability and lower separability, which are suitably defined for incomplete preferences. Then, he shows that upper separability is sufficient for the vector-valued utility representation; also, he shows that upper and lower separability together imply the existence of an upper semicontinuous vector-valued utility representation. We extend these results in terms of the separability axioms: we show that lower separability is sufficient for representability by means of a vector-valued utility function (Theorem 3); it follows from this result that lower separability is also the key axiom for the existence of such a function that is upper semicontinuous (Theorem 4). 1 See Aumann (1962), Richter (1966), Peleg (1970), and Sondermann (1980). 2 For a discussion of the multi-attribute utility representation, see Ok (2002) and Eliaz and Ok (2006). 2
3 2 Preliminary Definitions and Existing Results Let be a binary relation on a set of alternatives X. Two alternatives x and y are -comparable if either x y or y x holds. They are -incomparable if they are not -comparable. For each -incomparable pair of alternatives x and y, we write x y. A binary relation is complete if and only if each x and y in X are -comparable. The strict (asymmetric) part of, denoted by, is the relation on X defined as x y if and only if x y and (y x). The symmetric part of, denoted by, is the relation on X defined as x y if and only if x y and y x. For each Y X, the relation induced by on Y, denoted Y, is defined as Y (Y Y ). The relation is an extension of, if and. A relation is a preorder if is reflexive and transitive, a partial order if it is an antisymmetric preorder, a linear order if it is a complete partial order. A preordered set is a pair (X, ) such that X is a nonempty set and is a preorder on X. Let (X, ) be a preordered set. A subset Y of X is -dense if, for each pair x, y X with x y, there is z Y such that x z y. The preorder is weakly separable if there is a countable -dense set in X. Clearly, if is weakly separable, then X is infinite. A preordered set (X, ) is a poset (partially ordered set) if is a partial order on X. Given a poset (X, ), the partial order is spacious if x y implies that {z : z X and x z} Closure{z : z X and y z}. Theorem 1 Peleg (1970) Let be a partial order on a nonempty set X. If for each x X, {y : y X and x y} is open and is weakly separable and spacious, then there exists a continuous function u : X [0, 1] such that for each x, y X, x y implies u(x) > u(y). A poset (X, ) is a chain if is a linear order, and an antichain if =. Clearly, if (X, ) is a chain, then =, and if it is an antichain, then = {(x, y) : x y}. A chain in a poset (X, ) is a set Y X such that the relation Y is complete. Similarly, a set Y X is an antichain in a poset (X, ) if Y =. An antichain Y in (X, ) is of maximal cardinality if its cardinality is at least as large as that of each antichain in (X, ). In this case, the cardinality of Y is the width of the poset (X, ). It is denoted by w(x, ). Clearly, the width of each chain 3
4 is zero, while the width of an antichain (X, ) is X. An important result which we will use extensively in the following analysis is Dilworth s Decomposition Theorem (1950): If (X, ) is a poset with finite width w, then X is the union of w chains in (X, ). For each poset (X, ), let L(X, ) be the set of all extensions of that are linear orders. By the classical Szpilrajn s Theorem (1930), each partial order can be extended to a linear order. Thus, for each poset (X, ), L(X, ). From this result, it follows that, for each poset (X, ), = R L(X, ) R, that is, each partial order is the intersection of all of its linear extensions. The order dimension of a poset (X, ), denoted as dim(x, ), is the minimum number of linear extensions of, the intersection of which is, provided that this number is finite, and is, otherwise. That is, dim(x, ) min{k N : R i L(X, ), i = 1,..., k, and = n i=1 R i}. For each poset (X, ), w(x, ) dim(x, ) (Hiragushi (1955)). A partial order is representable if there is a positive integer n and a function u : X R n such that, for each x, y X, x y u(x) u(y). Proposition 1 Ok (2002) Let be a partial order on a nonempty set X. If is representable, then dim(x, ) <. Moreover, if X is countable and dim(x, ) <, then is representable. Since w(x, ) dim(x, ), it implies, that if X is countable and w(x, ) is finite, then is representable. Our focus, on the other hand, is on representability without the restriction that X is a countable set. We analyze this problem in the following section. 3 Representation of Near-Complete Preferences A natural conception of the degree of incompleteness is near-completeness: A preorder is nearcomplete, if each subset A of X, with x y for each distinct x, y in A, is finite (Ok (2002)). 4
5 Thus, a partial order on X is near-complete if and only if w(x, ) <. Let (X, ) be any preordered set. A subset Y of X is upper -dense if, for each x, y X such that x y, there is z Y such that x z y. It is lower -dense if, for each x, y X such that x y, there is z Y such that x z y. A preorder is upper (lower) separable if there is a countable set in X which is both -dense and upper (lower) -dense. Finally, is separable if it is both upper and lower separable. Theorem 2 Ok (2002) Let X be any nonempty set and let be a near-complete and upper separable partial order on X. Then, is representable. Our first result is the counterpart of this theorem in terms of the separability assumption. We replace upper separability with lower separability and obtain a representability result. Theorem 3 Let X be any nonempty set and let be a near-complete and lower separable partial order on X. Then, is representable. Proof. Let (X, ) be a poset such that its width is n <, and is lower separable. By Dilworth s Decomposition Theorem, there is a partition of X, say X 1, X 2,..., X n such that, for each k, Xk is a linear order on X k. For each k, define R k and R k as follows: x R k y x X k and z X k s.t. x z y, x R k y x X k and x y. Then define the relation k = R k R k. Step 1: k is a partial order. Reflexivity of k : It follows from reflexivity of. Antisymmetry of k : Let x k y k x. Suppose x y. There are three cases: i) x y. Thus, (y x), and it implies (y R k x). Since is antisymmetric, y R k x. By definition of R k, there is z X k such that y z x. Since x y, transitivity of implies that x z. It contradicts with z x. 5
6 ii) x R k y. By definition of R k, x X k and there is z X k such that x z y. Suppose y R k x. Then, there is z X k such that x z y z x. Clearly, z = z is impossible. If z z, then transitivity of implies x z. It contradicts with z x. If z z, transitivity of implies y z. It contradicts with z y. Note that since z and z are in X k, and X k is a chain, z and z are -comparable. Suppose y x. It implies x z y x. This contradicts with transitivity of. Finally, since z X k, y X k and (y R k x). iii) x R k y. By definition of R k, x X k and x y. Since X k is a chain, y X k and (y R k x). Thus, y R k x, and there is z X k such that y z x. But, since x, z X k, it is not possible. Thus, x k y k x implies x = y. Thus, k is antisymmetric. Transitivity of k : Let x k y k z. If x y z, then, by transitivity of, x z. Note that, x R k y implies y X k and (y R k z) for each z X. Thus, x R k y R k z is not possible. Also, since X k is a chain and x a y for some a X k, y X k. Then, for each z X, (y R k z). Thus, x R k y R k z is not possible. There are six cases left to be considered: i) x y R k z By definition of R k, y X k and there is a X k such that x y a z. If x X k, then transitivity of implies x R k z. Suppose x X k. Since x y a z, either x z or x z. If x z, then x R k z. In either case, x k z. ii) x R k y z There is a X k such that x a y z, where x X k. Since a and y are -incomparable, either a z or a z. If a z, then x z. If a z, then, since x X k and a X k, x a z implies x R k z. Thus, x k z. iii) x R k y R k z There are a, b X k such that x a y b z where x, y X k. Since X k is a chain, a and b are -comparable. Since x a y b, a b. If b a, then y a. It is a contradiction. Thus, a b. By transitivity of, x b z. Thus, x k z. iv) x y R k z 6
7 If x X k, then, since y X k and x y z, x R k z. Suppose x X k. If z x, then z y. It is a contradiction. Thus, either x z or x z. If x z, then, by definition of R k, x R k z. In both cases, x k z. v) x R k y z Clearly, z x is not possible. Thus, either x z or x z. Since x X k, the latter implies x R k z. Thus, x k z. vi) x R k y R k z There is a X k such that x y a z, where x X k. Clearly, a x is not possible. Since X k is a chain, and both x and a are in X k, x a. If z x, then z a. It is a contradiction. Thus, either x z or x z. Since x X k, the latter implies x R k z. In both cases, x k z. Thus, k is transitive. Thus, k is a partial order. Step 2: k is weakly separable. Since is lower separable, there is a countable set Y in X which is both -dense and lower -dense. We claim that Y is k -dense in X. Let x, y X such that x k y, where k is the strict part of k. i) x y Since Y is -dense, there is z Y such that x z y. Thus, there is z Y such that x k z k y. ii) x R k y By definition of R k, x X k and x y. By lower -denseness of Y, there is z Y such that x z y. Since x X k, x R k z. Clearly, x, y, z are all distinct. Thus, x k z k y. iii) x R k y There is a X k such that x a y, where x X k. Since Y is lower -dense, there is z Y such that x a z y. Then, x R k z. Since x and z are distinct, x k z k y. We conclude that there is a countable set Y in X, which is k -dense in X. Thus, k is a weakly separable partial order on X. Step 3: Constructing multi-vector utility indices that represent. We have shown that (X, k ) is a poset and for each k = 1,..., n, k is weakly separable. By 7
8 Theorem 1 above, there is a function ϕ k : X [0, 1] such that, for each x, y X and for each k, x k y implies ϕ k (x) > ϕ k (y). Note that, for each k, x y implies x k y and ϕ k (x) > ϕ k (y). Suppose there are x, y X such that x y. Since X 1,..., X n is a partition of X, and for each k, Xk is complete, there are i, j with i j, such that x X i and y X j. By definition of R k, x R k y and y R k x. Thus, x i y and y j x. Thus, ϕ i (x) > ϕ i (y) and ϕ j (y) > ϕ j (x). Finally, for each x X, define u(x) = (ϕ 1 (x),..., ϕ n (x)). This completes the proof. Our next result is on the upper semicontinuous representation of. This is an important result because upper semicontinuity is often sufficient for maximization of utility functions. Theorem 4 Let X be a topological space and let be a near-complete and lower separable partial order on X such that {y : x y} is open for each x X. Then there exists an upper semicontinuous mapping u :X [0, 1] n with n being the width of (X, ), such that x y if and only if u(x) u(y) for each x, y X. Proof. Following Ok (2002), we define the mapping u k : X [0, 1] as ϕ k (x) u k (a) = Inf b U(a) Sup t L(b) ϕ k (t) if U(a) = otherwise where ϕ k is the utility function in Theorem 3, for each a X, U(a) = {b : b a} and L(a) = {t : a t}. Let x, y X. If x y, then, by weak separability, there is z U(y) such that x z. By Theorem 1 above, ϕ k (x) > ϕ k (z). Since U(y) and u k (y) = Inf b U(y) Sup t L(b) ϕ k (t) Sup t L(z) ϕ k (t), where z U(y), Sup t L(z) ϕ k (t) u k (y). Thus, by definition of u k, u k (x) ϕ k (x) > ϕ k (z) Sup t L(z) ϕ k (t) u k (y). Thus, x y implies that, for each k, u k (x) > u k (y). Now, suppose x y. By lower separability, there is z X such that x z y. Since X 1,..., X n is a partition of X and each set in this 8
9 partition is a chain, x X k and z X k for some k. Thus, x k z and ϕ k (x) > ϕ k (z). Since z y, the inequalities above apply. Thus, u k (x) ϕ k (x) > ϕ k (z) Sup t L(z) ϕ k (t) u k (y). Since is symmetric, for some l k, u l (y) > u l (x). Thus, x (=)y holds if and only if, for each k, u k (x) > (=)u k (y) Thus is represented by u = (u 1,..., u n ). Finally, we need to show that, for each k, u k is upper semicontinuous. To this end, we repeat the argument in the proof of Theorem 2 in Ok (2002): First, note u 1 k [θ, 1] is closed for θ 0 or θ 1. For upper semicontinuity, let θ (0, 1). Let (x α ) α A be a sequence in X such that, for each α A, x α a and u k (x α ) θ. If, for some α A, a x α, then u k (a) u k (x α ) θ. Now, assume that, for each α A, either x α a or x α a. Then, lower separability of implies U(a). Let b U(a), and observe that, since L(b) is open, there is α(b) A such that x α(b) L(b). Thus, for each b U(a), Sup t L(b) ϕ k (t) u k (x α(b) ) θ. It implies u k (a) = Inf b U(a) Sup t L(b) ϕ k (t) θ. Thus, u k is upper semicontinuous. Since k is chosen arbitrarily, u is upper semicontinuous. This completes the proof. Ok (2002) proves a corollary of this theorem; the difference is that he assumes separability instead of lower separability. Thus, Theorem 4 extends his result to lower separable partial orders. 4 Conclusion We extend some of the existing results on the multi-vector utility representation by Ok (2002) in terms of separability assumptions. In its technicality, it is restricted to near-complete preferences. We showed that a lower separable partial order is representable by means of a multi-vector utility function. We also show that a lower separable partial order can be represented by an upper semicontinuous vector-valued utility function. 9
10 REFERENCES Aumann, R., Utility theory without the completeness axiom. Econometrica 30, Dilworth, R., A decomposition theorem for partially ordered sets. Annals of Mathematics 51, Donaldson, D., Weymark, J., A quasiordering is the intersection of orderings. Journal of Economic Theory 78, Duggan, J., A general extension theorem for binary relations. Journal of Economic Theory 86, Dushnik, B., Miller, E., Partially ordered sets. American Journal of Mathematics 63, Eliaz, K., Ok, E. A., Indifference or indecisiveness? Choice-theoretic foundations of incomplete preferences. Games and Economic Behavior 56, Hiragushi, T., On the dimension of ordered sets. Sci. Rep. Kanazawa Univ. 4, Mandler, M., Incomplete preferences and rational intransitivity of choice. Games and Economic Behavior 50, Ok, E. A., Utility representation of an incomplete preference relation, Journal of Economic Theory 104, Peleg, B., Utility functions for partially ordered topological spaces. Econometrica 38, Rader, T., The existence of a utility function to represent preferences. Review of Economic Studies 30, Richter, M., Revealed preference theory. Econometrica 34, Sondermann, D., Utility representation for partial orders. Journal of Economic Theory 23, Szpilrajn, E., Sur l extension de l orde partiel. Fundamenta Mathematicae 16,
11 Trotter, W., Inequalities in dimension theory for posets, Proceedings of the American Mathematical Society 47,
Utility Representation of an Incomplete Preference Relation
Utility Representation of an Incomplete Preference Relation Efe A. Ok November 2000 Abstract We consider the problem of representing a (possibly) incomplete preference relation by means of a vector-valued
More informationRelations. Relations. Definition. Let A and B be sets.
Relations Relations. Definition. Let A and B be sets. A relation R from A to B is a subset R A B. If a A and b B, we write a R b if (a, b) R, and a /R b if (a, b) / R. A relation from A to A is called
More informationExistence of Order-Preserving Functions for Nontotal Fuzzy Preference Relations under Decisiveness
axioms Article Existence of Order-Preserving Functions for Nontotal Fuzzy Preference elations under Decisiveness Paolo Bevilacqua 1 ID, Gianni Bosi 2, *, ID and Magalì Zuanon 3 1 Dipartimento di Ingegneria
More informationRichter-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 informationTechnical Results on Regular Preferences and Demand
Division of the Humanities and Social Sciences Technical Results on Regular Preferences and Demand KC Border Revised Fall 2011; Winter 2017 Preferences For the purposes of this note, a preference relation
More informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationDefinitions: A binary relation R on a set X is (a) reflexive if x X : xrx; (f) asymmetric if x, x X : [x Rx xr c x ]
Binary Relations Definition: A binary relation between two sets X and Y (or between the elements of X and Y ) is a subset of X Y i.e., is a set of ordered pairs (x, y) X Y. If R is a relation between X
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationConditional Preference Orders and their Numerical Representations
Conditional Preference Orders and their Numerical Representations Samuel Drapeau a,1, Asgar Jamneshan b,2 October 20, 2014 ABSTRACT This work provides an axiomatic framework to the concept of conditional
More informationNon-deteriorating Choice Without Full Transitivity
Analyse & Kritik 29/2007 ( c Lucius & Lucius, Stuttgart) p. 163 187 Walter Bossert/Kotaro Suzumura Non-deteriorating Choice Without Full Transitivity Abstract: Although the theory of greatest-element rationalizability
More informationChapter 1 - Preference and choice
http://selod.ensae.net/m1 Paris School of Economics (selod@ens.fr) September 27, 2007 Notations Consider an individual (agent) facing a choice set X. Definition (Choice set, "Consumption set") X is a set
More informationWeak Choice Principles and Forcing Axioms
Weak Choice Principles and Forcing Axioms Elizabeth Lauri 1 Introduction Faculty Mentor: David Fernandez Breton Forcing is a technique that was discovered by Cohen in the mid 20th century, and it is particularly
More informationA Note on Maximal Elements for Acyclic Binary Relations on Compact Topological Spaces 1
International Mathematical Forum, 4, 2009, no. 11, 537-541 A Note on Maximal Elements for Acyclic Binary Relations on Compact Topological Spaces 1 Magalì E. Zuanon Dipartimento di Metodi Quantitativi Università
More informationPreference and Utility
Preference and Utility Econ 2100 Fall 2017 Lecture 3, 5 September Problem Set 1 is due in Kelly s mailbox by 5pm today Outline 1 Existence of Utility Functions 2 Continuous Preferences 3 Debreu s Representation
More informationExpected utility without full transitivity
Expected utility without full transitivity Walter Bossert Department of Economics and CIREQ University of Montreal P.O. Box 6128, Station Downtown Montreal QC H3C 3J7 Canada FAX: (+1 514) 343 7221 e-mail:
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationA metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions
1 Distance Reading [SB], Ch. 29.4, p. 811-816 A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions (a) Positive definiteness d(x, y) 0, d(x, y) =
More informationDiskrete Mathematik Solution 6
ETH Zürich, D-INFK HS 2018, 30. October 2018 Prof. Ueli Maurer Marta Mularczyk Diskrete Mathematik Solution 6 6.1 Partial Order Relations a) i) 11 and 12 are incomparable, since 11 12 and 12 11. ii) 4
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationTHE NON-URYSOHN NUMBER OF A TOPOLOGICAL SPACE
THE NON-URYSOHN NUMBER OF A TOPOLOGICAL SPACE IVAN S. GOTCHEV Abstract. We call a nonempty subset A of a topological space X finitely non-urysohn if for every nonempty finite subset F of A and every family
More informationRational Choice with Categories
Rational Choice with Categories Preliminary version. Bruno A. Furtado Leandro Nascimento Gil Riella June 25, 2015 Abstract We propose a model of rational choice in the presence of categories. Given a subjective
More informationOn 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 informationA utility representation theorem with weaker continuity condition
Working Papers Institute of Mathematical Economics 401 September 2008 A utility representation theorem with weaker continuity condition Tomoki Inoue IMW Bielefeld University Postfach 100131 33501 Bielefeld
More information6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games
6.254 : Game Theory with Engineering Applications Lecture 7: Asu Ozdaglar MIT February 25, 2010 1 Introduction Outline Uniqueness of a Pure Nash Equilibrium for Continuous Games Reading: Rosen J.B., Existence
More informationUpper Semicontinuous Extensions of Binary Relations
Cahier 2002-01 Upper Semicontinuous Extensions of Binary Relations BOSSERT, Walter SPRUMONT, Yves SUZUMURA, Kotaro Département de sciences économiques Université de Montréal Faculté des arts et des sciences
More informationNumerical representations of binary relations with thresholds: A brief survey 1
Numerical representations of binary relations with thresholds: A brief survey 1 Fuad Aleskerov Denis Bouyssou Bernard Monjardet 11 July 2006, Revised 8 January 2007 Typos corrected 1 March 2008 Additional
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationCSC Discrete Math I, Spring Relations
CSC 125 - Discrete Math I, Spring 2017 Relations Binary Relations Definition: A binary relation R from a set A to a set B is a subset of A B Note that a relation is more general than a function Example:
More informationMassachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr.
Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal Quiz 1 Appendix Appendix Contents 1 Induction 2 2 Relations
More informationFleurbaey-Michel Conjecture on Equitable weak Paretian Social Welfare Order
Fleurbaey-Michel Conjecture on Equitable weak Paretian Social Welfare Order Ram Sewak Dubey Department of Economics, Uris Hall, Cornell University, Ithaca, NY 14853, USA Abstract The paper examines the
More informationExpected utility without full transitivity
Expected utility without full transitivity Walter Bossert Department of Economics and CIREQ University of Montreal P.O. Box 6128, Station Downtown Montreal QC H3C 3J7 Canada FAX: (+1 514) 343 7221 e-mail:
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationTwo Factor Additive Conjoint Measurement With One Solvable Component
Two Factor Additive Conjoint Measurement With One Solvable Component Christophe Gonzales LIP6 Université Paris 6 tour 46-0, ème étage 4, place Jussieu 755 Paris Cedex 05, France e-mail: ChristopheGonzales@lip6fr
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationPseudo-Potential Games
Pseudo-Potential Games Burkhard C. Schipper Department of Economics University of Bonn preliminary: July 2004 Abstract The notion of pseudo-potential game is due to Dubey, Haimanko and Zapechelnyuk (2002).
More informationDominance and Admissibility without Priors
Dominance and Admissibility without Priors Jörg Stoye Cornell University September 14, 2011 Abstract This note axiomatizes the incomplete preference ordering that reflects statewise dominance with respect
More informationMINIMAL UNIVERSAL METRIC SPACES
Annales Academiæ Scientiarum Fennicæ Mathematica Volumen 42, 2017, 1019 1064 MINIMAL UNIVERSAL METRIC SPACES Victoriia Bilet, Oleksiy Dovgoshey, Mehmet Küçükaslan and Evgenii Petrov Institute of Applied
More informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
More informationONLINE LINEAR DISCREPANCY OF PARTIALLY ORDERED SETS
ONLINE LINEAR DISCREPANCY OF PARTIALLY ORDERED SETS MITCHEL T. KELLER, NOAH STREIB, AND WILLIAM T. TROTTER This article is dedicated to Professor Endre Szemerédi on the occasion of his 70 th birthday.
More informationCONSUMER DEMAND. Consumer Demand
CONSUMER DEMAND KENNETH R. DRIESSEL Consumer Demand The most basic unit in microeconomics is the consumer. In this section we discuss the consumer optimization problem: The consumer has limited wealth
More informationOnline Linear Discrepancy of Partially Ordered Sets
BOLYAI SOCIETY An Irregular Mind MATHEMATICAL STUDIES, 21 (Szemerédi is 70) pp. 1 15. Online Linear Discrepancy of Partially Ordered Sets MITCHEL T. KELLER, NOAH STREIB and WILLIAM T. TROTTER This article
More informations P = f(ξ n )(x i x i 1 ). i=1
Compactness and total boundedness via nets The aim of this chapter is to define the notion of a net (generalized sequence) and to characterize compactness and total boundedness by this important topological
More informationActa Mathematica Academiae Paedagogicae Nyíregyháziensis 21 (2005), ISSN
Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 21 (2005), 107 112 www.emis.de/journals ISSN 1786-0091 A GENERALIZED AMMAN S FIXED POINT THEOREM AND ITS APPLICATION TO NASH EQULIBRIUM ABDELKADER
More informationAPPLICATIONS OF THE PROBABILISTIC METHOD TO PARTIALLY ORDERED SETS
APPLICATIONS OF THE PROBABILISTIC METHOD TO PARTIALLY ORDERED SETS WILLIAM T. TROTTER This paper is dedicated to Paul Erdős with appreciation for his impact on mathematics and the lives of mathematicians
More informationPosets, homomorphisms and homogeneity
Posets, homomorphisms and homogeneity Peter J. Cameron and D. Lockett School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract Jarik Nešetřil suggested
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationOn Better-Quasi-Ordering Countable Series-Parallel Orders
On Better-Quasi-Ordering Countable Series-Parallel Orders Stéphan Thomassé Laboratoire LMD, UFR de Mathématiques, Université Claude Bernard 43, Boulevard du 11 novembre 1918, 69622 Villeurbanne Cedex,
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationLusin sequences under CH and under Martin s Axiom
F U N D A M E N T A MATHEMATICAE 169 (2001) Lusin sequences under CH and under Martin s Axiom by Uri Abraham (Beer-Sheva) and Saharon Shelah (Jerusalem) Abstract. Assuming the continuum hypothesis there
More informationSuzumura-consistent relations: an overview
Suzumura-consistent relations: an overview Walter Bossert Department of Economics and CIREQ University of Montreal P.O. Box 6128, Station Downtown Montreal QC H3C 3J7 Canada walter.bossert@videotron.ca
More informationSUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P, let Co(P) denote the lattice of all order-convex
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationOUTER MEASURE AND UTILITY
ECOLE POLYTECHNIQUE CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE OUTER MEASURE AND UTILITY Mark VOORNEVELD Jörgen W. WEIBULL October 2008 Cahier n 2008-28 DEPARTEMENT D'ECONOMIE Route de Saclay 91128 PALAISEAU
More information1. (B) The union of sets A and B is the set whose elements belong to at least one of A
1. (B) The union of sets A and B is the set whose elements belong to at least one of A or B. Thus, A B = { 2, 1, 0, 1, 2, 5}. 2. (A) The intersection of sets A and B is the set whose elements belong to
More informationNotes on Supermodularity and Increasing Differences. in Expected Utility
Notes on Supermodularity and Increasing Differences in Expected Utility Alejandro Francetich Department of Decision Sciences and IGIER Bocconi University, Italy March 7, 204 Abstract Many choice-theoretic
More informationRevealed 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 informationCORES OF ALEXANDROFF SPACES
CORES OF ALEXANDROFF SPACES XI CHEN Abstract. Following Kukie la, we show how to generalize some results from May s book [4] concerning cores of finite spaces to cores of Alexandroff spaces. It turns out
More informationChoice, Preferences and Utility
Choice, Preferences and Utility Mark Dean Lecture Notes for Fall 2015 PhD Class in Behavioral Economics - Columbia University 1 Introduction The first topic that we are going to cover is the relationship
More informationTHE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY. by arxiv: v1 [math.ca] 29 Jan 2017 MAGNUS D. LADUE
THE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY by arxiv:170109087v1 [mathca] 9 Jan 017 MAGNUS D LADUE 0 Abstract In [1] Grossman Turett define the Cantor game In [] Matt Baker proves several results
More informationIndeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )
Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes
More informationEconomics 204 Summer/Fall 2011 Lecture 2 Tuesday July 26, 2011 N Now, on the main diagonal, change all the 0s to 1s and vice versa:
Economics 04 Summer/Fall 011 Lecture Tuesday July 6, 011 Section 1.4. Cardinality (cont.) Theorem 1 (Cantor) N, the set of all subsets of N, is not countable. Proof: Suppose N is countable. Then there
More informationarxiv:math/ v1 [math.lo] 5 Mar 2007
Topological Semantics and Decidability Dmitry Sustretov arxiv:math/0703106v1 [math.lo] 5 Mar 2007 March 6, 2008 Abstract It is well-known that the basic modal logic of all topological spaces is S4. However,
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationDefinability in the Enumeration Degrees
Definability in the Enumeration Degrees Theodore A. Slaman W. Hugh Woodin Abstract We prove that every countable relation on the enumeration degrees, E, is uniformly definable from parameters in E. Consequently,
More information106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)
106 CHAPTER 3. TOPOLOGY OF THE REAL LINE 3.3 Limit Points 3.3.1 Main Definitions Intuitively speaking, a limit point of a set S in a space X is a point of X which can be approximated by points of S other
More informationBanach-Mazur game played in partially ordered sets
Banach-Mazur game played in partially ordered sets arxiv:1505.01094v1 [math.lo] 5 May 2015 Wies law Kubiś Department of Mathematics Jan Kochanowski University in Kielce, Poland and Institute of Mathematics,
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationOrdering functions. Raphaël Carroy. Hejnice, Czech Republic January 27th, Universität Münster 1/21
Ordering functions Raphaël Carroy Universität Münster Hejnice, Czech Republic January 27th, 2014 1/21 General background: 0-dimensional Polish spaces, and functions The Baire space ω ω of infinite sequences
More informationNotes on Ordered Sets
Notes on Ordered Sets Mariusz Wodzicki September 10, 2013 1 Vocabulary 1.1 Definitions Definition 1.1 A binary relation on a set S is said to be a partial order if it is reflexive, x x, weakly antisymmetric,
More informationNEW PERSPECTIVES ON INTERVAL ORDERS AND INTERVAL GRAPHS
NEW PERSPECTIVES ON INTERVAL ORDERS AND INTERVAL GRAPHS WILLIAM T. TROTTER Abstract. Interval orders and interval graphs are particularly natural examples of two widely studied classes of discrete structures:
More informationThe integers. Chapter 3
Chapter 3 The integers Recall that an abelian group is a set A with a special element 0, and operation + such that x +0=x x + y = y + x x +y + z) =x + y)+z every element x has an inverse x + y =0 We also
More informationMathematical Social Sciences
Mathematical Social Sciences 74 (2015) 68 72 Contents lists available at ScienceDirect Mathematical Social Sciences journal homepage: www.elsevier.com/locate/econbase Continuity, completeness, betweenness
More informationPayoff Continuity in Incomplete Information Games
journal of economic theory 82, 267276 (1998) article no. ET982418 Payoff Continuity in Incomplete Information Games Atsushi Kajii* Institute of Policy and Planning Sciences, University of Tsukuba, 1-1-1
More informationExistence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets
Existence of a Limit on a Dense Set, and Construction of Continuous Functions on Special Sets REU 2012 Recap: Definitions Definition Given a real-valued function f, the limit of f exists at a point c R
More informationn n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set
1 Mathematical Induction We assume that the set Z of integers are well defined, and we are familiar with the addition, subtraction, multiplication, and division. In particular, we assume the following
More informationEquality of P-partition Generating Functions
Bucknell University Bucknell Digital Commons Honors Theses Student Theses 2011 Equality of P-partition Generating Functions Ryan Ward Bucknell University Follow this and additional works at: https://digitalcommons.bucknell.edu/honors_theses
More informationExercise 1.2. Suppose R, Q are two binary relations on X. Prove that, given our notation, the following are equivalent:
1 Binary relations Definition 1.1. R X Y is a binary relation from X to Y. We write xry if (x, y) R and not xry if (x, y) / R. When X = Y and R X X, we write R is a binary relation on X. Exercise 1.2.
More informationAxiomatic Decision Theory
Decision Theory Decision theory is about making choices It has a normative aspect what rational people should do... and a descriptive aspect what people do do Not surprisingly, it s been studied by economists,
More informationOn minimal models of the Region Connection Calculus
Fundamenta Informaticae 69 (2006) 1 20 1 IOS Press On minimal models of the Region Connection Calculus Lirong Xia State Key Laboratory of Intelligent Technology and Systems Department of Computer Science
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationRationality 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 informationMath 3012 Applied Combinatorics Lecture 14
October 6, 2015 Math 3012 Applied Combinatorics Lecture 14 William T. Trotter trotter@math.gatech.edu Three Posets with the Same Cover Graph Exercise How many posets altogether have the same cover graph
More informationMathematical Methods in Economics (Part I) Lecture Note
Mathematical Methods in Economics (Part I) Lecture Note Kai Hao Yang 09/03/2018 Contents 1 Basic Topology and Linear Algebra 4 1.1 Review of Metric Space and Introduction of Topological Space........ 4
More informationMONOTONICALLY COMPACT AND MONOTONICALLY
MONOTONICALLY COMPACT AND MONOTONICALLY LINDELÖF SPACES GARY GRUENHAGE Abstract. We answer questions of Bennett, Lutzer, and Matveev by showing that any monotonically compact LOT S is metrizable, and any
More informationFaithful embedding on finite orders classes
Faithful embedding on finite orders classes Alain Guillet Jimmy Leblet Jean-Xavier Rampon Abstract We investigate, in the particular case of finite orders classes, the notion of faithful embedding among
More informationSo in the abstract setting dene the following: f n converges to f with respect to I i every subsequence ff n : n 2 Ag has a subsequence B A such that
Souslin's Hypothesis and Convergence in Category by Arnold W. Miller 1 Abstract: A sequence of functions f n : X! R from a Baire space X to the reals R is said to converge in category i every subsequence
More informationMaximilian GANSTER. appeared in: Soochow J. Math. 15 (1) (1989),
A NOTE ON STRONGLY LINDELÖF SPACES Maximilian GANSTER appeared in: Soochow J. Math. 15 (1) (1989), 99 104. Abstract Recently a new class of topological spaces, called strongly Lindelöf spaces, has been
More informationA Comprehensive Approach to Revealed Preference Theory
A Comprehensive Approach to Revealed Preference Theory Hiroki Nishimura Efe A. Ok John K.-H. Quah October 6, 2016 Abstract We develop a version of Afriat s Theorem that is applicable to a variety of choice
More informationTHE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS
SOOCHOW JOURNAL OF MATHEMATICS Volume 28, No. 4, pp. 347-355, October 2002 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS BY HUA MAO 1,2 AND SANYANG LIU 2 Abstract. This paper first shows how
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationLecture 2. Econ August 11
Lecture 2 Econ 2001 2015 August 11 Lecture 2 Outline 1 Fields 2 Vector Spaces 3 Real Numbers 4 Sup and Inf, Max and Min 5 Intermediate Value Theorem Announcements: - Friday s exam will be at 3pm, in WWPH
More informationQuasi-transitive and Suzumura consistent relations
Quasi-transitive and Suzumura consistent relations Walter Bossert Department of Economics and CIREQ, University of Montréal P.O. Box 6128, Station Downtown, Montréal QC H3C 3J7, Canada FAX: (+1 514) 343
More informationAppendix A. Definitions for Ordered Sets. The appendices contain all the formal definitions, propositions and proofs for
161 Appendix A Definitions for Ordered Sets The appendices contain all the formal definitions, propositions and proofs for developing a model of the display process based on lattices. Here we list some
More informationAdvanced Microeconomics Note 1: Preference and choice
Advanced Microeconomics Note 1: Preference and choice Xiang Han (SUFE) Fall 2017 Advanced microeconomics Note 1: Preference and choice Fall 2017 1 / 17 Introduction Individual decision making Suppose that
More informationLecture Notes in Real Analysis Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay
Lecture Notes in Real Analysis 2010 Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay August 6, 2010 Lectures 1-3 (I-week) Lecture 1 Why real numbers? Example 1 Gaps in the
More informationSection 0.7. The Axiom of Choice, Order, and Zorn s Lemma
0.7. The Axiom of Choice, Order, and Zorn s Lemma 1 Section 0.7. The Axiom of Choice, Order, and Zorn s Lemma Note. In this section, we state the Axiom of Choice and two statements equivalent to it (Zorn
More information