Остановите войну!
for scientists:
default search action
Yonatan Aumann
- > Home > Persons > Yonatan Aumann
Publications
- 2023
- [c66]Eden Hartman, Avinatan Hassidim, Yonatan Aumann, Erel Segal-Halevi:
Leximin Approximation: From Single-Objective to Multi-Objective. ECAI 2023: 996-1003 - [i15]Eden Hartman, Avinatan Hassidim, Yonatan Aumann, Erel Segal-Halevi:
Leximin Approximation: From Single-Objective to Multi-Objective. CoRR abs/2303.12506 (2023) - 2020
- [j36]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Division of Land. Math. Oper. Res. 45(3): 896-922 (2020) - 2018
- [c60]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. AAAI 2018: 1193-1201 - [c58]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Double Auctions in Markets for Multiple Kinds of Goods. IJCAI 2018: 489-497 - 2017
- [i12]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. CoRR abs/1712.06848 (2017) - 2016
- [j33]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Demand-flow of agents with gross-substitute valuations. Oper. Res. Lett. 44(6): 757-760 (2016) - [j31]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) - [c57]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. SAGT 2016: 260-272 - [i11]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
A Random-Sampling Double-Auction Mechanism. CoRR abs/1604.06210 (2016) - [i10]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Demand-Flow of Agents with Gross-Substitute Valuations. CoRR abs/1607.01989 (2016) - [i9]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism. CoRR abs/1607.05139 (2016) - [i8]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Cake-Cutting in Two Dimensions. CoRR abs/1609.03938 (2016) - 2015
- [j29]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods. ACM Trans. Economics and Comput. 4(1): 3:1-3:16 (2015) - [c56]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Cake-Cutting in Two Dimensions. AAAI 2015: 1021-1028 - [c55]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 - [i6]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Fair and Square: Cake-Cutting in Two Dimensions. CoRR abs/1510.03170 (2015) - [i5]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
- [c53]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Auctioning a cake: truthful auctions of heterogeneous divisible goods. AAMAS 2014: 1045-1052 - 2013
- [c52]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Computing socially-efficient cake divisions. AAMAS 2013: 343-350 - 2012
- [i4]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Computing Socially-Efficient Cake Divisions. CoRR abs/1205.3982 (2012)
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2024-04-02 22:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint