Controlled Dynamic Fair Division-Reference-Cited by-同舟云学术

Controlled Dynamic Fair Division

Published:2017-06-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2017 ACM Conference on Economics and Computation
language:
Short-container-title:

Author:

Friedman Eric¹,Psomas Christos-Alexandros²,Vardi Shai³

Affiliation:

1. ICSI & University of California, Berkeley, Berkeley, CA, USA

2. University of California, Berkeley, Berkeley, CA, USA

3. California Institute of Technology, Pasadena, CA, USA

Funder

National Science Foundation

A.G. Leventis Foundation

John Templeton Foundation

Publisher

ACM

Link

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

Reference46 articles.

1. Splitting necklaces

2. Haris Aziz and Simon Mackenzie. 2016. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. arXiv preprint arXiv:1604.03655 (2016). Haris Aziz and Simon Mackenzie. 2016. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. arXiv preprint arXiv:1604.03655 (2016).

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

4. Hierarchical scheduling for diverse datacenter workloads

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

1. Dynamic Multi-Resource Fair Allocation with Elastic Demands;Journal of Grid Computing;2024-02-27

2. Online Fair Allocation of Perishable Resources;SSRN Electronic Journal;2024

3. Incentives in Dominant Resource Fair Allocation Under Dynamic Demands;Lecture Notes in Computer Science;2024

4. Multiresource fair allocation with time window constraints;The Journal of Supercomputing;2023-04-22

5. Redividing the cake;Autonomous Agents and Multi-Agent Systems;2022-02-03