For Hebrew publications click here.

Journals and book-chapters

  1. "Fair and Square - Cake-Cutting in Two Dimensions": Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann.      Journal of Mathematical Economics (JME), 2016, 70 pages 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
  2. "Demand-Flow of Agents with Gross-Substitute Valuations ": Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann.      Operations Research Letters, 2016, pages 757-760.     (Full version)
  3. "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 (TALG), 2016, pages 12:1-12:32. Preliminary versions: AAMAS 2015 and arXiv 2016. → Presentation
  4. "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
  5. "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. "Fair Allocation based on Diminishing Differences": Erel Segal-Halevi, Avinatan Hassidim, Haris Aziz.      Accepted to IJCAI-2017.
  2. "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
  3. "Envy-Free Cake-Cutting in Two Dimensions": Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann.      Published in AAAI 2015 conference (8 pages) and much improved in the working paper (42 pages). Extensions and improvements are welcome. → Presentation
  4. "PLIS: a Probabilistic Lexical Inference System ": Eyal Shnarch, Erel Segal-haLevi, Jacob Goldberger, Ido Dagan.      Published in ACL 2013 conference (6 pages)
  5. "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. "Resource-monotonicity and Population-monotonicity in Cake-cutting": Erel Segal-Halevi, Balázs Sziklai.      Presented in GAM-SOC 2015, SCW 2016 and GAMES 2016. 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. "Cutting a Cake with both Good and Bad Parts": Erel Segal-Halevi.      Working paper shows full solution for 3 agents; looking for ideas for extending to 4 or more agents.
  2. "On Level-1 Consensus Ensuring Stable Social Choice ": Mor Nitzan, Shmuel Nitzan, Erel Segal-Halevi.      Major revision for Social Choice and Welfare. Working paper in arXiv.
  3. "Resource-monotonicity and Population-monotonicity in Connected Cake-cutting": Erel Segal-Halevi, Balázs Sziklai.      Working paper.
  4. "Concentration Inequalities for Random Sets": Erel Segal-Halevi, Avinatan Hassidim..      Working paper.
  5. "A Tradeoff between Fairness and Efficiency in Cake-cutting": Erel Segal-Halevi.      Working paper contains some initial ideas (13 pages); collaborators are welcome.
  6. "Cutting a Cake without Harming the Toppings": Arseniy Akopyan, Erel Segal-Halevi.      Working paper.
  7. "MIDA: a Multi Item-type Double Auction Mechanism ": Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann.      Working paper → Presentation
  8. "How to re-divide a cake fairly": Erel Segal-Halevi.      Working paper; collaborators are welcome.
  9. "Fair Cake-cutting among Families": Erel Segal-Halevi, Shmuel Nitzan.      Working paper summarizes some simple results; extensions and improvements are welcome.


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