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

DOI10.1016/J.COR.2010.03.001zbMATH Open1232.91370OpenAlexW2074777719MaRDI QIDQ991365FDOQ991365

Authors: 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

Recommendations

• Brams-Taylor model of fair division for divisible and indivisible items
• How to divide things fairly
• Fair Division
• Two-player fair division of indivisible items: comparison of algorithms
• Finding maxmin allocations in cooperative and competitive fair division

zbMATH Keywords

game theoryalgorithmbranch-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)

Cites Work

• The bargaining problem
• Fairness in routing and load balancing
• Title not available (Why is that?)
• Fair division of indivisible items
• A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics
• Max-min fairness in multi-commodity flows
• Title not available (Why is that?)
• To be fair or efficient or a bit of both
• Title not available (Why is that?)
• A simple procedure for finding equitable allocations of indivisible goods
• Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
• Strategy-proofness, solidarity, and consistency for multiple assignment problems
• 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

Cited In (10)

• Optimization problems in fair division theory.
• Fair allocation of indivisible goods with minimum inequality or minimum envy
• Integral Column Generation for Set Partitioning Problems with Side Constraints
• From the bankruptcy problem and its concede-and-divide solution to the assignment problem and its fair division solution
• Algorithms and implementation of a set partitioning approach for modular machining line design
• Title not available (Why is that?)
• Fair division of indivisible items between two players: design parameters for contested pile methods
• A combinatorial algorithm to establish a fair border
• Title not available (Why is that?)
• A modified greedy analysis pursuit algorithm for the cosparse analysis model

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

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