Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
349 | Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy |
Cake-Cutting Is Not a Piece of Cake. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 596-607, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
130 | Jeff Edmonds, Kirk Pruhs |
Cake cutting really is not a piece of cake. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 271-278, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
94 | Jirí Sgall, Gerhard J. Woeginger |
An Approximation Scheme For Cake Division With A Linear Number Of Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(2), pp. 205-211, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68W25, 90C27 |
94 | Gerhard J. Woeginger |
An Approximation Scheme for Cake Division with a Linear Number of Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 896-901, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
77 | Sven Oliver Krumke, Maarten Lipmann, Willem de Paepe, Diana Poensgen, Jörg Rambau, Leen Stougie, Gerhard J. Woeginger |
How to cut a cake almost fairly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 263-264, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
75 | Peter Kern, Daniel Neugebauer, Jörg Rothe, René L. Schilling, Dietrich Stoyan, Robin Weishaupt |
Cutting a Cake Is Not Always a "Piece of Cake": A Closer Look at the Foundations of Cake-Cutting Through the Lens of Measure Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.05402, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
72 | Ivona Bezáková, Varsha Dani |
Allocating indivisible goods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGecom Exch. ![In: SIGecom Exch. 5(3), pp. 11-18, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
cake-cutting, algorithms, approximation algorithms, game theory, fairness, theory, economics, truthfulness |
70 | Jirí Sgall, Gerhard J. Woeginger |
A Lower Bound for Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 459-469, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
57 | Martin Mariusz Lester |
Cutting the Cake into Crumbs: Verifying Envy-Free Cake-Cutting Protocols Using Bounded Integer Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages - 26th International Symposium, PADL 2024, London, UK, January 15-16, 2024, Proceedings, pp. 100-115, 2024, Springer, 978-3-031-52037-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
57 | Haris Aziz 0001, Chun Ye |
New Cake Cutting Algorithms: a Random Assignment Approach to Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1307.2908, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
46 | Orit Arzi, Yonatan Aumann, Yair Dombb |
Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soc. Choice Welf. ![In: Soc. Choice Welf. 46(4), pp. 933-954, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
46 | Jeff Edmonds, Kirk Pruhs |
Cake cutting really is not a piece of cake. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 7(4), pp. 51:1-51:12, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
42 | Karthik Iyer, Michael N. Huhns |
Multiagent Negotiation for Fair and Unbiased Resource Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OTM Conferences (1) ![In: On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE, OTM Confederated International Conferences CoopIS, DOA, and ODBASE 2005, Agia Napa, Cyprus, October 31 - November 4, 2005, Proceedings, Part I, pp. 453-465, 2005, Springer, 3-540-29736-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Yoshifumi Manabe, Tatsuaki Okamoto |
Meta-envy-free Cake-cutting and Pie-cutting Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. ![In: J. Inf. Process. 20(3), pp. 686-693, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
28 | Simina Brânzei, MohammadTaghi Hajiaghayi, Reed Phillips, Suho Shin, Kun Wang |
Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.08547, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
28 | Xiaolin Bu, Jiaxin Song, Biaoshuai Tao |
On existence of truthful fair cake cutting mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 319, pp. 103904, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Sheung Man Yuen, Warut Suksompong |
Approximate Envy-Freeness in Graphical Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.11659, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Georgy Sokolov |
An Exponential Envy-Free Cake Cutting Protocol for n Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.03854, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Zsuzsanna Jankó, Attila Joó, Erel Segal-Halevi |
On Connected Strongly-Proportional Cake-Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.15326, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Alexandros Hollender, Aviad Rubinstein |
Envy-Free Cake-Cutting for Four Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.02075, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Alexandros Hollender, Aviad Rubinstein |
Envy-Free Cake-Cutting for Four Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pp. 113-122, 2023, IEEE, 979-8-3503-1894-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Ganesh Ghalme, Xin Huang, Yuka Machino, Nidhi Rathi |
A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Web and Internet Economics - 19th International Conference, WINE 2023, Shanghai, China, December 4-8, 2023, Proceedings, pp. 310-328, 2023, Springer, 978-3-031-48973-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Xiaolin Bu, Jiaxin Song |
Maximize Egalitarian Welfare for Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJTCS-FAW ![In: Frontiers of Algorithmics - 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023, Proceedings, pp. 263-280, 2023, Springer, 978-3-031-39343-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Ankang Sun, Bo Li 0037 |
On the Price of Fairness in the Connected Discrete Cake Cutting Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023), pp. 2242-2249, 2023, IOS Press, 978-1-64368-436-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Sheung Man Yuen, Warut Suksompong |
Approximate Envy-Freeness in Graphical Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pp. 2923-2930, 2023, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Josué Ortega, Erel Segal-Halevi |
Obvious manipulations in cake-cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soc. Choice Welf. ![In: Soc. Choice Welf. 59(4), pp. 969-988, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Eleonora Cresto, Diego Tajer |
Fair cake-cutting for imitative agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soc. Choice Welf. ![In: Soc. Choice Welf. 58(4), pp. 801-833, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Edith Elkind, Erel Segal-Halevi, Warut Suksompong |
Mind the gap: Cake cutting with separation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 313, pp. 103783, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Ioannis Caragiannis, Vasilis Gkatzelis, Alexandros Psomas 0001, Daniel Schoepflin 0001 |
Beyond Cake Cutting: Allocating Homogeneous Divisible Goods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.04662, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
28 | |
Envy-Free Cake Cutting with Graph Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.12559, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Ganesh Ghalme, Xin Huang, Yuka Machino, Nidhi Rathi |
A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.06458, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Maria Kyropoulou, Josué Ortega, Erel Segal-Halevi |
Fair cake-cutting in practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Games Econ. Behav. ![In: Games Econ. Behav. 133, pp. 28-49, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Biaoshuai Tao |
On Existence of Truthful Fair Cake Cutting Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11 - 15, 2022, pp. 404-434, 2022, ACM, 978-1-4503-9150-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Simina Brânzei, Noam Nisan |
The Query Complexity of Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022., 2022, 9781713871088. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
28 | Ioannis Caragiannis, Vasilis Gkatzelis, Alexandros Psomas 0001, Daniel Schoepflin 0001 |
Beyond Cake Cutting: Allocating Homogeneous Divisible Goods. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, Auckland, New Zealand, May 9-13, 2022, pp. 208-216, 2022, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 978-1-4503-9213-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
28 | Itay Shtechman, Rica Gonen, Erel Segal-Halevi |
Fair cake-cutting algorithms with real land-value data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Auton. Agents Multi Agent Syst. ![In: Auton. Agents Multi Agent Syst. 35(2), pp. 39, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
28 | Paul W. Goldberg, Ioana Iaru |
Equivalence of Models of Cake-Cutting Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.03641, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
28 | Edith Elkind, Erel Segal-Halevi, Warut Suksompong |
Graphical Cake Cutting via Maximin Share. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.04755, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
28 | Biaoshuai Tao |
On Existence of Truthful Fair Cake Cutting Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.07387, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
28 | Erel Segal-Halevi |
Fair multi-cake cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 291, pp. 15-35, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
28 | Takao Asano |
Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan., pp. 68:1-68:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-214-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
28 | Edith Elkind, Erel Segal-Halevi, Warut Suksompong |
Mind the Gap: Cake Cutting With Separation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pp. 5330-5338, 2021, AAAI Press, 978-1-57735-866-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
28 | Edith Elkind, Erel Segal-Halevi, Warut Suksompong |
Graphical Cake Cutting via Maximin Share. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021., pp. 161-167, 2021, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
28 | Ágnes Cseh, Tamás Fleiner |
The Complexity of Cake Cutting with Unequal Shares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 16(3), pp. 29:1-29:21, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Paul W. Goldberg, Alexandros Hollender, Warut Suksompong |
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 69, pp. 109-141, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Simina Brânzei, Dimitris Paparas, Nicholas J. Recker |
Searching, Sorting, and Cake Cutting in Rounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2012.00738, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
28 | Bhavook Bhardwaj, Rajnish Kumar, Josue Ortega |
Fairness and Efficiency in Cake-Cutting with Single-Peaked Preferences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.03174, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
28 | Guillaume Chèze |
Envy-free cake cutting: A polynomial number of queries with high probability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.01982, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
28 | Hadi Hosseini, Ayumi Igarashi 0001, Andrew Searns |
Fair Division of Time: Multi-layered Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.13397, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
28 | Edith Elkind, Erel Segal-Halevi, Warut Suksompong |
Mind the Gap: Cake Cutting With Separation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2012.06682, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
28 | Haris Aziz 0001, Simon Mackenzie |
A bounded and envy-free cake cutting algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 63(4), pp. 119-126, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Takao Asano, Hiroyuki Umeda |
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 15:1-15:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Xiaohui Bei, Xiaoming Sun 0001, Hao Wu, Jialin Zhang 0001, Zhijie Zhang, Wei Zi |
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp. 2114-2123, 2020, SIAM, 978-1-61197-599-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Paul W. Goldberg, Alexandros Hollender, Warut Suksompong |
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020., pp. 1990-1997, 2020, AAAI Press, 978-1-57735-823-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Hadi Hosseini, Ayumi Igarashi 0001, Andrew Searns |
Fair Division of Time: Multi-layered Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 182-188, 2020, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
28 | Itay Shtechman, Rica Gonen, Erel Segal-Halevi |
Fair Cake-Cutting Algorithms with Real Land-Value Data. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS '20, Auckland, New Zealand, May 9-13, 2020, pp. 2005-2007, 2020, International Foundation for Autonomous Agents and Multiagent Systems, 978-1-4503-7518-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
28 | Erel Segal-Halevi, Shmuel Nitzan |
Fair cake-cutting among families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soc. Choice Welf. ![In: Soc. Choice Welf. 53(4), pp. 709-740, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Guillaume Chèze |
Cake cutting: Explicit examples for impossibility results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.04810, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
28 | Paul W. Goldberg, Alexandros Hollender, Warut Suksompong |
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.05416, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
28 | Xiaohui Bei, Xiaoming Sun 0001, Hao Wu, Jialin Zhang 0001, Zhijie Zhang, Wei Zi |
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.05083, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
28 | Josue Ortega |
Obvious Manipulations in Cake-Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1908.02988, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
28 | Guillaume Chèze |
Cake cutting: Explicit examples for impossibility results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Soc. Sci. ![In: Math. Soc. Sci. 102, pp. 68-72, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Wen-Kai Yu |
Super Sub-Nyquist Single-Pixel Imaging by Means of Cake-Cutting Hadamard Basis Sort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sensors ![In: Sensors 19(19), pp. 4122, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Maria Kyropoulou, Josué Ortega, Erel Segal-Halevi |
Fair Cake-Cutting in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, Phoenix, AZ, USA, June 24-28, 2019., pp. 547-548, 2019, ACM, 978-1-4503-6792-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Simina Brânzei, Noam Nisan |
Communication Complexity of Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, Phoenix, AZ, USA, June 24-28, 2019., pp. 525, 2019, ACM, 978-1-4503-6792-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Dávid Csercsik, Balázs R. Sziklai, Sándor Imre |
Cake-cutting approach for privacy-enhanced base station sharing in a linear model of user assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISWCS ![In: 16th International Symposium on Wireless Communication Systems, ISWCS 2019, Oulu, Finland, August 27-30, 2019, pp. 618-623, 2019, IEEE, 978-1-7281-2527-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Chenhao Wang 0001, Xiaoying Wu |
Cake Cutting with Single-Peaked Valuations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings, pp. 507-516, 2019, Springer, 978-3-030-36411-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Takamasa Ihara, Shunsuke Tsuruta, Taiki Todo, Yuko Sakurai, Makoto Yokoo |
Strategy-proof Cake Cutting Mechanisms for All-or-nothing Utility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 158(1-3), pp. 41-61, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
28 | Eshwar Ram Arunachaleswaran, Ragavendran Gopalakrishnan |
The Price of Indivisibility in Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1801.08341, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
28 | Georgios Amanatidis, George Christodoulou 0001, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou |
An Improved Envy-Free Cake Cutting Protocol for Four Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.00317, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
28 | Maria Kyropoulou, Josue Ortega, Erel Segal-Halevi |
Fair Cake-Cutting in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1810.08243, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
28 | Erel Segal-Halevi |
Cake-Cutting with Different Entitlements: How Many Cuts are Needed? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.05470, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
28 | Erel Segal-Halevi, Balázs R. Sziklai |
Resource-monotonicity and population-monotonicity in connected cake-cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Soc. Sci. ![In: Math. Soc. Sci. 95, pp. 19-30, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
28 | Ágnes Cseh, Tamás Fleiner |
The Complexity of Cake Cutting with Unequal Shares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory - 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018, Proceedings, pp. 19-30, 2018, Springer, 978-3-319-99659-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
28 | Georgios Amanatidis, George Christodoulou 0001, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou |
An Improved Envy-Free Cake Cutting Protocol for Four Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory - 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018, Proceedings, pp. 87-99, 2018, Springer, 978-3-319-99659-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
28 | Omer Tamuz, Shai Vardi, Juba Ziani |
Non-Exploitable Protocols for Repeated Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018, pp. 1226-1233, 2018, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
28 | Haris Aziz 0001, Simon Mackenzie |
Bounded and envy-free cake cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGecom Exch. ![In: SIGecom Exch. 15(2), pp. 30-33, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
28 | Simina Brânzei, Noam Nisan |
Communication Complexity of Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1709.09876, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
28 | Ágnes Cseh, Tamás Fleiner |
The complexity of cake cutting with unequal shares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1709.03152, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
28 | Simina Brânzei, Noam Nisan |
The Query Complexity of Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.02946, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
28 | Erel Segal-Halevi, Balázs R. Sziklai |
Resource-monotonicity and Population-monotonicity in Connected Cake-cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.08928, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
28 | Vijay Menon 0001, Kate Larson |
Deterministic, Strategyproof, and Fair Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.06306, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
28 | Xiaohui Bei, Youming Qiao, Shengyu Zhang 0002 |
Networked Fairness in Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1707.02033, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
28 | Ariel D. Procaccia, Junxing Wang |
A Lower Bound for Equitable Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC '17, Cambridge, MA, USA, June 26-30, 2017, pp. 479-495, 2017, ACM, 978-1-4503-4527-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
28 | Xiaohui Bei, Ning Chen 0005, Guangda Huzhang, Biaoshuai Tao, Jiajun Wu 0003 |
Cake Cutting: Envy and Truth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pp. 3625-3631, 2017, ijcai.org, 978-0-9992411-0-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
28 | Vijay Menon 0001, Kate Larson |
Deterministic, Strategyproof, and Fair Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pp. 352-358, 2017, ijcai.org, 978-0-9992411-0-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
28 | Xiaohui Bei, Youming Qiao, Shengyu Zhang 0002 |
Networked Fairness in Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pp. 3632-3638, 2017, ijcai.org, 978-0-9992411-0-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
28 | Simon Mackenzie |
Upper bounds for cake cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2017 |
RDF |
|
28 | Ariel D. Procaccia |
Cake Cutting Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computational Social Choice ![In: Handbook of Computational Social Choice, pp. 311-330, 2016, Cambridge University Press, 9781107446984. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Lê Nguyên Hoang, François Soumis, Georges Zaccour |
A heuristic optimization of Bayesian incentive-compatible cake-cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 75, pp. 76-82, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann |
Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 13(1), pp. 12:1-12:32, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann |
Envy-Free Cake-Cutting in Two Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1609.03938, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
28 | Haris Aziz 0001, Simon Mackenzie |
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1604.03655, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
28 | |
Envy-Free Cake-Cutting among Families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1607.01517, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
28 | René L. Schilling, Dietrich Stoyan |
Continuity Assumptions in Cake-Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.04988, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
28 | Claudia Lindner 0001, Jörg Rothe |
Cake-Cutting: Fair Division of Divisible Goods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Economics and Computation ![In: Economics and Computation, An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, pp. 395-491, 2016, Springer, 978-3-662-47903-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Haris Aziz 0001, Simon Mackenzie |
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 416-427, 2016, IEEE Computer Society, 978-1-5090-3933-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Haris Aziz 0001, Simon Mackenzie |
A discrete and bounded envy-free cake cutting protocol for four agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pp. 454-464, 2016, ACM, 978-1-4503-4132-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Hiro Ito, Takahiro Ueda |
How to Solve the Cake-Cutting Problem in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FUN ![In: 8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy, pp. 21:1-21:15, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-005-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Simina Brânzei |
A note on envy-free cake cutting with polynomial valuations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 115(2), pp. 93-95, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|