| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 7373340 | Mathematical Social Sciences | 2016 | 9 Pages |
Abstract
This paper shows that three classic properties for bargaining solutions in an environment with a variable number of agents-Anonymity (AN), Individual Monotonicity (IM), and Consistency (CONS)-characterize a one-parameter family of Truncated Leximin solutions. Given a non-negative and possibly infinite α, an α-Truncated Leximin solution gives each agent the minimum of α and their Leximin solution payoff.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Bram Driesen,