Yonatan Aumann

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 29

Top Venues

CoRR

AAMAS

AAAI

ACM Trans. Economics and Comput.

Publications

Priel Levy, David Sarne, Yonatan Aumann
Tractable Binary Contests. ACM Trans. Economics and Comput. 12 (1) (2024)
Priel Levy, Yonatan Aumann, David Sarne
Contest partitioning in binary contests. Auton. Agents Multi Agent Syst. 38 (1) (2024)
Eden Hartman, Avinatan Hassidim, Yonatan Aumann, Erel Segal-Halevi
Leximin Approximation: From Single-Objective to Multi-Objective. CoRR (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)
Dolev Mutzari, Yonatan Aumann, Sarit Kraus
Resilient Fair Allocation of Indivisible Goods. AAMAS (2023)
Eden Hartman, Avinatan Hassidim, Yonatan Aumann, Erel Segal-Halevi
Leximin Approximation: From Single-Objective to Multi-Objective. ECAI (2023)
Yaniv Oshrat, Yonatan Aumann, Tal Hollander, Oleg Maksimov, Anita Ostroumov, Natali Shechtman, Sarit Kraus
Efficient Customer Service Combining Human Operators and Virtual Agents. CoRR (2022)
Dolev Mutzari, Yonatan Aumann, Sarit Kraus
Robust Solutions for Multi-Defender Stackelberg Security Games. CoRR (2022)
Tal Arbiv, Yonatan Aumann
Fair and Truthful Giveaway Lotteries. AAAI (2022)
Dolev Mutzari, Yonatan Aumann, Sarit Kraus
Robust Solutions for Multi-Defender Stackelberg Security Games. IJCAI (2022)
Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann
Envy-Free Division of Land. Math. Oper. Res. 45 (3) (2020)
Priel Levy, David Sarne, Yonatan Aumann
Selective Information Disclosure in Contests. AAMAS (2019)
Michael Gershtein, David Sarne, Yonatan Aumann
Approval voting with costly information. DAI (2019)
Priel Levy, David Sarne, Yonatan Aumann
Temporal Information Design in Contests. IJCAI (2019)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. AAAI (2018)
Priel Levy, David Sarne, Yonatan Aumann
Tractable (Simple) Contests. IJCAI (2018)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
Double Auctions in Markets for Multiple Kinds of Goods. IJCAI (2018)
Amos Azaria, David Sarne, Yonatan Aumann
Distributed Matching with Mixed Maximum-Minimum Utilities. ACM Trans. Economics and Comput. 5 (2) (2017)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. CoRR (2017)
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) (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) (2016)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. SAGT (2016)
Yonatan Aumann, Jérôme Lang, Ariel D. Procaccia
Fair Division (Dagstuhl Seminar 16232). Dagstuhl Reports 6 (6) (2016)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism. CoRR (2016)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
A Random-Sampling Double-Auction Mechanism. CoRR (2016)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
Demand-flow of agents with gross-substitute valuations. Oper. Res. Lett. 44 (6) (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) (2016)
Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann
Envy-Free Cake-Cutting in Two Dimensions. CoRR (2016)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
Demand-Flow of Agents with Gross-Substitute Valuations. CoRR (2016)
Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann
Fair and Square: Cake-Cutting in Two Dimensions. CoRR (2015)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. CoRR (2015)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
Envy-Free Cake-Cutting in Two Dimensions. AAAI (2015)
Yonatan Aumann, Yair Dombb
The Efficiency of Fair Division with Connected Pieces. ACM Trans. Economics and Comput. 3 (4) (2015)
Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. AAMAS (2015)
Yonatan Aumann, Yair Dombb, Avinatan Hassidim
Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods. ACM Trans. Economics and Comput. 4 (1) (2015)
Amos Azaria, Yonatan Aumann, Sarit Kraus
Automated agents for reward determination for human work in crowdsourcing applications. Auton. Agents Multi Agent Syst. 28 (6) (2014)
Yonatan Aumann, Yair Dombb, Avinatan Hassidim
Auctioning a cake: truthful auctions of heterogeneous divisible goods. AAMAS (2014)
David Sarne, Yonatan Aumann
Exploration costs as a means for improving performance in multiagent systems. Ann. Math. Artif. Intell. 72 (3-4) (2014)
Igor Rochlin, Yonatan Aumann, David Sarne, Luba Golosman
Efficiency and fairness in team search with self-interested agents. AAMAS (2014)
Noam Hazon, Yonatan Aumann, Sarit Kraus, David Sarne
Physical search problems with probabilistic knowledge. Artif. Intell. 196 (2013)
Yonatan Aumann, Yair Dombb, Avinatan Hassidim
Computing socially-efficient cake divisions. AAMAS (2013)
Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael J. Wooldridge
On the evaluation of election outcomes under uncertainty. Artif. Intell. 189 (2012)
Amos Azaria, David Sarne, Yonatan Aumann
Distributed Matching with Mixed Maximum-Minimum Utilities. IAT (2012)
Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko
Quasi-distinct parsing and optimal compression methods. Theor. Comput. Sci. 422 (2012)
David Sarne, Yonatan Aumann
The benefits of search costs in multiagent exploration. AAMAS (2012)
Yonatan Aumann, Yair Dombb, Avinatan Hassidim
Computing Socially-Efficient Cake Divisions CoRR (2012)
Amos Azaria, Yonatan Aumann, Sarit Kraus
Automated Strategies for Determining Rewards for Human Work. AAAI (2012)
Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini
Dotted interval graphs. ACM Trans. Algorithms 8 (2) (2012)
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
Finding witnesses by peeling. ACM Trans. Algorithms 7 (2) (2011)
Orit Arzi, Yonatan Aumann, Yair Dombb
Throw One's Cake --- and Have It Too CoRR (2011)
Orit Arzi, Yonatan Aumann, Yair Dombb
Throw One's Cake - and Eat It Too. SAGT (2011)
Yonatan Aumann, Yair Dombb
The Efficiency of Fair Division with Connected Pieces. WINE (2010)
David Sarne, Yonatan Aumann
Search Costs as a Means for Improving Market Performance. AMEC/TADA (2010)
Tammar Shrot, Yonatan Aumann, Sarit Kraus
On agent types in coalition formation problems. AAMAS (2010)
Yonatan Aumann, Yair Dombb
Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games. SAGT (2010)
Yonatan Aumann, Yehuda Lindell
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. J. Cryptol. 23 (2) (2010)
Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
Approximate string matching with address bit errors. Theor. Comput. Sci. 410 (51) (2009)
Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75 (6) (2009)
Noam Hazon, Yonatan Aumann, Sarit Kraus
Collaborative Multi Agent Physical Search with Probabilistic Knowledge. IJCAI (2009)
Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko
Quasi-distinct Parsing and Optimal Compression Methods. CPM (2009)
Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
rearrangement distances. Theor. Comput. Sci. 410 (43) (2009)
Tammar Shrot, Yonatan Aumann, Sarit Kraus
Easy and hard coalition resource game formation problems: a parameterized complexity analysis. AAMAS (1) (2009)
Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael J. Wooldridge
Evaluation of election outcomes under uncertainty. AAMAS (2) (2008)
Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sarne
Physical Search Problems Applying Economic Search Models. AAAI (2008)
Yonatan Aumann, Yair Dombb
Fixed Structure Complexity. IWPEC (2008)
Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
Approximate String Matching with Address Bit Errors. CPM (2008)
Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
Rearrangement Distances. SPIRE (2007)
Yonatan Aumann, Yehuda Lindell
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. IACR Cryptol. ePrint Arch. 2007 (2007)
Yonatan Aumann, Yehuda Lindell
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. TCC (2007)
Doron Lipson, Zohar Yakhini, Yonatan Aumann
Optimization of probe coverage for high-resolution oligonucleotide aCGH. Bioinform. 23 (2) (2007)
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
Finding Witnesses by Peeling. CPM (2007)
Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
Pattern matching with address errors: rearrangement distances. SODA (2006)
Yonatan Aumann, Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, Jonathan Schler
Visual information extraction. Knowl. Inf. Syst. 10 (1) (2006)
Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat
Function Matching. SIAM J. Comput. 35 (5) (2006)
Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini
Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. J. Comput. Biol. 13 (2) (2006)
Yonatan Aumann, Efrat Manisterski, Zohar Yakhini
Designing optimally multiplexed SNP genotyping assays. J. Comput. Syst. Sci. 70 (3) (2005)
Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko
Maximal Association Rules: A Tool for Mining Associations in Text. J. Intell. Inf. Syst. 25 (3) (2005)
Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini
Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. RECOMB (2005)
Yonatan Aumann, Michael A. Bender
Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distributed Comput. 17 (3) (2005)
Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini
Dotted interval graphs and high throughput genotyping. SODA (2005)
Binyamin Rosenfeld, Ronen Feldman, Moshe Fresko, Jonathan Schler, Yonatan Aumann
TEG: a hybrid approach to information extraction. CIKM (2004)
Yonatan Aumann, Efrat Manisterski, Zohar Yakhini
Designing Optimally Multiplexed SNP Genotyping Assays. WABI (2003)
Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
Function Matching: Algorithms, Applications, and a Lower Bound. ICALP (2003)
Yonatan Aumann, Yehuda Lindell
A Statistical Theory for Quantitative Association Rules. J. Intell. Inf. Syst. 20 (3) (2003)
Yonatan Aumann, Yan Zong Ding, Michael O. Rabin
Everlasting security in the bounded storage model. IEEE Trans. Inf. Theory 48 (6) (2002)
Binyamin Rosenfeld, Ronen Feldman, Yonatan Aumann
Structural extraction from visual layout of documents. CIKM (2002)
Ronen Feldman, Yonatan Aumann, Michal Finkelstein-Landau, Eyal Hurvitz, Yizhar Regev, Ariel Yaroshevich
A Comparative Study of Information Extraction Strategies. CICLing (2002)
Ronen Feldman, Yonatan Aumann, Yair Liberzon, Kfir Ankori, Yonatan Schler, Binyamin Rosenfeld
A Domain Independent Environment for Creating Information Extraction Modules. CIKM (2001)
Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
Linear-Consistency Testing. J. Comput. Syst. Sci. 62 (4) (2001)
Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
Pattern Matching with Swaps. J. Algorithms 37 (2) (2000)
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
On the cost of recomputing: Tight bounds on pebbling with faults. Theor. Comput. Sci. 233 (1-2) (2000)
Yonatan Aumann, Michael O. Rabin
Information Theoretically Secure Communication in the Limited Storage Space Model. CRYPTO (1999)
Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
Linear Consistency Testing. RANDOM-APPROX (1999)
Yonatan Aumann, Ronen Feldman, Yaron Ben-Yehuda, David Landau, Orly Liphstat, Yonatan Schler
Circle Graphs: New Visualization Tools for Text-Mining. PKDD (1999)
Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
Linear Consistency Testing Electron. Colloquium Comput. Complex. 6 (25) (1999)
Yonatan Aumann, Avivit Kapah-Levy
Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. SODA (1999)
Ronen Feldman, Yonatan Aumann, Moshe Fresko, Orly Liphstat, Binyamin Rosenfeld, Yonatan Schler
Text Mining via Information Extraction. PKDD (1999)
Yonatan Aumann, Yehuda Lindell
A Statistical Theory for Quantitative Association Rules. KDD (1999)
Yonatan Aumann, Ronen Feldman, Orly Liphstat, Heikki Mannila
Borders: An Efficient Algorithm for Association Generation in Dynamic Databases. J. Intell. Inf. Syst. 12 (1) (1999)
Yonatan Aumann, Michael O. Rabin
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). CRYPTO (1998)

Yonatan Aumann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yonatan Aumann