Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Bounded and envy-free cake cutting

Bounded and envy-free cake cutting Although a finite envy-free cake-cutting protocol has been known for more than twenty years, it had been open whether a protocol exists in which the number of steps taken by the protocol is bounded by a function of the number of agents. In this letter, we report on our recent results on discrete, bounded, and envy-free cake-cutting protocols. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

Bounded and envy-free cake cutting

ACM SIGecom Exchanges , Volume 15 (2): 4 – Feb 24, 2017

Loading next page...
 
/lp/association-for-computing-machinery/bounded-and-envy-free-cake-cutting-HnrWAImDtH
Publisher
Association for Computing Machinery
Copyright
Copyright © 2017 Authors
ISSN
1551-9031
eISSN
1551-9031
DOI
10.1145/3055589.3055593
Publisher site
See Article on Publisher Site

Abstract

Although a finite envy-free cake-cutting protocol has been known for more than twenty years, it had been open whether a protocol exists in which the number of steps taken by the protocol is bounded by a function of the number of agents. In this letter, we report on our recent results on discrete, bounded, and envy-free cake-cutting protocols.

Journal

ACM SIGecom ExchangesAssociation for Computing Machinery

Published: Feb 24, 2017

Keywords: computational complexity

References