Nonconvex n-person bargaining: efficient maxmin solutions

DOI10.1007/S00199-001-0246-7zbMATH Open1032.91059OpenAlexW1969826050MaRDI QIDQ1865166FDOQ1865166

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)

Cited In (6)

• On the axiomatic theory of bargaining: a survey of recent results
• Title not available (Why is that?)
• Efficiency-free characterizations of the Kalai-Smorodinsky bargaining solution
• On iterated Nash bargaining solutions
• \(n\)-person non-convex bargaining: efficient proportional solutions
• Nash bargaining for log-convex problems

   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 👍 👎

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)