A general branch-and-bound algorithm for fair division problems
type: Item
instance of: scholarly article
title: A general branch-and-bound algorithm for fair division problems
zbMATH Open document ID: 1232.91370
author: Rudolf Vetschera
published in: Computers \& Operations Research
publication date: 2010-09-07T00:00:00Z
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5780047
zbMATH Keywords: fair division
zbMATH Keywords: branch-and-bound
zbMATH Keywords: game theory
zbMATH Keywords: algorithm
MaRDI profile type: Publication
full work available at URL: j.cor.2010.03.001
OpenAlex ID: W2074777719
cites work: Fairness in routing and load balancing
cites work: A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics
cites work: Max-min fairness in multi-commodity flows
cites work: Strategy-proofness, solidarity, and consistency for multiple assignment problems
cites work: Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
cites work: How to allocate hard candies fairly
cites work: Q4338900
cites work: Fair division of indivisible items
cites work: A simple procedure for finding equitable allocations of indivisible goods
cites work: Q3379036
cites work: The undercut procedure: an algorithm for the envy-free division of indivisible items
cites work: Q3624140
cites work: Q3597151
cites work: The Bargaining Problem
cites work: To be fair or efficient or a bit of both
DOI: 10.1016/J.COR.2010.03.001
description: scientific article; zbMATH DE number 5780047