Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 122 matches
- 2024
- Priel Levy, Yonatan Aumann, David Sarne:
Contest partitioning in binary contests. Auton. Agents Multi Agent Syst. 38(1): 7 (2024) - Priel Levy, David Sarne, Yonatan Aumann:
Tractable Binary Contests. ACM Trans. Economics and Comput. 12(1): 1:1-1:24 (2024) - 2023
- Sarit Kraus, Yaniv Oshrat, Yonatan Aumann, Tal Hollander, Oleg Maksimov, Anita Ostroumov, Natali Shechtman:
Customer Service Combining Human Operators and Virtual Agents: A Call for Multidisciplinary AI Research. AAAI 2023: 15393-15401 - Dolev Mutzari, Yonatan Aumann, Sarit Kraus:
Resilient Fair Allocation of Indivisible Goods. AAMAS 2023: 2688-2690 - Eden Hartman, Avinatan Hassidim, Yonatan Aumann, Erel Segal-Halevi:
Leximin Approximation: From Single-Objective to Multi-Objective. ECAI 2023: 996-1003 - Eden Hartman, Avinatan Hassidim, Yonatan Aumann, Erel Segal-Halevi:
Leximin Approximation: From Single-Objective to Multi-Objective. CoRR abs/2303.12506 (2023) - 2022
- Tal Arbiv, Yonatan Aumann:
Fair and Truthful Giveaway Lotteries. AAAI 2022: 4785-4792 - Dolev Mutzari, Yonatan Aumann, Sarit Kraus:
Robust Solutions for Multi-Defender Stackelberg Security Games. IJCAI 2022: 433-439 - Dolev Mutzari, Yonatan Aumann, Sarit Kraus:
Robust Solutions for Multi-Defender Stackelberg Security Games. CoRR abs/2204.14000 (2022) - Yaniv Oshrat, Yonatan Aumann, Tal Hollander, Oleg Maksimov, Anita Ostroumov, Natali Shechtman, Sarit Kraus:
Efficient Customer Service Combining Human Operators and Virtual Agents. CoRR abs/2209.05226 (2022) - 2020
- Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Division of Land. Math. Oper. Res. 45(3): 896-922 (2020) - 2019
- Priel Levy, David Sarne, Yonatan Aumann:
Selective Information Disclosure in Contests. AAMAS 2019: 2093-2095 - Michael Gershtein, David Sarne, Yonatan Aumann:
Approval voting with costly information. DAI 2019: 5:1-5:8 - Priel Levy, David Sarne, Yonatan Aumann:
Temporal Information Design in Contests. IJCAI 2019: 428-434 - 2018
- Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. AAAI 2018: 1193-1201 - Priel Levy, David Sarne, Yonatan Aumann:
Tractable (Simple) Contests. IJCAI 2018: 361-367 - Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Double Auctions in Markets for Multiple Kinds of Goods. IJCAI 2018: 489-497 - 2017
- Amos Azaria, David Sarne, Yonatan Aumann:
Distributed Matching with Mixed Maximum-Minimum Utilities. ACM Trans. Economics and Comput. 5(2): 11:1-11:23 (2017) - Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. CoRR abs/1712.06848 (2017) - 2016
- Igor Rochlin, Yonatan Aumann, David Sarne, Luba Golosman:
Efficiency and fairness in team search with self-interested agents. Auton. Agents Multi Agent Syst. 30(3): 526-552 (2016) - Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Demand-flow of agents with gross-substitute valuations. Oper. Res. Lett. 44(6): 757-760 (2016) - 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. 46(4): 933-954 (2016) - 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) - Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. SAGT 2016: 260-272 - Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
A Random-Sampling Double-Auction Mechanism. CoRR abs/1604.06210 (2016) - Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Demand-Flow of Agents with Gross-Substitute Valuations. CoRR abs/1607.01989 (2016) - Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism. CoRR abs/1607.05139 (2016) - Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Cake-Cutting in Two Dimensions. CoRR abs/1609.03938 (2016) - Yonatan Aumann, Jérôme Lang, Ariel D. Procaccia:
Fair Division (Dagstuhl Seminar 16232). Dagstuhl Reports 6(6): 10-25 (2016) - 2015
- Yonatan Aumann, Yair Dombb:
The Efficiency of Fair Division with Connected Pieces. ACM Trans. Economics and Comput. 3(4): 23:1-23:16 (2015)
skipping 92 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-07-03 03:30 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint