Truncated leximin solutions

Driesen, B. (2016) Truncated leximin solutions. Mathematical Social Sciences, 83, pp. 79-87. (doi: 10.1016/j.mathsocsci.2016.07.003)

[img]
Preview
Text
121222.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

541kB

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.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Driesen, Dr Bram
Authors: Driesen, B.
College/School:College of Social Sciences > Adam Smith Business School > Economics
Journal Name:Mathematical Social Sciences
Publisher:Elsevier
ISSN:0165-4896
ISSN (Online):0165-4896
Published Online:02 August 2016
Copyright Holders:Copyright © 2016 The Author
First Published:First published in Mathematical Social Sciences 83_79-87
Publisher Policy:Reproduced under a Creative Commons License

University Staff: Request a correction | Enlighten Editors: Update this record