Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDErel Segal-Halevi
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j12]Erel Segal-Halevi
:
Competitive equilibrium for almost all incomes: existence and fairness. Auton. Agents Multi Agent Syst. 34(1): 26 (2020)- [j11]Erel Segal-Halevi, Shani Alkoby, David Sarne:
Obtaining costly unverifiable valuations from a single agent. Auton. Agents Multi Agent Syst. 34(2): 46 (2020) - [j10]Erel Segal-Halevi, Avinatan Hassidim, Haris Aziz:
Fair Allocation with Diminishing Differences. J. Artif. Intell. Res. 67: 471-507 (2020) - [j9]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Division of Land. Math. Oper. Res. 45(3): 896-922 (2020) - [c17]Rica Gonen, Erel Segal-Halevi:
Strongly Budget Balanced Auctions for Multi-Sided Markets. AAAI 2020: 1998-2005 - [c16]Itay Shtechman, Rica Gonen, Erel Segal-Halevi:
Fair Cake-Cutting Algorithms with Real Land-Value Data. AAMAS 2020: 2005-2007 - [i34]Erel Segal-Halevi, Warut Suksompong:
How to Cut a Cake Fairly: A Generalization to Groups. CoRR abs/2001.03327 (2020) - [i33]Amitay Dror, Michal Feldman, Erel Segal-Halevi:
On Fair Division under Heterogeneous Matroid Constraints. CoRR abs/2010.07280 (2020) - [i32]Haris Aziz, Xin Huang, Nicholas Mattei, Erel Segal-Halevi:
Computing Fair Utilitarian Allocations of Indivisible Goods. CoRR abs/2012.03979 (2020) - [i31]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Mind the Gap: Cake Cutting With Separation. CoRR abs/2012.06682 (2020)
2010 – 2019
- 2019
- [j8]Erel Segal-Halevi, Warut Suksompong:
Democratic fair allocation of indivisible goods. Artif. Intell. 277 (2019) - [j7]Erel Segal-Halevi, Shmuel Nitzan:
Fair cake-cutting among families. Soc. Choice Welf. 53(4): 709-740 (2019) - [c15]Erel Segal-Halevi, Shani Alkoby, Tomer Sharbaf, David Sarne:
Obtaining Costly Unverifiable Valuations from a Single Agent. AAMAS 2019: 1216-1224 - [c14]Maria Kyropoulou, Josué Ortega, Erel Segal-Halevi:
Fair Cake-Cutting in Practice. EC 2019: 547-548 - [i30]Erel Segal-Halevi:
Bipartite Envy-Free Matching. CoRR abs/1901.09527 (2019) - [i29]Haris Aziz, Xin Huang, Nicholas Mattei, Erel Segal-Halevi:
The Constrained Round Robin Algorithm for Fair and Efficient Allocation. CoRR abs/1908.00161 (2019) - [i28]Fedor Sandomirskiy, Erel Segal-Halevi:
Fair Division with Minimal Sharing. CoRR abs/1908.01669 (2019) - [i27]Rica Gonen, Erel Segal-Halevi:
Strongly Budget Balanced Auctions for Multi-Sided Markets. CoRR abs/1911.08094 (2019) - [i26]Erel Segal-Halevi:
Fair Division with Bounded Sharing. CoRR abs/1912.00459 (2019) - [i25]Erel Segal-Halevi:
The Maximin Share Dominance Relation. CoRR abs/1912.08763 (2019) - [i24]Erel Segal-Halevi:
Quasilinear Rental Harmony. CoRR abs/1912.13249 (2019) - 2018
- [j6]Erel Segal-Halevi, Balázs Sziklai:
Resource-monotonicity and population-monotonicity in connected cake-cutting. Math. Soc. Sci. 95: 19-30 (2018) - [j5]Mor Nitzan, Shmuel Nitzan, Erel Segal-Halevi:
Flexible level-1 consensus ensuring stable social choice: analysis and algorithms. Soc. Choice Welf. 50(3): 457-479 (2018) - [j4]Arseniy V. Akopyan, Erel Segal-Halevi:
Counting Blanks in Polygonal Arrangements. SIAM J. Discret. Math. 32(3): 2242-2257 (2018) - [c13]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. AAAI 2018: 1193-1201 - [c12]Erel Segal-Halevi:
Competitive Equilibrium For almost All Incomes. AAMAS 2018: 1267-1275 - [c11]Erel Segal-Halevi:
Fairly Dividing a Cake after Some Parts Were Burnt in the Oven. AAMAS 2018: 1276-1284 - [c10]Shani Alkoby, David Sarne, Erel Segal-Halevi, Tomer Sharbaf:
Eliciting Truthful Unverifiable Information. AAMAS 2018: 1850-1852 - [c9]Erel Segal-Halevi, Warut Suksompong:
Democratic Fair Allocation of Indivisible Goods. IJCAI 2018: 482-488 - [c8]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Double Auctions in Markets for Multiple Kinds of Goods. IJCAI 2018: 489-497 - [c7]Erel Segal-Halevi:
Redividing the Cake. IJCAI 2018: 498-504 - [i23]Erel Segal-Halevi:
Cake-Cutting with Different Entitlements: How Many Cuts are Needed? CoRR abs/1803.05470 (2018) - [i22]Shani Alkobi, David Sarne, Erel Segal-Halevi, Tomer Sharbaf:
Making an Appraiser Work for You. CoRR abs/1804.08314 (2018) - [i21]Maria Kyropoulou, Josue Ortega, Erel Segal-Halevi:
Fair Cake-Cutting in Practice. CoRR abs/1810.08243 (2018) - 2017
- [c6]Erel Segal-Halevi, Haris Aziz, Avinatan Hassidim:
Fair Allocation based on Diminishing Differences. IJCAI 2017: 1254-1261 - [i20]Erel Segal-Halevi, Balázs Sziklai:
Resource-monotonicity and Population-monotonicity in Connected Cake-cutting. CoRR abs/1703.08928 (2017) - [i19]Erel Segal-Halevi:
Cutting a Cake with both Good and Bad Parts. CoRR abs/1704.00726 (2017) - [i18]Mor Nitzan, Shmuel Nitzan, Erel Segal-Halevi:
On Level-1 Consensus Ensuring Stable Social Choice. CoRR abs/1704.06037 (2017) - [i17]Erel Segal-Halevi:
Competitive Equilibria with Indivisible Goods and Generic Budgets: Settling the Open Cases. CoRR abs/1705.04212 (2017) - [i16]Erel Segal-Halevi, Haris Aziz, Avinatan Hassidim:
Fair Allocation based on Diminishing Differences. CoRR abs/1705.07993 (2017) - [i15]Erel Segal-Halevi, Warut Suksompong:
On Democratic Fairness for Groups of Agents. CoRR abs/1709.02564 (2017) - [i14]Erel Segal-Halevi, Avinatan Hassidim:
Truthful Bilateral Trade is Impossible even with Fixed Prices. CoRR abs/1711.08057 (2017) - [i13]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. CoRR abs/1712.06848 (2017) - [i12]Simina Brânzei, Erel Segal-Halevi, Aviv Zohar:
How to Charge Lightning. CoRR abs/1712.10222 (2017) - 2016
- [j3]Avi Rosenfeld, Inon Zuckerman, Erel Segal-Halevi, Osnat Drein, Sarit Kraus:
NegoChat-A: a chat-based negotiation agent with bounded rationality. Auton. Agents Multi Agent Syst. 30(1): 60-81 (2016) - [j2]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Demand-flow of agents with gross-substitute valuations. Oper. Res. Lett. 44(6): 757-760 (2016) - [j1]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal. ACM Trans. Algorithms 13(1): 12:1-12:32 (2016) - [c5]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. SAGT 2016: 260-272 - [i11]Erel Segal-Halevi:
How to Re-Divide a Cake Fairly. CoRR abs/1603.00286 (2016) - [i10]Erel Segal-Halevi:
Cutting a Cake without Harming the Toppings. CoRR abs/1604.00960 (2016) - [i9]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
A Random-Sampling Double-Auction Mechanism. CoRR abs/1604.06210 (2016) - [i8]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Demand-Flow of Agents with Gross-Substitute Valuations. CoRR abs/1607.01989 (2016) - [i7]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism. CoRR abs/1607.05139 (2016) - [i6]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Cake-Cutting in Two Dimensions. CoRR abs/1609.03938 (2016) - 2015
- [c4]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Cake-Cutting in Two Dimensions. AAAI 2015: 1021-1028 - [c3]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. AAMAS 2015: 901-908 - [p1]Inon Zuckerman, Erel Segal-Halevi, Avi Rosenfeld, Sarit Kraus:
First Steps in Chat-Based Negotiating Agents. Next Frontier in Agent-Based Complex Automated Negotiation 2015: 89-109 - [i5]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Fair and Square: Cake-Cutting in Two Dimensions. CoRR abs/1510.03170 (2015) - [i4]Erel Segal-Halevi, Shmuel Nitzan:
Fair Cake-Cutting among Groups. CoRR abs/1510.03903 (2015) - [i3]Balázs Sziklai, Erel Segal-Halevi:
Resource-monotonicity and Population-monotonicity in Cake-cutting. CoRR abs/1510.05229 (2015) - [i2]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. CoRR abs/1511.02599 (2015) - 2014
- [c2]Avi Rosenfeld, Inon Zuckerman, Erel Segal-Halevi, Osnat Drein, Sarit Kraus:
NegoChat: a chat-based negotiation agent. AAMAS 2014: 525-532 - 2013
- [c1]Eyal Shnarch, Erel Segal-haLevi, Jacob Goldberger, Ido Dagan:
PLIS: a Probabilistic Lexical Inference System. ACL (Conference System Demonstrations) 2013: 97-102 - 2012
- [i1]Ofer Bronstein, Erel Segal-haLevi:
Using Textual Entailment with Variables for KBP Slot Filling Task. TAC 2012
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-01-04 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
