A general branch-and-bound algorithm for fair division problems

DOI10.1016/j.cor.2010.03.001zbMath1232.91370OpenAlexW2074777719MaRDI QIDQ991365

Rudolf Vetschera

Publication date: 7 September 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.03.001

zbMATH Keywords

algorithmgame theorybranch-and-boundfair division

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (6)

Algorithms and implementation of a set partitioning approach for modular machining line design ⋮ Integral Column Generation for Set Partitioning Problems with Side Constraints ⋮ Fair division of indivisible items between two players: design parameters for contested pile methods ⋮ Fair allocation of indivisible goods with minimum inequality or minimum envy ⋮ A modified greedy analysis pursuit algorithm for the cosparse analysis model ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• To be fair or efficient or a bit of both
• Strategy-proofness, solidarity, and consistency for multiple assignment problems
• Fair division of indivisible items
• A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics
• Max-min fairness in multi-commodity flows
• Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
• The undercut procedure: an algorithm for the envy-free division of indivisible items
• How to allocate hard candies fairly
• A simple procedure for finding equitable allocations of indivisible goods
• The Bargaining Problem
• Fairness in routing and load balancing

This page was built for publication: A general branch-and-bound algorithm for fair division problems