ECONOMICS SERIES SWP 2009/16. Weakest Collective Rationality and the Nash Bargaining Solution. Nejat Anbarci and Ching-jen Sun

Similar documents
1 Axiomatic Bargaining Theory

Game Theory. Bargaining Theory. ordi Massó. International Doctorate in Economic Analysis (IDEA) Universitat Autònoma de Barcelona (UAB)

Cooperative bargaining: independence and monotonicity imply disagreement

Lecture Notes on Bargaining

Stagnation proofness and individually monotonic bargaining solutions. Jaume García-Segarra Miguel Ginés-Vilar 2013 / 04

ECONOMICS SERIES SWP 2012/7. Robustness of Intermediate Agreements and Bargaining Solutions. Nejat Anbarci and Ching-jen Sun

A Constructive Proof of the Nash Bargaining Solution

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

A Characterization of the Nash Bargaining Solution Published in Social Choice and Welfare, 19, , (2002)

Almost Transferable Utility, Changes in Production Possibilities, and the Nash Bargaining and the Kalai-Smorodinsky Solutions

Nash Demand Game and the Kalai-Smorodinsky Solution

Nash Bargaining in Ordinal Environments

Nash Bargaining Theory with Non-Convexity and Unique Solution

Unique Nash Implementation for a Class of Bargaining Solutions

Nash Bargaining Theory with Non-Convexity and Unique Solution

An Axiomatization of the Euclidean Compromise Solution

Bargaining on a Non-Convex Domain

The B.E. Journal of Theoretical Economics

Randomized dictatorship and the Kalai-Smorodinsky bargaining solution

TWO-PERSON COOPERATIVE GAMES

The Interdisciplinary Center, Herzliya School of Economics Advanced Microeconomics Fall Bargaining The Axiomatic Approach

Reference Functions and Possibility Theorems forcardinalsocialchoiceproblems. John P. Conley* Richard P. McLean** and Simon Wilkie***

Bridging the gap between the Nash and Kalai-Smorodinsky bargaining solutions

A generalization of the Egalitarian and the Kalai Smorodinsky bargaining solutions

Background notes on bargaining

Axiomatic bargaining. theory

Ordered Value Restriction

Arrovian Social Choice with Non -Welfare Attributes

Introduction to Economic Analysis Fall 2009 Problems on Chapter 1: Rationality

Mathematical Social Sciences

The Properly Efficient Bargaining Solutions

Choosing the Two Finalists

Efficiency, Fairness and Competitiveness in Nash Bargaining Games

Lecture 8: Basic convex analysis

Department of Economics

Random Extensive Form Games and its Application to Bargaining

CENTER FOR INTERNATIONAL ECONOMICS. Working Paper Series. Working Paper No On unication of solutions to the bargaining problem

The -nucleolus for NTU games and Shapley procedure

Economics 201B Economic Theory (Spring 2017) Bargaining. Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7).

Bargaining Efficiency and the Repeated Prisoners Dilemma. Bhaskar Chakravorti* and John Conley**

Solving Extensive Form Games

Nash Bargaining for Log-Convex Problems

Revisiting independence and stochastic dominance for compound lotteries

The Nash bargaining model

Merging and splitting in cooperative games: some (im-)possibility results

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

Nonlinear Programming (NLP)

Arrovian Social Choice with Non -Welfare Attributes

BARGAINING UNDER UNCERTAINTY: A NEW APPROACH BASED ON LOSSES

Advanced Microeconomics

Costly Self-Control and Limited Willpower

Characterization of the Shapley-Shubik Power Index Without the E ciency Axiom

THE MINIMAL OVERLAP COST SHARING RULE

Advanced Microeconomics Fall Lecture Note 1 Choice-Based Approach: Price e ects, Wealth e ects and the WARP

SHARE THE GAIN, SHARE THE PAIN? ALMOST TRANSFERABLE UTILITY, CHANGES IN PRODUCTION POSSIBILITIES, AND BARGAINING SOLUTIONS *

Topics in Mathematical Economics. Atsushi Kajii Kyoto University

6 The Principle of Optimality

E ciency in Coalition Games with Externalities

Network Calculus. A General Framework for Interference Management and Resource Allocation. Martin Schubert

The Kuhn-Tucker Problem

Chapter 12: Social Choice Theory

Bargaining without Disagreement

Econ Spring Review Set 1 - Answers ELEMENTS OF LOGIC. NECESSARY AND SUFFICIENT. SET THE-

Axiomatic Foundations for Compromise Theory. John P. Conley* Richard McLean** and Simon Wilkie*** Revised: February 2014

Implementing the Nash Extension Bargaining Solution for Non-convex Problems. John P. Conley* and Simon Wilkie**

Incentives and Machine Learning

The Coordinate-Wise Core for Multiple-Type Housing Markets is Second-Best Incentive Compatible

Volume 30, Issue 3. Monotone comparative statics with separable objective functions. Christian Ewerhart University of Zurich

Achieving Efficiency with Manipulative Bargainers

Extensive Form Games with Perfect Information

Some Notes on Adverse Selection

THREE ESSAYS ON GAME THEORY. Demet Yilmazkuday. Dissertation. Submitted to the Faculty of the. Graduate School of Vanderbilt University

On the Redundancy of the Implicit Welfarist Axiom in Bargaining Theory

SIMILAR-ON-THE-BOUNDARY TESTS FOR MOMENT INEQUALITIES EXIST, BUT HAVE POOR POWER. Donald W. K. Andrews. August 2011

Lecture 1- The constrained optimization problem

Regret Testing: A Simple Payo -Based Procedure for Learning Nash Equilibrium 1

Local disaggregation of demand and excess demand functions: a new question

Additive rules for the quasi-linear bargaining problem

Northwestern University

Advanced Microeconomics

On the Non-Symmetric Nash and Kalai Smorodinsky Bargaining Solutions. Yigal Gerchak

A fair rule in minimum cost spanning tree problems 1

Adding an Apple to an Orange: A General Equilibrium Approach to Aggregation of Beliefs

On the Impact of Independence of Irrelevant Alternatives


AN ORDINAL SOLUTION TO BARGAINING PROBLEMS WITH MANY PLAYERS

Dual Bargaining and the Talmud Bankruptcy Problem

Lecture notes on Bargaining and the Nash Program

Microeconomics, Block I Part 1

Axiomatic Characterization of Task Oriented Negotiation

CAE Working Paper # Equivalence of Utilitarian Maximal and Weakly Maximal Programs. Kuntal Banerjee and Tapan Mitra.

Consistent Comparison of Pro-Poor Growth

Economics of Controlling Climate Change under Uncertainty.

Lecture 7: General Equilibrium - Existence, Uniqueness, Stability

; p. p y p y p y. Production Set: We have 2 constraints on production - demand for each factor of production must be less than its endowment

1 Cooperative bargaining

Near convexity, metric convexity, and convexity

Non-convex Aggregate Technology and Optimal Economic Growth

Game Theory and Economics of Contracts Lecture 5 Static Single-agent Moral Hazard Model

Implementing the Nash Programin Stochastic Games

Transcription:

Faculty of Business and Law School of Accounting, Economics and Finance ECONOMICS SERIES SWP 2009/16 Weakest Collective Rationality and the Nash Bargaining Solution Nejat Anbarci and Ching-jen Sun The working papers are a series of manuscripts in their draft form. Please do not quote without obtaining the author s consent as these works are in their draft form. The views expressed in this paper are those of the author and not necessarily endorsed by the School or IBISWorld Pty Ltd.

Weakest Collective Rationality and the Nash Bargaining Solution Nejat Anbarci and Ching-jen Sun y October 2009 Abstract We propose a new axiom, Weakest Collective Rationality (WCR) which is weaker than both Weak Pareto Optimality (WPO) in Nash (1950) s original characterization and Strong Individual Rationality (SIR) in Roth (1977) s characterization of the Nash bargaining solution. We then characterize the Nash solution by Symmetry (SYM), Scale Invariance (SI), Independence of Irrelevant Alternatives (IIA) and our Weakest Collective Rationality (WCR) axiom. JEL classi cation: C78; D74 Keywords: Nash Bargaining Solution, Pareto Optimality, Strong Individual Rationality, Weak Pareto Optimality, Weakest Collective Rationality. 1 Introduction Nash s bargaining problem is a pair which consists of a convex and compact utility possibility set and a disagreement point; the latter is the utility allocation that results if no agreement is reached by both parties. A bargaining solution selects a unique allocation from any given bargaining problem. Nash (1950) axiomatically characterized the rst solution to the bargaining problem, the Nash solution N; by using Scale Invariance (SI), Symmetry (SYM), Independence of Irrelevant Alternatives (IIA), and Weak Pareto Optimality (WPO). Roth (1977) showed that WPO can be replaced by Strong Individual Rationality (SIR) in the characterization of N. Although neither WPO nor SIR imply each other, School of Accounting, Economics and Finance, Deakin University, 70 Elgar Road, Burwood, VIC 3125, Australia. E-mails: nejat.anbarci@deakin.edu.au and cjsun@deakin.edu.au. y We are grateful to Marco Mariotti, Herve Moulin, Alvin Roth and William Thomson for their valuable comments and suggestions. 1

intuitively Roth s characterization has been considered as a very signi cant improvement over Nash s original characterization. We propose a new axiom, Weakest Collective Rationality (WCR), which is weaker than both WPO and SIR. We then show that combining WCR with SI, SYM and IIA uniquely characterizes N. 2 Basic De nitions and Our Result A two-person bargaining problem is a pair (S; d); where S R 2 is the set of utility possibilities, and d 2 S is the disagreement point, which is the utility allocation that results if no agreement is reached by both parties. It is assumed that (1) S is compact and convex; and (2) x > d for some x 2 S. 1 Let be the class of all two-person problems satisfying (1) and (2) above. De ne IR(S; d) fx 2 Sjx dg; and W P O(S) fx 2 Sj8x 0 2 R 2 and x 0 > x ) x 0 =2 Sg: A solution is a function f :! R 2 such that for all (S; d) 2 ; f 2 S: The Nash solution, N; is such that its outcome for each (S; d) 2 is given by N(S; d) = arg maxf(x 1 d 1 )(x 2 d 2 )jx 2 IR(S; d)g: Nash (1950) showed that N is the unique solution that satis es the following four axioms: Weak Pareto Optimality (WPO): For all (S; d) 2 ; f(s; d) 2 W P O(S): Symmetry (SYM): For all (S; d) 2 ; if [d 1 = d 2 ; and (x; y) 2 S ) (y; x) 2 S], then f 1 (S; d) = f 2 (S; d): Let T = (T 1 ; T 2 ) : R 2! R 2 be a positive a ne transformation if T (x 1 ; x 2 ) = (a 1 x 1 + b 1 ; a 2 x 2 + b 2 ) for some positive constants a i and b i : Scale Invariance (SI): For all (S; d) 2 and a positive a ne transformation T; f(t (S; d)) = T (f(s; d)) holds. Independence of Irrelevant Alternatives (IIA) For all (S; d); (T; e) 2 with d = e; if T S and f(t; d) 2 S; then f(s; d) = f(t; d): Roth (1977) showed that WPO can be replaced by the following axiom: Strong Individual Rationality (SIR): For all (S; d) 2 ; f(s; d) > d: WPO, as a condition on collective rationality, requires that the compromise reached by parties cannot be strictly improved upon. On the other hand, SIR, as a condition on individual rationality, requires that each party must strictly bene t from bargaining. As mentioned in the Introduction, WPO and SIR do not imply each other. Next, we will introduce a requirement of collective rationality that is considerably weaker than both WPO and SIR. Denote by D(a) fx 2 R 2 jx ag the set of all points 1 Given x; y 2 R 2 ; x > y if x i > y i for each i; and x y if x i y i for each i: 2

WPO SIR WCR S S S d d d w FIGURE 1 dominated by a: For a given problem (S; d); denote by P I(S) fx 2 SnW P O(S)j D(x) \ S = fxgg the set of Pareto inferior points in S: P I(S) is the collection of non-weak Pareto-optimal compromises such that for each compromise, there is no other feasible compromise that make both parties worse o. For any (S; d) where d is in the interior of S; the points in P I are dominated by either d 1 or d 2 or both and they are the worst possible compromises that the two parties can possibly nd in S. Our axiom states that parties should avoid such compromises as a solution outcome. Weakest Collective Rationality (WCR) For all (S; d) 2 ; f(s; d) =2 P I(S): Figure 1 shows the di erences among WPO, SIR and WCR. Suppose the set of utility possibilities S consists of all points in a right-angled triangle (boundary included). WPO then requires the bargaining outcome f(s; d) to be on the hypotenuse. SIR requires f(s; d) to be in the small right triangle above d: In sharp contrast to WPO and SIR, WCR allows f(s; d) to be any point in S except w; as P I(S) = fwg: Observe that if f(s; d) =2 P I(S), then it is not necessarily the case that f(s; d) > d. To see that consider an f(s; d) arbitrarily close to w in Part 3 of Figure 1. Thus, WCR does not imply SIR. Likewise, if f(s; d) =2 P I(S), then it is not necessarily case that f(s; d) 2 W P O(S). To see that again consider an f(s; d) arbitrarily close to w in Part 3 of Figure 1. Thus, WCR does not imply WPO either. But clearly, if f(s; d) > d, then f(s; d) =2 P I(S). Likewise, if f(s; d) 2 W P O(S), then f(s; d) =2 P I(S). Thus, both SIR and WPO imply WCR. Hence the main result of this paper below improves on Nash (1950) and Roth (1977) 2 : 2 Although our result holds for more than two parties as well, we will only provide it for two parties 3

(x,y) 45 0 (y,y) (z,z) (x,x) FIGURE 2 Proposition 1 N is the unique solution satisfying SYM, SI, IIA, and WCR. Proof. N satis es these four axioms. Suppose f satis es SYM, SI, IIA and WCR. We will show that f = N: First we prove a lemma. Given any x 2 R and y 2 R such that x < y; denote by 4(x; y) convf(x; x); (x; 2y x); (2y x; x)g the symmetric right-angled triangle with (x; x) and (y; y) on the boundary of 4(x; y) (see gure 2). 3 Lemma 1. If f satis es SYM, SI, IIA and WCR, then for any x z < y; f(4(x; y); (z; z)) = (y; y): Proof. Let l[x; y] (l(x; y)) be the closed (open) line segment connecting (x; x) and (y; y): We prove it by establishing the following claims: (i) f(4(x; y); (z; z)) 2 l[x; y] by SYM: (ii) f(4(x; y); (z; z)) 6= (x; x): Since (x; x) 2 P I(4(x; y)): By WCR, f(4(x; y); (z; z)) 6= (x; x): (iii) f(4(x; y); (z; z)) =2 l(x; y)nf(z; z)g: Simply follow Roth (1977) s proof. (iv) f(4(x; y); (z; z)) 6= (z; z): Suppose to the contrary that f(4(x; y); (z; z)) = (z; z): By IIA, f(4(z; y); (z; z)) = (z; z): On the other hand, f(4(z; y); (z; z)) 6= (z; z) by WCR, a contradiction. Consider now a problem (S; d) and identify its Nash solution outcome, N(S; d): By SI, we can, without loss of generality assume, d = (0; 0) and N(S; d) = (1; 1): By compactness of S and the fact that (1; 1) is the Nash bargaining solution in (S; d); there here. 3 conv denotes the convex hull of. 4

exists x 2 R such that 4(x; 1) S: By Lemma 1, f(4(x; 1); (0; 0)) = (1; 1): By IIA, f(s; d) = (1; 1) = N(S; d): Now we provide intuition as to what roles di erent axioms ful ll in singling out the solution outcome of a given bargaining problem when one combines SI, IIA and SYM with (i) SIR or (ii) WCR. Axioms - sometimes in tandem - can be used in ruling out di erent parts or points of the utility possibility set until only the solution outcome remains. With Roth (1977) s replacement of WPO by SIR, all alternatives but the strongly individually rational ones can be eliminated via SIR. Then, as the proof of Roth s Lemma illustrates, IIA and SI together are su cient to rule out any interior (ine cient) alternatives from becoming the solution outcome. Then the rest follows as with Nash s original axioms. Note that if Individual Rationality (for all (S; d) 2 ; f(s; d) 2 IR(S; d)) is used instead of SIR with SYM, SI and IIA, then both N and d become solution outcomes. If only SYM, SI and IIA are used, then not only N and d but some point in P I(S) too becomes a solution outcome. With our replacement of SIR (or WPO) by WCR, in a nutshell, the two multi-purpose axioms, IIA and SI, still perform their usual roles, and SYM and WCR provide nishing touches (the above proof is surely more complex than this story, but the intutition here can still paint a su cient picture): After SI makes a suitable transformation of the utility possibility set, IIA can be used to reduce the utility possibility set to a symmetric one with only individually rational alternatives. Then IIA and SI together are su cient to eliminate any interior alternatives from consideration (as in Roth). Subsequently, by SYM, only d and the unique symmetric e cient alternative remain eligible to become the solution outcome. Finally, WCR eliminates the worst remaining alternative, d, from consideration making the unique symmetric e cient alternative the solution outcome. In the following, we provide the independence of axioms by presenting four solutions. Each solution violates one axiom while satisfying the remaining three. SYM Let f(s; d) = arg maxf(x 1 d 1 ) 1 3 (x 2 d 2 ) 2 3 jx 2 IR(S; d)g: SI Let e(s; d) denote maxfy 2 Rj(y + d 1 ; y + d 2 ) 2 Sg 0: Let f(s; d) = (e(s; d) + d 1 ; e(s; d) + d 2 ) if e(s; d) > 0; and f(s; d) = N(S; d) otherwise. IIA The Kalai-Smorodinsky solution (Kalai and Smorodinsky (1975)): K(S; d) = maxfu 2 Sj there exists 2 [0; 1] such that u = b(s; d) + (1 )dg; where b(s; d) (b 1 (S; d); b 2 (S; d)) with b i (S; d) = maxfx i jx 2 IR(S; d)g is the ideal point in (S; d): WCR For all (S; d) 2 ; f(s; d) d. 5

References [1] Kalai, E. and M. Smorodinsky (1975): Other Solutions to Nash s Bargaining Problem, Econometrica, 43, 513-518. [2] Nash, John F. (1950), The Bargaining Problem, Econometrica, 18, 155-162. [3] Roth, Alvin E. (1977), Individual Rationality and Nash s Solution to The Bargaining Problem, Mathematics of Operations Research, 2, 64-65. 6