For Hebrew publications click here.

Books

  1. "Fair Division of Land (Ph.D. Thesis)": Erel Segal-Halevi (supervised by Yonatan Aumann and Avinatan Hassidim).      Submitted version. → Presentation

Journals and book-chapters

  1. "How to Cut a Cake Fairly - A Generalization to Groups": Erel Segal-Halevi, Warut Suksompong.      American Mathematical Monthly 2021 (forthcoming) and arXiv 2020 (5 pages).
  2. "Obtaining Costly Unverifiable Valuations from a Single Agent (aka Making an Appraiser Work for You) ": Erel Segal-Halevi, Shani Alkobi, Tomer Sharbaf and David Sarne.      Journal of Autonomous Agents and Multiagent Systems 2020, 34(2):1–25. Preliminary versions: AAMAS 2019 and arXiv 2019.
  3. "Fair Multi-Cake Cutting": Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann.      Discrete Applied Mathematics 2020 (forthcoming) and arXiv 2020 (32 pages).
  4. "Envy-Free Division of Land": Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann.      Mathematics of Operations Research 2020 and arXiv 2019 (42 pages). Preliminary version: AAAI 2015 (8 pages). → Presentation
  5. "Fair Allocation based on Diminishing Differences": Erel Segal-Halevi, Avinatan Hassidim, Haris Aziz.      Journal of Artificial Intelligence Research 2020, 67:471–507. Preliminary versions: IJCAI 2017 pages 1254-1261 and arXiv 2019.
  6. "Competitive Equilibrium For almost All Incomes - Existence and Fairness": Erel Segal-Halevi.      Journal of Autonomous Agents and Multiagent Systems 2020, 34(26):1–50. Preliminary versions: AAMAS 2018 and arXiv 2020. → Presentation
  7. "Democratic Fair Allocation of Indivisible Goods": Erel Segal-Halevi, Warut Suksompong.      Artificial Intelligence 2019, 277(103167) and arXiv 2019. Preliminary version: IJCAI 2018.
  8. "Cake-Cutting with Different Entitlements -- How Many Cuts are Needed?": Erel Segal-Halevi.      Journal of Mathematical Analysis 2019, 123382 and arXiv 2019.
  9. "Fair Cake-cutting among Families": Erel Segal-Halevi, Shmuel Nitzan.      Social Choice and Welfare 2019, 53(4):709–740 and arXiv 2019. → Presentation
  10. "Counting Blanks in Polygonal Arrangements (Previously called "Cutting a Cake without Harming the Toppings").": Arseniy Akopyan, Erel Segal-Halevi.      SIAM Journal on Discrete Mathematics 2018, 32(3):2242–-2257 and arXiv 2018.
  11. "Resource-monotonicity and Population-monotonicity in Connected Cake-cutting": Erel Segal-Halevi, Balázs Sziklai.      Mathematical Social Sciences 2018, 95:19–30. Preliminary version: arXiv 2017.
  12. "Monotonicity and Competitive Equilibrium in Cake-cutting": Erel Segal-Halevi, Balázs Sziklai.      Economic Theory 2018, 68(2), 363–401. Preliminary version: arXiv 2018. → Presentation
  13. "Flexible level-1 consensus ensuring stable social choice: analysis and algorithms ": Mor Nitzan, Shmuel Nitzan, Erel Segal-Halevi.      Social Choice and Welfare 2017, 50(3):457–479. Preliminary version: arXiv 2017.
  14. "Fair and Square - Cake-Cutting in Two Dimensions": Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann.      Journal of Mathematical Economics 2017, 70:1–28. “The paper is now a full treatise on the subject, with enough material to fill three or four regular length articles” (–an anonymous reviewer). Preliminary versions: EuroCG 2016 (4 pages) and arXiv 2016 (54 pages). → Live demo → Presentation
  15. "Demand-Flow of Agents with Gross-Substitute Valuations ": Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann.      Operations Research Letters 2016, pages 757-760.     Full version
  16. "Waste Makes Haste - Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal": Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann.      ACM Transactions on Algorithms 2016, 12:1–32. Preliminary versions: AAMAS 2015 and arXiv 2016. → Presentation
  17. "NegoChat-A - a chat-based negotiation agent with bounded rationality": Avi Rosenfeld, Inon Zuckerman, Erel Segal-Halevi, Osnat Drein, Sarit Kraus.      Autonomous Agents and Multi-Agent Systems Journal, 2016, pages 60-81. → Live demo
  18. "First Steps in Chat-Based Negotiating Agents": Inon Zuckerman, Erel Segal-Halevi, Avi Rosenfeld, Sarit Kraus.      Next Frontier in Agent-based Complex Automated Negotiation, 2015, pages 89-109.

