Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations

DOI10.1007/978-3-319-13129-0_1zbMath1406.91212arXiv1307.2908OpenAlexW1826244355WikidataQ64225933 ScholiaQ64225933MaRDI QIDQ2936971

Haris Aziz, Chun Ye

Publication date: 7 January 2015

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2908

zbMATH Keywords

fair divisioncake cutting algorithmscontrolled cake eating algorithmmarket equilibrium algorithmmixed constrained serial dictatorship

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (12)

Truthful fair division without free disposal ⋮ Ordinal Maximin Share Approximation for Goods ⋮ Fair cake-cutting for imitative agents ⋮ Fairly taking turns ⋮ On existence of truthful fair cake cutting mechanisms ⋮ Resource-monotonicity and population-monotonicity in connected cake-cutting ⋮ Expand the shares together: envy-free mechanisms with a small number of cuts ⋮ Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts ⋮ Monotonicity and competitive equilibrium in cake-cutting ⋮ Fair and efficient cake division with connected pieces ⋮ Obvious manipulations in cake-cutting ⋮ Computing Large Market Equilibria Using Abstractions

This page was built for publication: Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations