The partition bargaining problem

DOI10.1016/J.DAM.2006.06.014MaRDI QIDQ2473040zbMATH OpenOpenAlexFDO

Authors Uriel G. Rothblum, Yoav Tangir

Publication date 26 February 2008

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2006.06.014

zbMATH Keywords

partitionsNash solutionbargaining gamespartition bargaining games

Mathematics Subject Classification ID

Cooperative games (91A12)

Recommendations

• The Pareto set of the partition bargaining problem
• scientific article; zbMATH DE number 1054707
• The bargaining problem
• scientific article; zbMATH DE number 834589
• Fair (and not so fair) division

Cites work

• A Polynomial Time Algorithm for Shaped Partition Problems
• Axiomatic models of bargaining
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Convex Analysis
• Convex combinatorial optimization
• Edge-directions of standard polyhedra with applications to network flows
• Improved Algorithms for Bipartite Network Flow
• Lectures on Polytopes
• Other Solutions to Nash's Bargaining Problem
• Partition of Space
• The Pareto set of the partition bargaining problem
• The bargaining problem

Cited in

(5)

• Partition function bargaining with public demands
• The Bipartite Rationing Problem
• A new two-party bargaining mechanism
• The Pareto set of the partition bargaining problem
• Edge-directions of standard polyhedra with applications to network flows

This page was built for publication: The partition bargaining problem

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