\(n\)-person non-convex bargaining: efficient proportional solutions
From MaRDI portal
Publication:614033
DOI10.1016/j.orl.2010.09.008zbMath1202.91116MaRDI QIDQ614033
Jens Leth Hougaard, Mich Tvede
Publication date: 23 December 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.09.008
91A06: (n)-person games, (n>2)
91B26: Auctions, bargaining, bidding and selling, and other market models
Related Items
On the axiomatic theory of bargaining: a survey of recent results, Efficiency-free characterizations of the Kalai-Smorodinsky bargaining solution, Gradual negotiations and proportional solutions
Cites Work
- The bargaining problem without convexity. Extending the egalitarian and Kalai-Smorodinsky solutions
- Benefit functions and duality
- Bargaining problems with claims
- Beyond Nash bargaining theory: The Nash set
- Bargaining without convexity: generalizing the Kalai-Smorodinsky solution
- The Nash program: Non-convex bargaining problems
- Nonconvex \(n\)-person bargaining: efficient maxmin solutions
- Benefit and distance functions
- Other Solutions to Nash's Bargaining Problem
- Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons
- The Nash Bargaining Theory with Non-Convex Problems
- Benchmark selection: An axiomatic approach