WHAT DEGREE OF CONFLICT IN THE DOMAIN OF INDIVIDUAL PREFERENCES COULD RESOLVE THE PARADOX OF DEMOCRATIC MAJORITY DECISION?
|
|
- Rodney Potter
- 8 years ago
- Views:
Transcription
1 WHAT DEGREE OF CONFLICT IN THE DOMAIN OF INDIVIDUAL PREFERENCES COULD RESOLVE THE PARADOX OF DEMOCRATIC MAJORITY DECISION? Ahmet KARA Fatih University Economics Department Hadimköy 34900, Büyüçkmece, İstanbul, Turkey. Phone: (90) Fax: (90) ABSTRACT This paper identifies the degree of conflict in the domain of individual preferences that resolves the paradox of democratic majority decision. The type of conflict that is incompatible with majority decisions is neither moderate nor maximal but somewhere in between. Key words: The paradox of democratic majority decision, degree of conflict BİREYLER TERCİHLERİ ALANINDAKİ HANGİ ÇELİŞKİ DERECESİ DEMOKRATİK ÇOĞUNLUK KURALI PARADOKSUNU ORTADAN KALDIRIR? ÖZET Bu makale, birey tercihleri arasındaki belirli tür farklılıkların (çelişkilerin) demokratik çoğunluk kuralı paradoksunu ortadan kaldıracağını göstermektedir. Ilgili paradoksla uyumlu çelişki derecesiö ılımlı ya da maximal değil arasında bir değere sahiptir. Anahtar kelimeler: Demokratik çoğunluk kuralı paradoksu, çelişki derecesi I. INTRODUCTION The paradox of democratic majority decisions (the voting paradox) is one of the most widely studied phenomena in social choice theory. The paradox, which arises when majority rule produces an intransitive social preference, has provoked a line of extensive inquiry attempting to analyze the paradox and identify the conditions that preclude its occurrence. Among these works are Arrow (1951), Inada (1964, 1969), Sen and Pattanaik (1969), Sen (1970), Fishburn (1970a, b), Fishburn and Gehrlein (1980), Jain (1985) and Usher (1994). This paper contributes to this literature by identifying a pattern of conflict in the domain of individual preferences that resolves the paradox in question.
2 II. THE GENERAL FRAMEWORK Let E be the set of a finite number of individuals forming a society, and let Z be a set of mutually exclusive social alternatives. Assume that the cardinalities of E and Z, denoted by, respectively, E and Z, are finite, and E > 1, Z > 2. Each individual i in the society has a preference relation R i, which is a binary relation on Z such that R i {(x, y): x, y are in Z and x, y are distinct}, and i = 1,, n. For any x, y in Z, xr i y will be interpreted as x is preferred to y by individual i. Define strict preference (P i ) and indifference (l i ) relations on {x,y} as follows: xp i y if and only if xr i y and not yr i x, xi i y if and only if xr i y and yr i x. Given distinct x, y in Z, exactly one of the following four possibilities holds: xp i y, yp i x, xi i y, and none of these. As such a preference relation can be specified by specifying P i and l i, specifically, xr i y if and only if xp i y or xi i y. Thus, we will often employ a particular specification of R i such that R i over an m-set in Z is a set, the elements of which are preferences over the pairs in that m-set. For example, R i = {xp i y, yp i z} is a possible preference relation over a triple {x,y,z} X (i.e. an m-set, where m=3), which illustrates the particular specification proposed here. A preference relation R i on Z is said to be complete if and only if xp i y or xi i y for all x, y in Z such that x y. R i on Z is incomplete if it is not complete. R i on Z is transitive if and only if for all distinct x, y, z in Z, (xp i y and yp i z implies xp i z). R i on Z is intransitive if it is not transitive. We will assume that individual preferences are transitive and complete. Let, for all x, y in Z, N (xpy) be the number of people who strictly prefers x to y. the method of democratic majority decision (majority rule) is a collective choice rule such that For all x, y in Z, xpy iff [N(xPy)>N(yPx)] and xly iff [N(xPy)=N(yPx)]. A preference relation R i over a triple {x, y, z} Z is said to be strongly strict if it has strict preference over every pair in {x, y, z}. It is said to be weakly strict if it has indifference over at least one pair in {x, y, z}. The degree to which preference relations represent, across individuals, compatible or incompatible orderings of alternatives will turn out to be crucial in our analysis of social choice paradoxes. Hence, we will define a few concepts to capture the relations of compatibility among different preference relations: a pair of preference relations R i and R i for any i and j are said to be incompatible (or in conflict) over a pair of alternatives {x,y} iff xp i y and yp i x. For any i and j, R i are said to be compatible over {x, y} if they are not incompatible over {x, y}. Define a conflict index C ij (x, y) such that C ij (x, y) = 1 if R i and R j are incompatible over {x,y} = 0 otherwise.
3 With R i and R j defined over m alternatives of Z, there are m (m-1)/2 pairwise comparisons in an m-set. Let C m (R i, R j ) be the sum of C ij (x,y)s over all alternatives {x,y} for preference relations R i and R j over an m-set. The value of C m (R i, R j ) depends on how conflicted preference relations are and on the number of alternatives over which they are defined. For instance, over a triple, the maximum and minimum values of C 3 (R i, R j ) are respectively 3 and 0. III. THE PARADOX OF DEMOCRATIC MAJORITY DECISION The following example presents an illustration of how majority rule could generate intransitive social preferences. Example: Consider a society of two individuals with the following preference relations over {x,y,z}: R 1 = {xp 1 y, yp 1 z, xp 1 z} R 2 = {yp 2 z, zp 2 x, yp 2 x}. Majority rule produces the following social preference relation over the pairs in {x,y,z}: Over {x,y}, N(xPy) = 1 = N(yPx), hence xly Over {y,z}, N(yPz) = 2 > 0 = N(zPy), hence ypz Over {x,z}, N(xPz) = 1 = N(zPx), hence xlz. Thus, the social preference R over {x,y,z} is R = {xly, ypz, xlz}, Which is intransitive. Sen (1970) presents the following theorem that formulates a condition called Extremal Restriction under which majority rule generates transitive social choice from transitive individual preferences. Extremal Restriction (ER): A triple {x,y,z} in Z satisfies ER if and only if the following condition holds for every ordered triple obtainable from it: Let {x,y,z} be an ordered triple. If there is someone who prefers x to y and y to z, then anyone regards z to be uniquely best if and only if she regards x to be uniquely worst, i.e. if for some i in E, xp i y and yp i z, then for all j in E, if zp i x, then zp j y and yp j x. Theorem 1 (Sen, 1970): A necessary and sufficient condition for the transitivity of majority decisions is that every triple of alternatives must satisfy ER. ER ensures the transitivity of majority decision by ruling out the joint presence of those individual preference relations that could, though majority rule, lead to an
4 intransitive social preference. 1 It turns out that there is an identifiable pattern of conflict between the preference relations whose joint presence violates ER. That is to say, and as proved in the theorem bellow, ER, where it holds non-vacuously, 2 is equivalent to the absence of a certain pattern of conflict between individual preferences. Theorem 2: ER holds non-vacuously for an arbitrary triple {x,y,z Z if and only if C 3 (R i,r j ) 2 over {x,y,z}, where at least one of R i and R j is a strongly strict preference relation over {x,y,z} and R i and R j are transitive for i,j = 1,, n. Proof: We first show that if ER holds non-vacuously for {x,y,z}, then C 3 (R i, R j ) 2 over {x,y,z}. Suppose for {x,y,z} Z, there is an individual i in the E with a strongly strict relation R i = {xp i y, yp i z, xp i z}. Then, assuming that it holds, ER would allow the presence of an individual j in E with any of the following preference relations over {x,y,z}: {xp i y, yp i z, xp i z} {xp i z, zp i y, xp i y} {zp i y, yp i x, zp i x} {yp i x, xp i z, yp i z} {xp i y, yl i z, xp i z} {xl i y, yp i z, xp i z} {yp i y, zl i x, yp i x} {zl i x, xp i y, zp i y} {xl i y, yl i z, xl i z} In the presence of R i, R j can take the form of any of the preference relations in this list. 3 In other words, ER would allow the joint presence of R i and any of these preference relations which form an exhaustive list of preferences, each of which can coexist with R i without violating ER. It is evident that the pairwise degree of conflict between R i and any of the preference relations in this list either 0, 1, or 3 but never 2. Hence, if ER holds, C 3 (R i,r j ) 2 over {x,y,z}. We have started with a particularly strongly strict R i to prove the result, but we could start the same result holds true. It remains to show that if ER does not hold for {x,y,z}, then C 3 (R i,r j ) = 2 over {x,y,z}. Suppose that there is an individual I in E with a strongly strict preference relations R i = {xp i y, yp i z, xp i z}. If does not hold, then there must exist an individual j in E with any of the following preference relations over {x,y,z}: {yp i z, zp ix, yp i x} {zp i x, xp i y, zp i y} 1 For instance, in the presence of {xp i y, yp i z, xp i z}, ER oes not allow the presence of {yp i z, zp i x, yp i x}, for if society consisted of individuals holding these two preference relations in equal numbers, the social preference over {x,y,z} inducted by majority rule would be {xly, ypz, xlz}, which is intransitive. 2 There are cases where ER holds vacuously: if ER is to be violated for a triple of Z, there must exist at least one strongly strict preference relation over that triple. Thus, cases involving only weakly strict preference relations over the triples of Z vacuously satisfy ER. 3 Though ER allows the joint presence of Ri and any of the preference relations in the list above it does not allow the joint presence of R I and all of the presence relations in the list as a group, for the joint presence of some preference relations in the list, such as R5 and R6, would be incompatible with ER.
5 {yl i z, zp i x, yp i x} {yp i x, xl i y, zp i y}. It is evident that the pairwise degree of conflict between R i and any of these preference relations is 2, i.e. C 3 (R i,r j ) = 2. Though the same procedure, it can be shown that the same result holds true for other pairs of preferences that do not satisfy ER. IV. CONCLUSION QED. The theorem presented in this paper proves that Sen s sufficient conditions for the transitivity of democratic majority decision over {x,y,z} is equivalent to the absence of a certain pattern of conflict in the domain of individual preferences, which is characterized by C 3 (R i, R j ) 2 over {x,y,z}, where i, j = 1,, n. Thus transitivity of democratic majority decision over {x,y,z} is compatible with zero conflicts (C 3 (R i,r j ) = 0), moderate conflicts (C 3 (R i,r j ) = 1) and maximal conflicts (C 3 (R i,r j ) = 3) between individual preferences over {x,y,z}, i.e. the type of conflict that is incompatible with transitive majority decisions is neither moderate nor maximal but somewhere in between. REFERENCES: Arrow, K. J Social Choice and Individual Values. New York: John Wiley. Fishburn, P.C. 1970a. Intransitive Individual Indifference and Transitive Majorities. Econometrica 38: b. Conditions for Simple Majority Decision with Intransitive Individual Indifference. Journal of Economic Theory 2: Fishburn, P.C. and W.V. Gehrlein Paradox of Voting: Effects of Individual Indifference and Intrasitivity. Journal of Public Economics 14: Inada, K A Note on the Simple Majority Decision Rule. Econometrica 32: The Simple Majority Decision Rule. Econometrica 37: Jain, S.K A Direct Proof of Inada-Sen-Pattanaik Theorem of Majority Rule. The Economic Studies Quarterly 36: Sen, A Collective Choice and Social Welfare. San Francisco: Holden-Day. Sen, A. and P. K. Pattanaik Necessary and Sufficient Conditions for Rational Choice Under Majority Decision. Journal Economic Theory 1: Usher, D The Significance of the Probabilistic Voting Theorem. Canadian Journal of Economics 27 (2):
Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets
Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Nathaniel Hendren January, 2014 Abstract Both Akerlof (1970) and Rothschild and Stiglitz (1976) show that
More informationeach college c i C has a capacity q i - the maximum number of students it will admit
n colleges in a set C, m applicants in a set A, where m is much larger than n. each college c i C has a capacity q i - the maximum number of students it will admit each college c i has a strict order i
More informationChapter 7. Sealed-bid Auctions
Chapter 7 Sealed-bid Auctions An auction is a procedure used for selling and buying items by offering them up for bid. Auctions are often used to sell objects that have a variable price (for example oil)
More informationStrategy-proof Social Choice Correspondences 1
Journal of Economic Theory doi:10.1006jeth.2000.2782, available online at http:www.idealibrary.com on Strategy-proof Social Choice Correspondences 1 Salvador Barbera Universitat Autonoma de Barcelona,
More informationChapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationTwo-Sided Matching Theory
Two-Sided Matching Theory M. Utku Ünver Boston College Introduction to the Theory of Two-Sided Matching To see which results are robust, we will look at some increasingly general models. Even before we
More informationThe effect of exchange rates on (Statistical) decisions. Teddy Seidenfeld Mark J. Schervish Joseph B. (Jay) Kadane Carnegie Mellon University
The effect of exchange rates on (Statistical) decisions Philosophy of Science, 80 (2013): 504-532 Teddy Seidenfeld Mark J. Schervish Joseph B. (Jay) Kadane Carnegie Mellon University 1 Part 1: What do
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More informationInvestigación Operativa. The uniform rule in the division problem
Boletín de Estadística e Investigación Operativa Vol. 27, No. 2, Junio 2011, pp. 102-112 Investigación Operativa The uniform rule in the division problem Gustavo Bergantiños Cid Dept. de Estadística e
More informationGains from Trade. Christopher P. Chambers and Takashi Hayashi. March 25, 2013. Abstract
Gains from Trade Christopher P. Chambers Takashi Hayashi March 25, 2013 Abstract In a market design context, we ask whether there exists a system of transfers regulations whereby gains from trade can always
More informationSection 12.6: Directional Derivatives and the Gradient Vector
Section 26: Directional Derivatives and the Gradient Vector Recall that if f is a differentiable function of x and y and z = f(x, y), then the partial derivatives f x (x, y) and f y (x, y) give the rate
More informationFull and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More informationLecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
More information4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:
4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets
More informationMINIMAL BOOKS OF RATIONALES
MINIMAL BOOKS OF RATIONALES José Apesteguía Miguel A. Ballester D.T.2005/01 MINIMAL BOOKS OF RATIONALES JOSE APESTEGUIA AND MIGUEL A. BALLESTER Abstract. Kalai, Rubinstein, and Spiegler (2002) propose
More informationChapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses
Chapter ML:IV IV. Statistical Learning Probability Basics Bayes Classification Maximum a-posteriori Hypotheses ML:IV-1 Statistical Learning STEIN 2005-2015 Area Overview Mathematics Statistics...... Stochastics
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it
More informationJoint Exam 1/P Sample Exam 1
Joint Exam 1/P Sample Exam 1 Take this practice exam under strict exam conditions: Set a timer for 3 hours; Do not stop the timer for restroom breaks; Do not look at your notes. If you believe a question
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationFundamentele Informatica II
Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear
More informationAlex, I will take congruent numbers for one million dollars please
Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory
More informationWorking Paper Series
RGEA Universidade de Vigo http://webs.uvigo.es/rgea Working Paper Series A Market Game Approach to Differential Information Economies Guadalupe Fugarolas, Carlos Hervés-Beloso, Emma Moreno- García and
More informationChoice under Uncertainty
Choice under Uncertainty Part 1: Expected Utility Function, Attitudes towards Risk, Demand for Insurance Slide 1 Choice under Uncertainty We ll analyze the underlying assumptions of expected utility theory
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More informationSummary Last Lecture. Automated Reasoning. Outline of the Lecture. Definition sequent calculus. Theorem (Normalisation and Strong Normalisation)
Summary Summary Last Lecture sequent calculus Automated Reasoning Georg Moser Institute of Computer Science @ UIBK Winter 013 (Normalisation and Strong Normalisation) let Π be a proof in minimal logic
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More information7. Some irreducible polynomials
7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of
More informationHow To Solve A Minimum Set Covering Problem (Mcp)
Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication 1 1 Algorithm for Solving the MASP In this online appendix
More information11 Multivariate Polynomials
CS 487: Intro. to Symbolic Computation Winter 2009: M. Giesbrecht Script 11 Page 1 (These lecture notes were prepared and presented by Dan Roche.) 11 Multivariate Polynomials References: MC: Section 16.6
More informationNo-Betting Pareto Dominance
No-Betting Pareto Dominance Itzhak Gilboa, Larry Samuelson and David Schmeidler HEC Paris/Tel Aviv Yale Interdisciplinary Center Herzlyia/Tel Aviv/Ohio State May, 2014 I. Introduction I.1 Trade Suppose
More informationAlok Gupta. Dmitry Zhdanov
RESEARCH ARTICLE GROWTH AND SUSTAINABILITY OF MANAGED SECURITY SERVICES NETWORKS: AN ECONOMIC PERSPECTIVE Alok Gupta Department of Information and Decision Sciences, Carlson School of Management, University
More informationOdd induced subgraphs in graphs of maximum degree three
Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing
More informationAge Based Preferences in Paired Kidney Exchange
Age Based Preferences in Paired Kidney Exchange Antonio Nicolò Carmelo Rodríguez-Álvarez November 1, 2013 Abstract We consider a model of Paired Kidney Exchange (PKE) with feasibility constraints on the
More informationx < y iff x < y, or x and y are incomparable and x χ(x,y) < y χ(x,y).
12. Large cardinals The study, or use, of large cardinals is one of the most active areas of research in set theory currently. There are many provably different kinds of large cardinals whose descriptions
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18 of Gallian s Contemporary Abstract Algebra. Most of the important
More informationTuring Degrees and Definability of the Jump. Theodore A. Slaman. University of California, Berkeley. CJuly, 2005
Turing Degrees and Definability of the Jump Theodore A. Slaman University of California, Berkeley CJuly, 2005 Outline Lecture 1 Forcing in arithmetic Coding and decoding theorems Automorphisms of countable
More informationEconomics 200B Part 1 UCSD Winter 2015 Prof. R. Starr, Mr. John Rehbeck Final Exam 1
Economics 200B Part 1 UCSD Winter 2015 Prof. R. Starr, Mr. John Rehbeck Final Exam 1 Your Name: SUGGESTED ANSWERS Please answer all questions. Each of the six questions marked with a big number counts
More informationConsumer Theory. The consumer s problem
Consumer Theory The consumer s problem 1 The Marginal Rate of Substitution (MRS) We define the MRS(x,y) as the absolute value of the slope of the line tangent to the indifference curve at point point (x,y).
More informationFollow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu
COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part
More informationI d Rather Stay Stupid: The Advantage of Having Low Utility
I d Rather Stay Stupid: The Advantage of Having Low Utility Lior Seeman Department of Computer Science Cornell University lseeman@cs.cornell.edu Abstract Motivated by cost of computation in game theory,
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationPricing Transmission
1 / 37 Pricing Transmission Quantitative Energy Economics Anthony Papavasiliou 2 / 37 Pricing Transmission 1 Equilibrium Model of Power Flow Locational Marginal Pricing Congestion Rent and Congestion Cost
More informationThe Role of Priorities in Assigning Indivisible Objects: A Characterization of Top Trading Cycles
The Role of Priorities in Assigning Indivisible Objects: A Characterization of Top Trading Cycles Atila Abdulkadiroglu and Yeon-oo Che Duke University and Columbia University This version: November 2010
More informationHow To Determine Who Is A J
ON THE QUESTION "WHO IS A J?"* A Social Choice Approach Asa Kasher** and Ariel Rubinstein*** Abstract The determination of who is a J within a society is treated as an aggregation of the views of the members
More informationChapter 21: The Discounted Utility Model
Chapter 21: The Discounted Utility Model 21.1: Introduction This is an important chapter in that it introduces, and explores the implications of, an empirically relevant utility function representing intertemporal
More information1 Formulating The Low Degree Testing Problem
6.895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Linearity Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz In the last lecture, we proved a weak PCP Theorem,
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationLinear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
More informationAmply Fws Modules (Aflk n, Sonlu Zay f Eklenmifl Modüller)
Çankaya Üniversitesi Fen-Edebiyat Fakültesi, Journal of Arts and Sciences Say : 4 / Aral k 2005 Amply Fws Modules (Aflk n, Sonlu Zay f Eklenmifl Modüller) Gökhan B LHA * Abstract In this work amply finitely
More information(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9
Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationMaximal Domains for Strategy-proof or Maskin Monotonic Choice Rules Olivier Bochet and Ton Storcken
Maximal Domains for Strategy-proof or Maskin Monotonic Choice Rules Olivier Bochet and Ton Storcken January 2009 Abstract Domains of individual preferences for which the well-known impossibility Theorems
More informationDEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More information17.6.1 Introduction to Auction Design
CS787: Advanced Algorithms Topic: Sponsored Search Auction Design Presenter(s): Nilay, Srikrishna, Taedong 17.6.1 Introduction to Auction Design The Internet, which started of as a research project in
More informationA Money-Pump for Acyclic Intransitive Preferences
[Published in Dialectica 64 (2): 251 257, 2010, DOI: 10.1111/j.1746-8361.2010.01230.x. The definitive version is available at www.blackwell-synergy.com.] A Money-Pump for Acyclic Intransitive Preferences
More informationSolutions to In-Class Problems Week 4, Mon.
Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions
More informationCorrespondence analysis for strong three-valued logic
Correspondence analysis for strong three-valued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K 3 ).
More informationSTATISTICAL SIGNIFICANCE OF RANKING PARADOXES
STATISTICAL SIGNIFICANCE OF RANKING PARADOXES Anna E. Bargagliotti and Raymond N. Greenwell Department of Mathematical Sciences and Department of Mathematics University of Memphis and Hofstra University
More informationJUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004
Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationFactorization Algorithms for Polynomials over Finite Fields
Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is
More informationLecture Note 7: Revealed Preference and Consumer Welfare
Lecture Note 7: Revealed Preference and Consumer Welfare David Autor, Massachusetts Institute of Technology 14.03/14.003 Microeconomic Theory and Public Policy, Fall 2010 1 1 Revealed Preference and Consumer
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More informationThis asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
More informationAbout the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
More informationEquilibrium computation: Part 1
Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium
More information( 1)2 + 2 2 + 2 2 = 9 = 3 We would like to make the length 6. The only vectors in the same direction as v are those
1.(6pts) Which of the following vectors has the same direction as v 1,, but has length 6? (a), 4, 4 (b),, (c) 4,, 4 (d), 4, 4 (e) 0, 6, 0 The length of v is given by ( 1) + + 9 3 We would like to make
More information! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of
More informationIt all depends on independence
Working Papers Institute of Mathematical Economics 412 January 2009 It all depends on independence Daniel Eckert and Frederik Herzberg IMW Bielefeld University Postfach 100131 33501 Bielefeld Germany email:
More informationOPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem")
OPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem") BY Y. S. CHOW, S. MORIGUTI, H. ROBBINS AND S. M. SAMUELS ABSTRACT n rankable persons appear sequentially in random order. At the ith
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationChapter 10. Matching Markets. 10.1 Bipartite Graphs and Perfect Matchings
From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/kleinber/networks-book/
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: Single-Period Market
More informationUnique Factorization
Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationName. Final Exam, Economics 210A, December 2011 Here are some remarks to help you with answering the questions.
Name Final Exam, Economics 210A, December 2011 Here are some remarks to help you with answering the questions. Question 1. A firm has a production function F (x 1, x 2 ) = ( x 1 + x 2 ) 2. It is a price
More informationSimilarity-Based Mistakes in Choice
INSTITUTO TECNOLOGICO AUTONOMO DE MEXICO CENTRO DE INVESTIGACIÓN ECONÓMICA Working Papers Series Similarity-Based Mistakes in Choice Fernando Payro Centro de Investigación Económica, ITAM Levent Ülkü Centro
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More information3 1. Note that all cubes solve it; therefore, there are no more
Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if
More informationClass One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
More informationDegrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets.
Degrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets. Logic is the study of reasoning. A language of propositions is fundamental to this study as well as true
More informationNote on Negative Probabilities and Observable Processes
Note on Negative Probabilities and Observable Processes Ulrich Faigle and Alexander Schönhuth 2 1 Mathematisches Institut/ZAIK, Universität zu Köln Weyertal 80, 50931 Köln, Germany faigle@zpr.uni-koeln.de
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More informationAutomata and Formal Languages
Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,
More informationADDITIVE GROUPS OF RINGS WITH IDENTITY
ADDITIVE GROUPS OF RINGS WITH IDENTITY SIMION BREAZ AND GRIGORE CĂLUGĂREANU Abstract. A ring with identity exists on a torsion Abelian group exactly when the group is bounded. The additive groups of torsion-free
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationA THEORY OF REFERENCE-DEPENDENT BEHAVIOR
A THEORY OF REFERENCE-DEPENDENT BEHAVIOR José Apesteguía Miguel A. Ballester D.T.2004/02 A THEORY OF REFERENCE-DEPENDENT BEHAVIOR JOSE APESTEGUIA AND MIGUEL A. BALLESTER Abstract. There is extensive field
More information