Refereed conferences

  1. "Strongly Budget Balanced Auctions for Multi-Sided Markets ": Rica Gonen, Erel Segal-Halevi.      AAAI 2020 and arXiv 2019.
  2. "Fair Cake Cutting in Practice": Maria Kyropoulou and Josue Ortega and Erel Segal-Halevi.      EC 2019 and arXiv 2019.
  3. "Double Auctions in Markets for Multiple Kinds of Goods ": Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann.      IJCAI 2018 and arXiv 2018. → Presentation
  4. "Redividing the Cake": Erel Segal-Halevi.      IJCAI 2018 and arXiv 2018. → Presentation
  5. "MUDA: a Truthful Multi Unit Double Auction Mechanism ": Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann.      AAAI 2018 and arXiv 2018. → Presentation
  6. "Fairly Dividing a Cake after Some Parts were Burnt in the Oven": Erel Segal-Halevi.      AAMAS 2018 and arXiv 2018. → Presentation
  7. "SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism ": Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann.      In International Symposium on Algorithmic Game Theory (SAGT) 2016, pages 260-272. “Simple but cute” (–an anonymous reviewer). Full version (14 pages). → Presentation
  8. "PLIS: a Probabilistic Lexical Inference System ": Eyal Shnarch, Erel Segal-haLevi, Jacob Goldberger, Ido Dagan.      Published in ACL 2013 conference (6 pages)
  9. "A Corpus Based Morphological Analyzer for Unvocalized Modern Hebrew": Alon Itai, Erel Segal-Halevi.      Published in Proceedings of Machine Translation for Semitic Languages: Issues and Approaches, Workshop at MT Summit IX (MT-SUMMIT-IX) 2003 (8 pages)

Other conferences

  1. "How to Charge Lightning ": Simina Branzei, Erel Segal-Halevi, Aviv Zohar.      Presented at Scaling Bitcoin 2017. Working paper. → Presentation
  2. "Dialog Natural Language Understanding using a Generic Textual Inference System": Erel Segal-Halevi, Ido Dagan.      Presented in ACLP speech processing conference 2013 (5 pages)

Other working papers

  1. "Generalized Rental Harmony": Erel Segal-Halevi.      arXiv 2020.
  2. "The Maximin Share Dominance Relation": Erel Segal-Halevi.      arXiv 2019.
  3. "Fair and Efficient Division among Families": Sophie Bade and Erel Segal-Halevi.      arXiv 2019.
  4. "Envy-Free Matchings in Bipartite Graphs": Elad Aigner-Horev and Erel Segal-Halevi.      arXiv 2019. → Presentation
  5. "Fair Division with Bounded Sharing": Erel Segal-Halevi.      arXiv 2019.
  6. "Efficient Fair Division with Minimal Sharing": Fedor Sandomirskiy and Erel Segal-Halevi.      arXiv 2019.
  7. "Concentration Inequalities for Random Sets": Erel Segal-Halevi, Avinatan Hassidim.      Working paper.
  8. "Truthful Bilateral Trade is Impossible even with Fixed Prices ": Erel Segal-Halevi, Avinatan Hassidim.      Working paper
  9. "Repeated Games with Risk Averse Players": Yonatan Aumann and Erel Segal-Halevi.      Working paper.

Patents

  1. "Calculating Connectivity, Social Proximity and Trust Level between Web Users": Tuvia Rosenthal, Erel Segal-Halevi, Erez Segal.      US Patent 20100010826