Generalized maximin solutions in multicriteria bargaining
From MaRDI portal
Publication:816520
DOI10.1007/s10479-005-2259-2zbMath1138.91403OpenAlexW2127652855MaRDI QIDQ816520
Miguel A. Hinojosa, Luisa Monroy, Amparo M. Mármol
Publication date: 9 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-2259-2
(n)-person games, (n>2) (91A06) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items
An equitable solution for multicriteria bargaining games, The conservative Kalai-Smorodinsky solution for multiple scenario bargaining, The Shapley-Shubik index for multi-criteria simple games, The price of fairness with the extended Perles-Maschler solution, Bargaining over multiple issues with maximin and leximin preferences, A BARGAINING MODEL FOR FINITE N-PERSON MULTI-CRITERIA GAMES, Multi-Criteria Simple Games, A general model for voting systems with multiple alternatives
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A characterization of the leximin solution of the bargaining problem
- Multiple-issue bargaining and axiomatic solutions
- Individual monotonicity and the leximin solution
- Vector linear programming in zero-sum multicriteria matrix games
- An interactive approach to multiple criteria optimization with multiple decision-makers
- Individual Monotonicity and Lexicographic Maxmin Solution
- Other Solutions to Nash's Bargaining Problem
- Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons
- Multi-attribute decision-making in individual and social choice
- Sequential incorporation of imprecise information in multiple criteria decision processes