| 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.  |
STACS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 130 | Jeff Edmonds, Kirk Pruhs |
Cake cutting really is not a piece of cake. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 94 | Jirí Sgall, Gerhard J. Woeginger |
An Approximation Scheme For Cake Division With A Linear Number Of Cuts. |
Comb. |
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. |
ESA |
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. |
SODA |
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. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 72 | Ivona Bezáková, Varsha Dani |
Allocating indivisible goods. |
SIGecom Exch. |
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. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 57 | Martin Mariusz Lester |
Cutting the Cake into Crumbs: Verifying Envy-Free Cake-Cutting Protocols Using Bounded Integer Arithmetic. |
PADL |
2024 |
DBLP DOI BibTeX RDF |
|
| 57 | Haris Aziz 0001, Chun Ye |
New Cake Cutting Algorithms: a Random Assignment Approach to Cake Cutting. |
CoRR |
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. |
Soc. Choice Welf. |
2016 |
DBLP DOI BibTeX RDF |
|
| 46 | Jeff Edmonds, Kirk Pruhs |
Cake cutting really is not a piece of cake. |
ACM Trans. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 42 | Karthik Iyer, Michael N. Huhns |
Multiagent Negotiation for Fair and Unbiased Resource Allocation. |
OTM Conferences (1) |
2005 |
DBLP DOI BibTeX RDF |
|
| 39 | Yoshifumi Manabe, Tatsuaki Okamoto |
Meta-envy-free Cake-cutting and Pie-cutting Protocols. |
J. Inf. Process. |
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. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
| 28 | Xiaolin Bu, Jiaxin Song, Biaoshuai Tao |
On existence of truthful fair cake cutting mechanisms. |
Artif. Intell. |
2023 |
DBLP DOI BibTeX RDF |
|
| 28 | Sheung Man Yuen, Warut Suksompong |
Approximate Envy-Freeness in Graphical Cake Cutting. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 28 | Georgy Sokolov |
An Exponential Envy-Free Cake Cutting Protocol for n Agents. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 28 | Zsuzsanna Jankó, Attila Joó, Erel Segal-Halevi |
On Connected Strongly-Proportional Cake-Cutting. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 28 | Alexandros Hollender, Aviad Rubinstein |
Envy-Free Cake-Cutting for Four Agents. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 28 | Alexandros Hollender, Aviad Rubinstein |
Envy-Free Cake-Cutting for Four Agents. |
FOCS |
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. |
WINE |
2023 |
DBLP DOI BibTeX RDF |
|
| 28 | Xiaolin Bu, Jiaxin Song |
Maximize Egalitarian Welfare for Cake Cutting. |
IJTCS-FAW |
2023 |
DBLP DOI BibTeX RDF |
|
| 28 | Ankang Sun, Bo Li 0037 |
On the Price of Fairness in the Connected Discrete Cake Cutting Problem. |
ECAI |
2023 |
DBLP DOI BibTeX RDF |
|
| 28 | Sheung Man Yuen, Warut Suksompong |
Approximate Envy-Freeness in Graphical Cake Cutting. |
IJCAI |
2023 |
DBLP DOI BibTeX RDF |
|
| 28 | Josué Ortega, Erel Segal-Halevi |
Obvious manipulations in cake-cutting. |
Soc. Choice Welf. |
2022 |
DBLP DOI BibTeX RDF |
|
| 28 | Eleonora Cresto, Diego Tajer |
Fair cake-cutting for imitative agents. |
Soc. Choice Welf. |
2022 |
DBLP DOI BibTeX RDF |
|
| 28 | Edith Elkind, Erel Segal-Halevi, Warut Suksompong |
Mind the gap: Cake cutting with separation. |
Artif. Intell. |
2022 |
DBLP DOI BibTeX RDF |
|
| 28 | Ioannis Caragiannis, Vasilis Gkatzelis, Alexandros Psomas 0001, Daniel Schoepflin 0001 |
Beyond Cake Cutting: Allocating Homogeneous Divisible Goods. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
| 28 | |
Envy-Free Cake Cutting with Graph Constraints. |
CoRR |
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. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 28 | Maria Kyropoulou, Josué Ortega, Erel Segal-Halevi |
Fair cake-cutting in practice. |
Games Econ. Behav. |
2022 |
DBLP DOI BibTeX RDF |
|
| 28 | Biaoshuai Tao |
On Existence of Truthful Fair Cake Cutting Mechanisms. |
EC |
2022 |
DBLP DOI BibTeX RDF |
|
| 28 | Simina Brânzei, Noam Nisan |
The Query Complexity of Cake Cutting. |
NeurIPS |
2022 |
DBLP BibTeX RDF |
|
| 28 | Ioannis Caragiannis, Vasilis Gkatzelis, Alexandros Psomas 0001, Daniel Schoepflin 0001 |
Beyond Cake Cutting: Allocating Homogeneous Divisible Goods. (PDF / PS) |
AAMAS |
2022 |
DBLP BibTeX RDF |
|
| 28 | Itay Shtechman, Rica Gonen, Erel Segal-Halevi |
Fair cake-cutting algorithms with real land-value data. |
Auton. Agents Multi Agent Syst. |
2021 |
DBLP DOI BibTeX RDF |
|
| 28 | Paul W. Goldberg, Ioana Iaru |
Equivalence of Models of Cake-Cutting Protocols. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 28 | Edith Elkind, Erel Segal-Halevi, Warut Suksompong |
Graphical Cake Cutting via Maximin Share. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 28 | Biaoshuai Tao |
On Existence of Truthful Fair Cake Cutting Mechanisms. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 28 | Erel Segal-Halevi |
Fair multi-cake cutting. |
Discret. Appl. Math. |
2021 |
DBLP DOI BibTeX RDF |
|
| 28 | Takao Asano |
Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts. |
ISAAC |
2021 |
DBLP DOI BibTeX RDF |
|
| 28 | Edith Elkind, Erel Segal-Halevi, Warut Suksompong |
Mind the Gap: Cake Cutting With Separation. |
AAAI |
2021 |
DBLP DOI BibTeX RDF |
|
| 28 | Edith Elkind, Erel Segal-Halevi, Warut Suksompong |
Graphical Cake Cutting via Maximin Share. |
IJCAI |
2021 |
DBLP DOI BibTeX RDF |
|
| 28 | Ágnes Cseh, Tamás Fleiner |
The Complexity of Cake Cutting with Unequal Shares. |
ACM Trans. Algorithms |
2020 |
DBLP DOI BibTeX RDF |
|
| 28 | Paul W. Goldberg, Alexandros Hollender, Warut Suksompong |
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. |
J. Artif. Intell. Res. |
2020 |
DBLP DOI BibTeX RDF |
|
| 28 | Simina Brânzei, Dimitris Paparas, Nicholas J. Recker |
Searching, Sorting, and Cake Cutting in Rounds. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 28 | Bhavook Bhardwaj, Rajnish Kumar, Josue Ortega |
Fairness and Efficiency in Cake-Cutting with Single-Peaked Preferences. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 28 | Guillaume Chèze |
Envy-free cake cutting: A polynomial number of queries with high probability. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 28 | Hadi Hosseini, Ayumi Igarashi 0001, Andrew Searns |
Fair Division of Time: Multi-layered Cake Cutting. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 28 | Edith Elkind, Erel Segal-Halevi, Warut Suksompong |
Mind the Gap: Cake Cutting With Separation. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 28 | Haris Aziz 0001, Simon Mackenzie |
A bounded and envy-free cake cutting algorithm. |
Commun. ACM |
2020 |
DBLP DOI BibTeX RDF |
|
| 28 | Takao Asano, Hiroyuki Umeda |
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. |
ISAAC |
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. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
| 28 | Paul W. Goldberg, Alexandros Hollender, Warut Suksompong |
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. |
AAAI |
2020 |
DBLP DOI BibTeX RDF |
|
| 28 | Hadi Hosseini, Ayumi Igarashi 0001, Andrew Searns |
Fair Division of Time: Multi-layered Cake Cutting. |
IJCAI |
2020 |
DBLP DOI BibTeX RDF |
|
| 28 | Itay Shtechman, Rica Gonen, Erel Segal-Halevi |
Fair Cake-Cutting Algorithms with Real Land-Value Data. (PDF / PS) |
AAMAS |
2020 |
DBLP BibTeX RDF |
|
| 28 | Erel Segal-Halevi, Shmuel Nitzan |
Fair cake-cutting among families. |
Soc. Choice Welf. |
2019 |
DBLP DOI BibTeX RDF |
|
| 28 | Guillaume Chèze |
Cake cutting: Explicit examples for impossibility results. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 28 | Paul W. Goldberg, Alexandros Hollender, Warut Suksompong |
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. |
CoRR |
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. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 28 | Josue Ortega |
Obvious Manipulations in Cake-Cutting. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 28 | Guillaume Chèze |
Cake cutting: Explicit examples for impossibility results. |
Math. Soc. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
| 28 | Wen-Kai Yu |
Super Sub-Nyquist Single-Pixel Imaging by Means of Cake-Cutting Hadamard Basis Sort. |
Sensors |
2019 |
DBLP DOI BibTeX RDF |
|
| 28 | Maria Kyropoulou, Josué Ortega, Erel Segal-Halevi |
Fair Cake-Cutting in Practice. |
EC |
2019 |
DBLP DOI BibTeX RDF |
|
| 28 | Simina Brânzei, Noam Nisan |
Communication Complexity of Cake Cutting. |
EC |
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. |
ISWCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 28 | Chenhao Wang 0001, Xiaoying Wu |
Cake Cutting with Single-Peaked Valuations. |
COCOA |
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. |
Fundam. Informaticae |
2018 |
DBLP DOI BibTeX RDF |
|
| 28 | Eshwar Ram Arunachaleswaran, Ragavendran Gopalakrishnan |
The Price of Indivisibility in Cake Cutting. |
CoRR |
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. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 28 | Maria Kyropoulou, Josue Ortega, Erel Segal-Halevi |
Fair Cake-Cutting in Practice. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 28 | Erel Segal-Halevi |
Cake-Cutting with Different Entitlements: How Many Cuts are Needed? |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 28 | Erel Segal-Halevi, Balázs R. Sziklai |
Resource-monotonicity and population-monotonicity in connected cake-cutting. |
Math. Soc. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
| 28 | Ágnes Cseh, Tamás Fleiner |
The Complexity of Cake Cutting with Unequal Shares. |
SAGT |
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. |
SAGT |
2018 |
DBLP DOI BibTeX RDF |
|
| 28 | Omer Tamuz, Shai Vardi, Juba Ziani |
Non-Exploitable Protocols for Repeated Cake Cutting. |
AAAI |
2018 |
DBLP DOI BibTeX RDF |
|
| 28 | Haris Aziz 0001, Simon Mackenzie |
Bounded and envy-free cake cutting. |
SIGecom Exch. |
2017 |
DBLP DOI BibTeX RDF |
|
| 28 | Simina Brânzei, Noam Nisan |
Communication Complexity of Cake Cutting. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
| 28 | Ágnes Cseh, Tamás Fleiner |
The complexity of cake cutting with unequal shares. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
| 28 | Simina Brânzei, Noam Nisan |
The Query Complexity of Cake Cutting. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
| 28 | Erel Segal-Halevi, Balázs R. Sziklai |
Resource-monotonicity and Population-monotonicity in Connected Cake-cutting. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
| 28 | Vijay Menon 0001, Kate Larson |
Deterministic, Strategyproof, and Fair Cake Cutting. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
| 28 | Xiaohui Bei, Youming Qiao, Shengyu Zhang 0002 |
Networked Fairness in Cake Cutting. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
| 28 | Ariel D. Procaccia, Junxing Wang |
A Lower Bound for Equitable Cake Cutting. |
EC |
2017 |
DBLP DOI BibTeX RDF |
|
| 28 | Xiaohui Bei, Ning Chen 0005, Guangda Huzhang, Biaoshuai Tao, Jiajun Wu 0003 |
Cake Cutting: Envy and Truth. |
IJCAI |
2017 |
DBLP DOI BibTeX RDF |
|
| 28 | Vijay Menon 0001, Kate Larson |
Deterministic, Strategyproof, and Fair Cake Cutting. |
IJCAI |
2017 |
DBLP DOI BibTeX RDF |
|
| 28 | Xiaohui Bei, Youming Qiao, Shengyu Zhang 0002 |
Networked Fairness in Cake Cutting. |
IJCAI |
2017 |
DBLP DOI BibTeX RDF |
|
| 28 | Simon Mackenzie |
Upper bounds for cake cutting. |
|
2017 |
RDF |
|
| 28 | Ariel D. Procaccia |
Cake Cutting Algorithms. |
Handbook of Computational Social Choice |
2016 |
DBLP DOI BibTeX RDF |
|
| 28 | Lê Nguyên Hoang, François Soumis, Georges Zaccour |
A heuristic optimization of Bayesian incentive-compatible cake-cutting. |
Comput. Oper. Res. |
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. |
ACM Trans. Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
| 28 | Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann |
Envy-Free Cake-Cutting in Two Dimensions. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
| 28 | Haris Aziz 0001, Simon Mackenzie |
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
| 28 | |
Envy-Free Cake-Cutting among Families. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
| 28 | René L. Schilling, Dietrich Stoyan |
Continuity Assumptions in Cake-Cutting. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
| 28 | Claudia Lindner 0001, Jörg Rothe |
Cake-Cutting: Fair Division of Divisible Goods. |
Economics and Computation |
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. |
FOCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 28 | Haris Aziz 0001, Simon Mackenzie |
A discrete and bounded envy-free cake cutting protocol for four agents. |
STOC |
2016 |
DBLP DOI BibTeX RDF |
|
| 28 | Hiro Ito, Takahiro Ueda |
How to Solve the Cake-Cutting Problem in Sublinear Time. |
FUN |
2016 |
DBLP DOI BibTeX RDF |
|
| 28 | Simina Brânzei |
A note on envy-free cake cutting with polynomial valuations. |
Inf. Process. Lett. |
2015 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license