A bounded and envy-free cake cutting algorithm-Reference-Cited by-同舟云学术

A bounded and envy-free cake cutting algorithm

Published:2020-03-20 Issue:4 Volume:63 Page:119-126
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Aziz Haris¹,Mackenzie Simon²

Affiliation:

1. UNSW Sydney, Australia

2. CSIRO Data61, Sydney, Australia

Abstract

We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation of a divisible resource based on queries from agents. The problem has received attention in mathematics, economics, and computer science. It has been a major open problem whether there exists a discrete and bounded envy-free protocol. We report on our algorithm that resolved the open problem.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3382129

Reference9 articles.

1. A discrete and bounded envy-free cake cutting protocol for four agents

2. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

3. An Envy-Free Cake Division Protocol

4. Fair Division

5. Envy-free Chore Division for An Arbitrary Number of Agents

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Envy-Free Cake-Cutting for Four Agents;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Thou shalt covet the average of thy neighbors' cakes;Information Processing Letters;2023-02

3. Cutting the Cake into Crumbs: Verifying Envy-Free Cake-Cutting Protocols Using Bounded Integer Arithmetic;Lecture Notes in Computer Science;2023

4. Crises, Risks and Sacrifices;The Rise of Artificial Intelligence and Big Data in Pandemic Society;2022

5. Playing Divide-and-Choose Given Uncertain Preferences;SSRN Electronic Journal;2022