Algorithms - ESA 2003

DOI10.1007/b13632zbMath1266.68120OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897268

Jiří Sgall, Gerhard J. Woeginger

Publication date: 3 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (2)

Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting ⋮ Cutting a Cake for Five People

This page was built for publication: Algorithms - ESA 2003