An Improved Envy-Free Cake Cutting Protocol for Four Agents-Reference-Cited by-同舟云学术

An Improved Envy-Free Cake Cutting Protocol for Four Agents

Published:2018 Issue: Volume: Page:87-99
ISSN:0302-9743
Container-title:Algorithmic Game Theory
language:
Short-container-title:

Author:

Amanatidis Georgios,Christodoulou George,Fearnley John,Markakis Evangelos,Psomas Christos-Alexandros,Vakaliou Eftychia

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-99660-8_9

Reference19 articles.

1. Amanatidis, G., Christodoulou, G., Fearnley, J., Markakis, E., Psomas, C.A., Vakaliou, E.: An improved envy-free cake cutting protocol for four agents (2018). https://arxiv.org/pdf/1807.00317.pdf

2. Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016, pp. 416–427 (2016)

3. Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for four agents. In: 48th ACM Symposium on the Theory of Computing, STOC 2016, pp. 454–464 (2016)

4. Lecture Notes in Computer Science;H Aziz,2014

5. Brams, S.J., Taylor, A.D.: An envy-free cake division protocol. Am. Math. Monthly 102(1), 9–18 (1995)

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

1. A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees;Web and Internet Economics;2023-12-31

2. Two's company, three's a crowd: Consensus-halving for a constant number of agents;Artificial Intelligence;2022-12

3. Fair cake-cutting in practice;Games and Economic Behavior;2022-05

4. Three Persons, Two Cuts: A New Cake-Cutting Algorithm;Mathematics Magazine;2022-01-28

5. Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents;Proceedings of the 22nd ACM Conference on Economics and Computation;2021-07-18