Author:
Arunachaleswaran Eshwar Ram,Barman Siddharth,Kumar Rachitesh,Rathi Nidhi
Publisher
Springer International Publishing
Reference31 articles.
1. Adjusted winner. http://www.nyu.edu/projects/adjustedwinner/ . Accessed 07 July 2019
2. Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. J. Comput. Syst. Sci. 58(1), 193–210 (1999)
3. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM (JACM) 45(3), 501–555 (1998)
4. Arunachaleswaran, E.R., Barman, S., Kumar, R., Rathi, N.: Fair and efficient cake division with connected pieces. CoRR abs/1907.11019 (2019). http://arxiv.org/abs/1907.11019
5. Lecture Notes in Computer Science;Y Aumann,2010
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees;Web and Internet Economics;2023-12-31
2. Envy-Free Cake-Cutting for Four Agents;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Consensus-Halving: Does It Ever Get Easier?;SIAM Journal on Computing;2023-04-04
4. Mind the gap: Cake cutting with separation;Artificial Intelligence;2022-12
5. Fair Cake Division Under Monotone Likelihood Ratios;Mathematics of Operations Research;2021-12-16