Truncated Leximin solutions
نویسنده
چکیده
This paper shows that three classic properties for bargaining solutions in an environment with a variable number of agents – Anonymity, Individual Monotonicity and Consistency – characterize a one-parameter class of Truncated Leximin solutions. Given a positive and possibly infinite α, a Truncated Leximin solution gives each agent the minimum of α and their Leximin solution payoff. JEL-Classification: C78
منابع مشابه
Proportional Concessions and the Leximin Solution
In this article we introduce a new axiom for bargaining solutions, named Proportional Concession Monotonicity (PCM), which imposes that no player benefit when all players collectively make proportional concessions with respect to their respective utopia values. We reconsider the leximin solution (Imai, 1983), and obtain an alternative characterization on the basis of PCM. JEL-Classification: C78
متن کاملBargaining over multiple issues with maximin and leximin preferences
Global bargaining problems over a finite number of different issues are formalized as cartesian products of classical bargaining problems. For maximin and leximin bargainers we characterize global bargaining solutions that are efficient and satisfy the requirement that bargaining separately or globally leads to equivalent outcomes. Global solutions in this class are constructed from the family ...
متن کاملThe Asymmetric Leximin Solution
In this article we define and characterize a class of asymmetric leximin solutions, that contains both the symmetric leximin solution of Imai [5] and the two-person asymmetric Kalai-Smorodinsky solution of Dubra [3] as special cases. Solutions in this class combine three attractive features: they are defined on the entire domain of convex n-person bargaining problems, they generally yield Paret...
متن کاملAlgorithms for Leximin-Optimal Fair Policies in Repeated Games
Solutions to non-cooperative multiagent systems often require achieving a joint policy which is as fair to all parties as possible. There are a variety of methods for determining the fairest such joint policy. One approach, min fairness, finds the policy which maximizes the minimum average reward given to any agent. We focus on an extension, leximin fairness, which breaks ties among candidate p...
متن کاملComputing improved optimal solutions to max-min flexible constraint satisfaction problems
The formal framework for decision making in a fuzzy environment is based on a general maxmin, bottleneck-like optimization problem, proposed by Zadeh. It is also the basis for extending the constraint satisfaction paradigm of Artificial Intelligence to accommodating flexible or prioritized constraints. This paper surveys refinements of the ordering of solutions supplied by the max-min formulati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Social Sciences
دوره 83 شماره
صفحات -
تاریخ انتشار 2016