Nonconvex \(n\)-person bargaining: efficient maxmin solutions

DOI10.1007/S00199-001-0246-7zbMath1032.91059OpenAlexW1969826050MaRDI QIDQ1865166

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) (n)-person games, (n>2) (91A06) Auctions, bargaining, bidding and selling, and other market models (91B26) Evolutionary games (91A22)

Related Items (6)

\(n\)-person non-convex bargaining: efficient proportional solutions ⋮ On iterated Nash bargaining solutions ⋮ On the axiomatic theory of bargaining: a survey of recent results ⋮ Efficiency-free characterizations of the Kalai-Smorodinsky bargaining solution ⋮ Unnamed Item ⋮ Nash bargaining for log-convex problems

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