Nonconvex n-person bargaining: efficient maxmin solutions

DOI10.1007/S00199-001-0246-7MaRDI QIDQ1865166zbMATH OpenOpenAlexFDO

Authors Jens Leth Hougaard, Mich Tvede

Publication date 25 March 2003

Published in Economic Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00199-001-0246-7

zbMATH Keywords

axiomatic approachKalai-Smorodinsky solutiondecision-theoretic systemsevolutionary game-theoretic modelsnon-convex \(n\)-person bargainingunique efficient maxmin solution

Mathematics Subject Classification ID

Cooperative games (91A12) Auctions, bargaining, bidding and selling, and other market models (91B26) (n)-person games, (n>2) (91A06) Evolutionary games (91A22)

Recommendations

• Altenative characterizations of three bargaining solution for nonconvex problems
• \(n\)-person non-convex bargaining: efficient proportional solutions
• An equitable Nash solution to nonconvex bargaining problems
• The Nash Bargaining Theory with Non-Convex Problems
• An extension of the Nash bargaining solution to nonconvex problems

Cited in

(10)

• On the axiomatic theory of bargaining: a survey of recent results
• scientific article; zbMATH DE number 7306856 (Why is no real title available?)
• \(n\)-person non-convex bargaining: efficient proportional solutions
• Efficiency-free characterizations of the Kalai-Smorodinsky bargaining solution
• A logic-based axiomatic model of bargaining
• On iterated Nash bargaining solutions
• An equitable Nash solution to nonconvex bargaining problems
• Altenative characterizations of three bargaining solution for nonconvex problems
• Rationality and solutions to nonconvex bargaining problems: rationalizability and Nash solutions
• Nash bargaining for log-convex problems

This page was built for publication: Nonconvex \(n\)-person bargaining: efficient maxmin solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865166)