How to Make Envy Vanish Over Time-Reference-Cited by-同舟云学术

How to Make Envy Vanish Over Time

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

Author:

Benade Gerdus¹,Kazachkov Aleksandr M.¹,Procaccia Ariel D.¹,Psomas Christos-Alexandros¹

Affiliation:

1. Carnegie Mellon University, Pittsburgh, PA, USA

Funder

Office of Naval Research

John Simon Guggenheim Memorial Foundation

National Science Foundation

Alfred P. Sloan Foundation

Publisher

ACM

Link

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

Reference20 articles.

1. M. Aleksandrov H. Aziz S. Gaspers and T. Walsh. 2015. Online Fair Division: Analysing a Food Bank Problem Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI). 2540--2546. M. Aleksandrov H. Aziz S. Gaspers and T. Walsh. 2015. Online Fair Division: Analysing a Food Bank Problem Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI). 2540--2546.

2. On the power of randomization in on-line algorithms

3. S. Bernstein. 1946. The Theory of Probabilities. Gastehizdat Publishing House. S. Bernstein. 1946. The Theory of Probabilities. Gastehizdat Publishing House.

4. Fair Division

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

1. Sequential Fair Resource Allocation under a Markov Decision Process Framework;4th ACM International Conference on AI in Finance;2023-11-25

2. Fair and Efficient Online Allocations;Operations Research;2023-11-03

3. Fair division of indivisible goods: Recent progress and open questions;Artificial Intelligence;2023-09

4. Enabling Long-term Fairness in Dynamic Resource Allocation;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2022-12

5. Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Trade-off Curve;Operations Research;2022-11-23