Bargaining, Coalitions, and Fairness
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Nash-Type Bargaining with Coherent Acceptability Measures
Splitting a Random Pie: Nash-Type Bargaining with Coherent Acceptability Measures Walter J. Gutjahr University of Vienna, Vienna, Austria, [email protected] Raimund M. Kovacevic Vienna University of Technology, Vienna, Austria, [email protected] David Wozabal Technische Universit¨atM¨unchen, Munich, Germany, [email protected] We propose an axiomatic solution for cooperative stochastic games where risk averse players bargain for the allocation of profits from a joint project that depends on management decisions by the agents. We model risk preferences by coherent acceptability functionals and show that in this setting the axioms of Pareto optimality, symmetry, and strategy proofness fully characterize a bargaining solution, which can be efficiently computed by solving a stochastic optimization problem. Furthermore, we demonstrate that there is no conflict of interest between players about management decisions and characterize special cases where random payoffs of players are simple functions of overall project profit. In particular, we show that for players with distortion risk functionals, the optimal bargaining solution can be represented by an exchange of standard options contracts with the project profit as the underlying. We illustrate the concepts in the paper by a detailed example of risk averse households that jointly invest into a solar plant. Key words : Stochastic bargaining games; coherent risk measures; stochastic programming; photovoltaics History : 1. Introduction If a project is undertaken jointly by several agents and there is no efficient market for individual contributions, the question of how to distribute the project's profits arises. The case when profits are deterministic is well studied in the field of cooperative game theory. -
Uniqueness and Symmetry in Bargaining Theories of Justice
Philos Stud DOI 10.1007/s11098-013-0121-y Uniqueness and symmetry in bargaining theories of justice John Thrasher Ó Springer Science+Business Media Dordrecht 2013 Abstract For contractarians, justice is the result of a rational bargain. The goal is to show that the rules of justice are consistent with rationality. The two most important bargaining theories of justice are David Gauthier’s and those that use the Nash’s bargaining solution. I argue that both of these approaches are fatally undermined by their reliance on a symmetry condition. Symmetry is a substantive constraint, not an implication of rationality. I argue that using symmetry to generate uniqueness undermines the goal of bargaining theories of justice. Keywords David Gauthier Á John Nash Á John Harsanyi Á Thomas Schelling Á Bargaining Á Symmetry Throughout the last century and into this one, many philosophers modeled justice as a bargaining problem between rational agents. Even those who did not explicitly use a bargaining problem as their model, most notably Rawls, incorporated many of the concepts and techniques from bargaining theories into their understanding of what a theory of justice should look like. This allowed them to use the powerful tools of game theory to justify their various theories of distributive justice. The debates between partisans of different theories of distributive justice has tended to be over the respective benefits of each particular bargaining solution and whether or not the solution to the bargaining problem matches our pre-theoretical intuitions about justice. There is, however, a more serious problem that has effectively been ignored since economists originally J. -
Fair Division Michael Meurer Boston Univeristy School of Law
Boston University School of Law Scholarly Commons at Boston University School of Law Faculty Scholarship 1999 Fair Division Michael Meurer Boston Univeristy School of Law Follow this and additional works at: https://scholarship.law.bu.edu/faculty_scholarship Part of the Gaming Law Commons Recommended Citation Michael Meurer, Fair Division, 47 Buffalo Law Review 937 (1999). Available at: https://scholarship.law.bu.edu/faculty_scholarship/530 This Article is brought to you for free and open access by Scholarly Commons at Boston University School of Law. It has been accepted for inclusion in Faculty Scholarship by an authorized administrator of Scholarly Commons at Boston University School of Law. For more information, please contact [email protected]. BOSTON UNIVERSITY SCHOOL OF LAW WORKING PAPER SERIES, LAW & ECONOMICS WORKING PAPER NO. 99-10 FAIR DIVISION MICHAEL MEURER THIS PAPER APPEARS IN 47 BUFFALO LAW REVIEW 937 AND IS REPRINTED BY PERMISSION OF THE AUTHOR AND BUFFALO LAW REVIEW This paper can be downloaded without charge at: The Boston University School of Law Working Paper Series Index: http://www.bu.edu/law/faculty/papers The Social Science Research Network Electronic Paper Collection: http://papers.ssrn.com/paper.taf?abstract_id=214949 BOOK REVIEW Fair Division † MICHAEL J. MEURER appearing in 47 BUFFALO LAW REVIEW 937-74 (1999) INTRODUCTION Fair division is a fundamental issue of legal policy. The law of remedies specifies damages and rules of contribution that apportion liability among multiple defendants.1 Probate law specifies -
Endgame Solving
Endgame Solving: The Surprising Breakthrough that Enabled Superhuman Two-Player No- Limit Texas Hold 'em Play Sam Ganzfried Assistant Professor, Computer Science, Florida International University, Miami FL PhD, Computer Science Department, Carnegie Mellon University, 2015 [email protected] 1 2 3 4 5 Milestones • Opponent Modelling in Poker, Billings et.al., ‘98 • Abstraction Methods for Game-Theoretic Poker, Shi/Littman, ‘00 • Approximating Game-Theoretic Optimal Strategies for Full-scale Poker, Billings et.al., ‘03 • Optimal Rhode Island Poker, Gilpin/Sandholm, ‘05 • Annual Computer Poker Competition ‘06-Present • EGT/automated abstraction algorithms, Gilpin/Sandholm ‘06-‘08 • Regret Minimization in Games with Incomplete Information, Zinkevich et.al., ‘07 • Man vs. Machine limit Texas hold ‘em competitions ‘08-’09 • Computer Poker & Imperfect Information Symposium/Workshop ‘12-Present • Heads-up Limit Hold'em Poker is Solved, Bowling et.al., ‘15 • Brains vs. AI no-limit Texas hold ‘em competition ’15 • First Computer Poker Tutorial ‘16 • DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker ’17 • Second Brains vs. AI no-limit Texas hold ‘em competition ‘17 6 Scope and applicability of game theory • Strategic multiagent interactions occur in all fields – Economics and business: bidding in auctions, offers in negotiations – Political science/law: fair division of resources, e.g., divorce settlements – Biology/medicine: robust diabetes management (robustness against “adversarial” selection of parameters in MDP) – Computer -
Stable Allocations and the Practice of Market Design
15 OCTOBER 2012 Scientific Background on the Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel 2012 STABLE ALLOCATIONS AND THE PRACTICE OF MARKET DESIGN compiled by the Economic Sciences Prize Committee of the Royal Swedish Academy of Sciences THE ROYAL SWEDISH ACADEMY OF SCIENCES has as its aim to promote the sciences and strengthen their influence in society. BOX 50005 (LILLA FRESCATIVÄGEN 4 A), SE-104 05 STOCKHOLM, SWEDEN TEL +46 8 673 95 00, FAX +46 8 15 56 70, [email protected] HTTP://KVA.SE 1 Introduction Economists study how societies allocate resources. Some allocation problems are solved by the price system: high wages attract workers into a particu- lar occupation, and high energy prices induce consumers to conserve energy. In many instances, however, using the price system would encounter legal and ethical objections. Consider, for instance, the allocation of public-school places to children, or the allocation of human organs to patients who need transplants. Furthermore, there are many markets where the price system operates but the traditional assumption of perfect competition is not even approximately satis…ed. In particular, many goods are indivisible and het- erogeneous, whereby the market for each type of good becomes very thin. How these thin markets allocate resources depends on the institutions that govern transactions. This year’s prizewinning work encompasses a theoretical framework for analyzing resource allocation, as well as empirical studies and actual redesign of real-world institutions such as labor-market clearinghouses and school ad- missions procedures. The foundations for the theoretical framework were laid in 1962, when David Gale and Lloyd Shapley published a mathematical inquiry into a certain class of allocation problems. -
PIER Working Paper 11-035
Penn Institute for Economic Research Department of Economics University of Pennsylvania 3718 Locust Walk Philadelphia, PA 19104-6297 [email protected] http://economics.sas.upenn.edu/pier PIER Working Paper 11-035 “Identification and Estimation of Stochastic Bargaining Models Fourth Version” by Antonio Merlo and Xun Tang http://ssrn.com/abstract=1946367 Identification and Estimation of Stochastic Bargaining Models∗ Antonio Merlo† Xun Tang‡ Revised, October 2011 Abstract Stochastic sequential bargaining models (Merlo and Wilson (1995, 1998)) have found wide applications in different fields including political economy and macroeconomics due to their flexibility in explaining delays in reaching an agreement. This paper presents new results in nonparametric identification and estimation of such models under different data scenarios. Key words: Nonparametric identification and estimation, non-cooperative bargaining, stochastic sequential bargaining, rationalizable counterfactual outcomes. JEL codes: C14, C35, C73, C78. ∗We thank co-editor Jean-Marc Robin and three anonymous referees for their helpful suggestions. Steven Berry, Herman Bierens, Hanming Fang, Philip Haile, Isabelle Perrigne, Katja Seim, Elie Tamer, Petra Todd, Quang Vuong, Ken Wolpin and seminar and conference participants at several institutions provided useful comments. We thank Hulya Eraslan for sharing her data with us and Chamna Yoon for providing excellent research assistance. The usual disclaimer applies. †Department of Economics, University of Pennsylvania, CEPR, CESifo and NBER, [email protected]. ‡Department of Economics, University of Pennsylvania, [email protected]. 1 1 Introduction Starting with the seminal contributions of Stahl (1972) and Rubinstein (1982), noncooper- ative (or strategic) bargaining theory has flourished in the past thirty years. The original model of bilateral bargaining with alternating offers and complete information has been extended in a number of directions allowing for more general extensive forms, information structure and more than two players (e.g. -
Publications of Agnes Cseh
Publications of Agnes Cseh This document lists all peer-reviewed publications of Agnes Cseh, Chair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, Germany. This listing was automatically generated on October 6, 2021. An up-to-date version is available online at hpi.de/friedrich/docs/publist/cseh.pdf. Journal articles [1] Cseh, Á., Juhos, A., Pairwise Preferences in the Stable Marriage Problem. In: ACM Transactions on Economics and Computation (TEAC) 9, pp. 1–28, 2021. [2] Cseh, Á., Kavitha, T., Popular matchings in complete graphs. In: Algorithmica, pp. 1–31, 2021. [3] Andersson, T., Cseh, Á., Ehlers, L., Erlanson, A., Organizing time exchanges: Lessons from matching markets. In: American Economic Journal: Microeconomics 13, pp. 338–73, 2021. [4] Cseh, Á., Fleiner, T., The Complexity of Cake Cutting with Unequal Shares. In: ACM Transactions on Algorithms 16, pp. 1–21, 2020. An unceasing problem of our prevailing society is the fair division of goods. The problem of proportional cake cutting focuses on dividing a heterogeneous and divisible resource, the cake, among n players who value pieces according to their own measure function. The goal is to assign each player a not necessarily connected part of the cake that the player evaluates at least as much as her proportional share. In this article, we investigate the problem of proportional division with unequal shares, where each player is entitled to receive a predetermined portion of the cake. Our main contribution is threefold. First we present a protocol for integer demands, which delivers a proportional solution in fewer queries than all known proto- cols. -
On Achieving Fairness and Stability in Many-To-One Matchings
On Achieving Fairness and Stability in Many-to-One Matchings Shivika Narang1, Arpita Biswas2, and Y Narahari1 1Indian Institute of Science (shivika, narahari @iisc.ac.in) 2Harvard University ([email protected]) Abstract The past few years have seen a surge of work on fairness in social choice literature. A major portion of this work has focused on allocation settings where items must be allocated in a fair manner to agents having their own individual preferences. In comparison, fairness in two- sided settings where agents have to be matched to other agents, with preferences on both sides, has received much less attention. Moreover, two-sided matching literature has mostly focused on ordinal preferences. This paper initiates the study of finding a stable many-to-one matching, under cardinal valuations, while satisfying fairness among the agents on either side. Specifically, motivated by several real-world settings, we focus on leximin optimal fairness and seek leximin optimality over many-to-one stable matchings. We first consider the special case of ranked valuations where all agents on each side have the same preference orders or rankings over the agents on the other side (but not necessarily the same valuations). For this special case, we provide a complete characterisation of the space of stable matchings. This leads to FaSt, a novel and efficient algorithm to compute a leximin optimal stable matching under ranked isometric valuations (where, for each pair of agents, the valuation of one agent for the other is the same). The running time of FaSt is linear in the number of edges. -
Efficiency and Sequenceability in Fair Division of Indivisible Goods With
Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences Sylvain Bouveret, Michel Lemaître To cite this version: Sylvain Bouveret, Michel Lemaître. Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences. COMSOC-2016, Jun 2016, Toulouse, France. hal-01293121 HAL Id: hal-01293121 https://hal.archives-ouvertes.fr/hal-01293121 Submitted on 5 Apr 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences Sylvain Bouveret and Michel Lemaˆıtre Abstract In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage, a designated agent picks one object among those that remain. This paper, restricted to the case where the agents have numerical additive preferences over objects, revisits to some extent the seminal paper by Brams and King [9] which was specific to ordinal and linear order preferences over items. We point out similarities and differences with this latter context. In particular, we show that any Pareto- optimal allocation (under additive preferences) is sequenceable, but that the converse is not true anymore. -
Fair Division with Bounded Sharing
Fair Division with Bounded Sharing Erel Segal-Halevi∗ Abstract A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If the objects cannot be shared, so that each of them must be entirely allocated to a single agent, then fair division may not exist. How many objects must be shared between two or more agents in order to attain a fair division? The paper studies various notions of fairness, such as proportionality, envy-freeness and equitability. It also studies consensus division, in which each agent assigns the same value to all bundles | a notion that is useful in truthful fair division mechanisms. It proves upper bounds on the number of required sharings. However, it shows that finding the minimum number of sharings is NP-hard even for generic instances. Many problems remain open. 1 Introduction What is a fair way to allocate objects without monetary transfers? When the objects are indivisible, it may be impossible to allocate them fairly | consider a single object and two people. A common approach to this problem is to look for an approximately- fair allocation. There are several definitions of approximate fairness, the most common of which are envy-freeness except one object (EF1) and maximin share (MMS). An alternative solution is to \make objects divisible" by allowing randomization and ensure that the division is fair ex-ante. While approximate or ex-ante fairness are reasonable when allocating low-value objects, such as seats in a course or in a school, they are not suitable for high-value objects, e.g., houses or precious jewels. -
From Axiomatic to Strategic Models of Bargaining with Logical Beliefs and Goals
From axiomatic to strategic models of bargaining with logical beliefs and goals Quoc Bao Vo and Minyi Li Faculty of Information & Communication Technologies Swinburne University of Technology, Australia email: {bvo | myli}@swin.edu.au ABSTRACT the strategic (non-cooperative) approach to provide the foundations 1 In this paper, we introduce axiomatic and strategic models for bar- for cooperative bargaining solution concepts. His approach was to gaining and investigate the link between the two. Bargaining situ- design a non-cooperative game, now known as the Nash demand ations are described in propositional logic while the agents’ pref- game, in which the only equilibrium outcome is exactly the one erences over the outcomes are expressed as ordinal preferences. suggested by Nash solution. Our main contribution is an axiomatic theory of bargaining. We We’ll now turn our attention to multiagent systems in which propose a bargaining solution based on the well-known egalitarian agents hold beliefs about the environment they are operating in and social welfare for bargaining problems in which the agents’ logical have goals they want to achieve or maintain. In many multiagent beliefs specify their bottom lines. We prove that the proposed so- frameworks, the agents beliefs and goals are represented as logical lution is uniquely identified by a set of axioms. We further present sentences. Moreover, the agents are required to interact, coordi- a model of bargaining based on argumentation frameworks with nate and in most cases, negotiate to reach agreements about who the view to develop a strategic model of bargaining using the con- do what and who get what. -
1 Cooperative Bargaining
1 Cooperative bargaining 1.1 The bargaining problem Bargaining situations are ubiquitous in our times, both in the Western and the Eastern hemisphere. Wage negotiations between a group of employers and a trade union, trade agreements between single countries (e.g. the US and Mexico) or between larger associ- ations (the European Union and the US) or, in the political sphere, disarmament talks between East and West during the cold war era, and, last but not least, environmental negotiations among developed nations and between developed and less developed coun- tries are only some examples of bargaining that have received considerable attention over the years. The problem is one of a choice of a feasible alternative by a group of people or nations or associations with often conflicting preferences in a framework of cooperation. As Kalai (1985, p. 77) writes, this `may be viewed as a theory of consen- sus, because when it is applied it is often assumed that a ¯nal choice can be made if and only if every member of the group supports this choice'. Kalai continues saying that `because this theory deals with the aggregation of peoples' preferences over a set of feasible alternatives, it bears close similarities to theories of social choice and the design of social welfare functions'. The ¯nal outcome that the individuals (or groups) involved strive for may be attained by the parties themselves. Sometimes, however, the ¯nal result will be reached via the mediation of an outside person, an arbitrator. There is one feature that distinguishes the bargaining problem fundamentally from almost all the other social choice approaches.