Similar Search Results

Two-person fair division with additive valuations

Kilgour, D. Marc; Vetschera, Rudolf - In: Group decision and negotiation 33 (2024) 4, pp. 745-774

Persistent link: https://www.econbiz.de/10015056287

Economics and Computation : An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division

Rothe, Jörg (ed.); Rothe, Irene (illustration) - 2024 - Second edition

divisible resource ("cake-cutting") and multiple indivisible and unshareable resources ("multiagent resource allocation"). In …

Persistent link: https://www.econbiz.de/10014565987

An equilibrium analysis of Knaster’s fair division procedure

Van Essen, Matthew - In: Games 4 (2013) 1, pp. 21-37

allocation is still efficient but may not be fair. However, on average, participants receive the same outcome they would have …

Persistent link: https://www.econbiz.de/10009753712

Cake cutting : fair and square

Segal-Halevi, Erel; Nitsan, Shemuʾel - 2014

The classic fair cake-cutting problem [Steinhaus, 1948] is extended by introducing geometric constraints on the allocated pieces. Specifically, agents may demand to get their share as a square or a rectangle with a bounded length/width ratio. This is a plausible constraint in realistic...

Persistent link: https://www.econbiz.de/10010231699