Two-player fair division of indivisible items: comparison of algorithms
type: Item
instance of: scholarly article
title: Two-player fair division of indivisible items: comparison of algorithms
zbMATH Open document ID: 1403.91213
author: D. Marc Kilgour
author: Rudolf Vetschera
published in: European Journal of Operational Research
publication date: 2018-07-25T00:00:00Z
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 6910123
zbMATH Keywords: fair division
zbMATH Keywords: indivisible items
zbMATH Keywords: Borda score
zbMATH Keywords: computational study
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.05.057
OpenAlex ID: W2807266134
cites work: The Santa Claus problem
cites work: Fair Allocation of Indivisible Goods
cites work: The undercut procedure: an algorithm for the envy-free division of indivisible items
cites work: How to Divide Things Fairly
cites work: Q4338900
cites work: Proportional Borda allocations
cites work: A NEW MEASURE OF RANK CORRELATION
cites work: Handbook of group decision and negotiation
cites work: In Silico Voting Experiments
Wikidata QID: Q129738457
DOI: 10.1016/J.EJOR.2018.05.057
description: scientific article; zbMATH DE number 6910123