Yonatan Aumann

134 papers A* 33A 14B 9C 3Journal 60Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Coalition Tactics: Bribery and Control in Parliamentary Elections. CoRR Hodaya Barr, Eden Hartman, Yonatan Aumann, Sarit Kraus
2025	J	`jnl`	Bribery for Coalitions in Parliamentary Elections. CoRR Hodaya Barr, Yonatan Aumann, Sarit Kraus
2025	A	`conf`	Contest Partitioning in Binary Contests: Costly, yet Beneficial. AAMAS Priel Levy, Yonatan Aumann, David Sarne
2025	J	`jnl`	Control for Coalitions in Parliamentary Elections. CoRR Hodaya Barr, Eden Hartman, Yonatan Aumann, Sarit Kraus
2025	A	`conf`	Facilitating Matches on Allocation Platforms. ECAI Yohai Trabelsi, Abhijin Adiga, Yonatan Aumann, Sarit Kraus, S. S. Ravi
2025	J	`jnl`	Facilitating Matches on Allocation Platforms. CoRR Yohai Trabelsi, Abhijin Adiga, Yonatan Aumann, Sarit Kraus, S. S. Ravi
2025	A*	`conf`	Heterogeneous Multi-Robot Graph Coverage with Proximity and Movement Constraints. AAAI Dolev Mutzari, Yonatan Aumann, Sarit Kraus
2025	A*	`conf`	Reducing Leximin Fairness to Utilitarian Optimization. AAAI Eden Hartman, Yonatan Aumann, Avinatan Hassidim, Erel Segal-Halevi
2025	A*	`conf`	Voter Priming Campaigns: Strategies, Equilibria, and Algorithms. AAAI Jonathan Shaki, Yonatan Aumann, Sarit Kraus
2024	J	`jnl`	Contest partitioning in binary contests. Auton. Agents Multi Agent Syst. Priel Levy, Yonatan Aumann, David Sarne
2024	J	`jnl`	Heterogeneous Multi-Robot Graph Coverage with Proximity and Movement Constraints. CoRR Dolev Mutzari, Yonatan Aumann, Sarit Kraus
2024	J	`jnl`	Reducing Leximin Fairness to Utilitarian Optimization. CoRR Eden Hartman, Yonatan Aumann, Avinatan Hassidim, Erel Segal-Halevi
2024	J	`jnl`	Tractable Binary Contests. ACM Trans. Economics and Comput. Priel Levy, David Sarne, Yonatan Aumann
2024	J	`jnl`	Voter Priming Campaigns: Strategies, Equilibria, and Algorithms. CoRR Jonathan Shaki, Yonatan Aumann, Sarit Kraus
2023	A*	`conf`	Customer Service Combining Human Operators and Virtual Agents: A Call for Multidisciplinary AI Research. AAAI Sarit Kraus, Yaniv Oshrat, Yonatan Aumann, Tal Hollander, Oleg Maksimov, Anita Ostroumov, Natali Shechtman
2023	A	`conf`	Leximin Approximation: From Single-Objective to Multi-Objective. ECAI Eden Hartman, Avinatan Hassidim, Yonatan Aumann, Erel Segal-Halevi
2023	J	`jnl`	Leximin Approximation: From Single-Objective to Multi-Objective. CoRR Eden Hartman, Avinatan Hassidim, Yonatan Aumann, Erel Segal-Halevi
2023	A	`conf`	Resilient Fair Allocation of Indivisible Goods. AAMAS Dolev Mutzari, Yonatan Aumann, Sarit Kraus
2022	J	`jnl`	Efficient Customer Service Combining Human Operators and Virtual Agents. CoRR Yaniv Oshrat, Yonatan Aumann, Tal Hollander, Oleg Maksimov, Anita Ostroumov, Natali Shechtman, Sarit Kraus
2022	A*	`conf`	Fair and Truthful Giveaway Lotteries. AAAI Tal Arbiv, Yonatan Aumann
2022	A*	`conf`	Robust Solutions for Multi-Defender Stackelberg Security Games. IJCAI Dolev Mutzari, Yonatan Aumann, Sarit Kraus
2022	J	`jnl`	Robust Solutions for Multi-Defender Stackelberg Security Games. CoRR Dolev Mutzari, Yonatan Aumann, Sarit Kraus
2020	J	`jnl`	Envy-Free Division of Land. Math. Oper. Res. Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann
2019	—	`conf`	Approval voting with costly information. DAI Michael Gershtein, David Sarne, Yonatan Aumann
2019	A	`conf`	Selective Information Disclosure in Contests. AAMAS Priel Levy, David Sarne, Yonatan Aumann
2019	A*	`conf`	Temporal Information Design in Contests. IJCAI Priel Levy, David Sarne, Yonatan Aumann
2018	A*	`conf`	Double Auctions in Markets for Multiple Kinds of Goods. IJCAI Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2018	A*	`conf`	MUDA: A Truthful Multi-Unit Double-Auction Mechanism. AAAI Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2018	A*	`conf`	Tractable (Simple) Contests. IJCAI Priel Levy, David Sarne, Yonatan Aumann
2017	J	`jnl`	Distributed Matching with Mixed Maximum-Minimum Utilities. ACM Trans. Economics and Comput. Amos Azaria, David Sarne, Yonatan Aumann
2017	J	`jnl`	MUDA: A Truthful Multi-Unit Double-Auction Mechanism. CoRR Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2016	J	`jnl`	A Random-Sampling Double-Auction Mechanism. CoRR Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2016	J	`jnl`	Demand-Flow of Agents with Gross-Substitute Valuations. CoRR Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2016	J	`jnl`	Demand-flow of agents with gross-substitute valuations. Oper. Res. Lett. Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2016	J	`jnl`	Efficiency and fairness in team search with self-interested agents. Auton. Agents Multi Agent Syst. Igor Rochlin, Yonatan Aumann, David Sarne, Luba Golosman
2016	J	`jnl`	Envy-Free Cake-Cutting in Two Dimensions. CoRR Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann
2016	J	`jnl`	Fair Division (Dagstuhl Seminar 16232). Dagstuhl Reports Yonatan Aumann, Jérôme Lang, Ariel D. Procaccia
2016	B	`conf`	SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. SAGT Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2016	J	`jnl`	SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism. CoRR Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2016	J	`jnl`	Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting. Soc. Choice Welf. Orit Arzi, Yonatan Aumann, Yair Dombb
2016	J	`jnl`	Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal. ACM Trans. Algorithms Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2015	J	`jnl`	Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods. ACM Trans. Economics and Comput. Yonatan Aumann, Yair Dombb, Avinatan Hassidim
2015	A*	`conf`	Envy-Free Cake-Cutting in Two Dimensions. AAAI Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2015	J	`jnl`	Fair and Square: Cake-Cutting in Two Dimensions. CoRR Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann
2015	J	`jnl`	The Efficiency of Fair Division with Connected Pieces. ACM Trans. Economics and Comput. Yonatan Aumann, Yair Dombb
2015	A	`conf`	Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. AAMAS Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2015	J	`jnl`	Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. CoRR Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann
2014	A	`conf`	Auctioning a cake: truthful auctions of heterogeneous divisible goods. AAMAS Yonatan Aumann, Yair Dombb, Avinatan Hassidim
2014	J	`jnl`	Automated agents for reward determination for human work in crowdsourcing applications. Auton. Agents Multi Agent Syst. Amos Azaria, Yonatan Aumann, Sarit Kraus
2014	A	`conf`	Efficiency and fairness in team search with self-interested agents. AAMAS Igor Rochlin, Yonatan Aumann, David Sarne, Luba Golosman
2014	J	`jnl`	Exploration costs as a means for improving performance in multiagent systems. Ann. Math. Artif. Intell. David Sarne, Yonatan Aumann
2013	A	`conf`	Computing socially-efficient cake divisions. AAMAS Yonatan Aumann, Yair Dombb, Avinatan Hassidim
2013	J	`jnl`	Physical search problems with probabilistic knowledge. Artif. Intell. Noam Hazon, Yonatan Aumann, Sarit Kraus, David Sarne
2012	A*	`conf`	Automated Strategies for Determining Rewards for Human Work. AAAI Amos Azaria, Yonatan Aumann, Sarit Kraus
2012	J	`jnl`	Computing Socially-Efficient Cake Divisions CoRR Yonatan Aumann, Yair Dombb, Avinatan Hassidim
2012	—	`conf`	Distributed Matching with Mixed Maximum-Minimum Utilities. IAT Amos Azaria, David Sarne, Yonatan Aumann
2012	J	`jnl`	Dotted interval graphs. ACM Trans. Algorithms Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini
2012	J	`jnl`	On the evaluation of election outcomes under uncertainty. Artif. Intell. Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael J. Wooldridge
2012	J	`jnl`	Quasi-distinct parsing and optimal compression methods. Theor. Comput. Sci. Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko
2012	A	`conf`	The benefits of search costs in multiagent exploration. AAMAS David Sarne, Yonatan Aumann
2011	J	`jnl`	Finding witnesses by peeling. ACM Trans. Algorithms Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
2011	B	`conf`	Throw One's Cake - and Eat It Too. SAGT Orit Arzi, Yonatan Aumann, Yair Dombb
2011	J	`jnl`	Throw One's Cake --- and Have It Too CoRR Orit Arzi, Yonatan Aumann, Yair Dombb
2010	A	`conf`	On agent types in coalition formation problems. AAMAS Tammar Shrot, Yonatan Aumann, Sarit Kraus
2010	B	`conf`	Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games. SAGT Yonatan Aumann, Yair Dombb
2010	—	`conf`	Search Costs as a Means for Improving Market Performance. AMEC/TADA David Sarne, Yonatan Aumann
2010	J	`jnl`	Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. J. Cryptol. Yonatan Aumann, Yehuda Lindell
2010	—	`conf`	The Efficiency of Fair Division with Connected Pieces. WINE Yonatan Aumann, Yair Dombb
2009	J	`jnl`	Approximate string matching with address bit errors. Theor. Comput. Sci. Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
2009	A*	`conf`	Collaborative Multi Agent Physical Search with Probabilistic Knowledge. IJCAI Noam Hazon, Yonatan Aumann, Sarit Kraus
2009	—	`conf`	Easy and hard coalition resource game formation problems: a parameterized complexity analysis. AAMAS (1) Tammar Shrot, Yonatan Aumann, Sarit Kraus
2009	J	`jnl`	Efficient computations of Theor. Comput. Sci. Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
2009	J	`jnl`	Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
2009	B	`conf`	Quasi-distinct Parsing and Optimal Compression Methods. CPM Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko
2008	B	`conf`	Approximate String Matching with Address Bit Errors. CPM Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
2008	—	`conf`	Evaluation of election outcomes under uncertainty. AAMAS (2) Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael J. Wooldridge
2008	—	`conf`	Fixed Structure Complexity. IWPEC Yonatan Aumann, Yair Dombb
2008	A*	`conf`	Physical Search Problems Applying Economic Search Models. AAAI Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sarne
2007	C	`conf`	Efficient Computations of SPIRE Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
2007	B	`conf`	Finding Witnesses by Peeling. CPM Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
2007	J	`jnl`	Optimization of probe coverage for high-resolution oligonucleotide aCGH. Bioinform. Doron Lipson, Zohar Yakhini, Yonatan Aumann
2007	B	`conf`	Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. TCC Yonatan Aumann, Yehuda Lindell
2007	J	`jnl`	Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. IACR Cryptol. ePrint Arch. Yonatan Aumann, Yehuda Lindell
2006	J	`jnl`	Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. J. Comput. Biol. Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini
2006	J	`jnl`	Function Matching. SIAM J. Comput. Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat
2006	A*	`conf`	Pattern matching with address errors: rearrangement distances. SODA Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
2006	J	`jnl`	Visual information extraction. Knowl. Inf. Syst. Yonatan Aumann, Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, Jonathan Schler
2005	J	`jnl`	Designing optimally multiplexed SNP genotyping assays. J. Comput. Syst. Sci. Yonatan Aumann, Efrat Manisterski, Zohar Yakhini
2005	A*	`conf`	Dotted interval graphs and high throughput genotyping. SODA Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini
2005	B	`conf`	Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. RECOMB Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini
2005	J	`jnl`	Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distributed Comput. Yonatan Aumann, Michael A. Bender
2005	J	`jnl`	Maximal Association Rules: A Tool for Mining Associations in Text. J. Intell. Inf. Syst. Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko
2004	A	`conf`	TEG: a hybrid approach to information extraction. CIKM Binyamin Rosenfeld, Ronen Feldman, Moshe Fresko, Jonathan Schler, Yonatan Aumann
2003	J	`jnl`	A Statistical Theory for Quantitative Association Rules. J. Intell. Inf. Syst. Yonatan Aumann, Yehuda Lindell
2003	C	`conf`	Designing Optimally Multiplexed SNP Genotyping Assays. WABI Yonatan Aumann, Efrat Manisterski, Zohar Yakhini
2003	A*	`conf`	Function Matching: Algorithms, Applications, and a Lower Bound. ICALP Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
2002	C	`conf`	A Comparative Study of Information Extraction Strategies. CICLing Ronen Feldman, Yonatan Aumann, Michal Finkelstein-Landau, Eyal Hurvitz, Yizhar Regev, Ariel Yaroshevich
2002	J	`jnl`	Everlasting security in the bounded storage model. IEEE Trans. Inf. Theory Yonatan Aumann, Yan Zong Ding, Michael O. Rabin
2002	A	`conf`	Structural extraction from visual layout of documents. CIKM Binyamin Rosenfeld, Ronen Feldman, Yonatan Aumann
2001	A	`conf`	A Domain Independent Environment for Creating Information Extraction Modules. CIKM Ronen Feldman, Yonatan Aumann, Yair Liberzon, Kfir Ankori, Yonatan Schler, Binyamin Rosenfeld
2001	J	`jnl`	Linear-Consistency Testing. J. Comput. Syst. Sci. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
2000	J	`jnl`	On the cost of recomputing: Tight bounds on pebbling with faults. Theor. Comput. Sci. Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
2000	J	`jnl`	Pattern Matching with Swaps. J. Algorithms Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
1999	A*	`conf`	A Statistical Theory for Quantitative Association Rules. KDD Yonatan Aumann, Yehuda Lindell
1999	J	`jnl`	Borders: An Efficient Algorithm for Association Generation in Dynamic Databases. J. Intell. Inf. Syst. Yonatan Aumann, Ronen Feldman, Orly Liphstat, Heikki Mannila
1999	—	`conf`	Circle Graphs: New Visualization Tools for Text-Mining. PKDD Yonatan Aumann, Ronen Feldman, Yaron Ben-Yehuda, David Landau, Orly Liphstat, Yonatan Schler
1999	A*	`conf`	Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. SODA Yonatan Aumann, Avivit Kapah-Levy
1999	A*	`conf`	Information Theoretically Secure Communication in the Limited Storage Space Model. CRYPTO Yonatan Aumann, Michael O. Rabin
1999	J	`jnl`	Linear Consistency Testing Electron. Colloquium Comput. Complex. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
1999	—	`conf`	Linear Consistency Testing. RANDOM-APPROX Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
1999	—	`conf`	Text Mining via Information Extraction. PKDD Ronen Feldman, Yonatan Aumann, Moshe Fresko, Orly Liphstat, Binyamin Rosenfeld, Yonatan Schler
1998	J	`jnl`	An SIAM J. Comput. Yonatan Aumann, Yuval Rabani
1998	A*	`conf`	Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). CRYPTO Yonatan Aumann, Michael O. Rabin
1998	—	`conf`	Knowledge Management: A Text Mining Approach. PAKM Ronen Feldman, Moshe Fresko, Haym Hirsh, Yonatan Aumann, Orly Liphstat, Yonatan Schler, Martin Rajman
1998	—	`conf`	TextVis: An Integrated Visual Environment for Text Mining. PKDD David Landau, Ronen Feldman, Yonatan Aumann, Moshe Fresko, Yehuda Lindell, Orly Liphstat, Oren Zamir
1998	—	`conf`	Trend Graphs: Visualizing the Evolution of Concept Relationships in Large Document Collections. PKDD Ronen Feldman, Yonatan Aumann, Amir Zilberstein, Yaron Ben-Yehuda
1997	—	`conf`	Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. DMKD Ronen Feldman, Yonatan Aumann, Amihood Amir, Heikki Mannila
1997	A*	`conf`	Efficient Asynchronous Consensus with the Weak Adversary Scheduler. PODC Yonatan Aumann
1997	J	`jnl`	Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. Inf. Comput. Yonatan Aumann, Michael A. Bender, Lisa Zhang
1997	A*	`conf`	Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. KDD Ronen Feldman, Yonatan Aumann, Amihood Amir, Amir Zilberstein, Willi Klösgen
1997	A*	`conf`	Pattern Matching with Swaps. FOCS Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
1996	A*	`conf`	Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. ICALP Yonatan Aumann, Michael A. Bender
1996	B	`conf`	Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. SPAA Yonatan Aumann, Michael A. Bender, Lisa Zhang
1996	A*	`conf`	Fault Tolerant Data Structures. FOCS Yonatan Aumann, Michael A. Bender
1995	A*	`conf`	Improved Bounds for All Optical Routing. SODA Yonatan Aumann, Yuval Rabani
1994	J	`jnl`	Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. Theor. Comput. Sci. Yonatan Aumann, Michael O. Rabin
1994	A*	`conf`	On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. ICALP Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
1993	—	`—`	Computing with low degree networks: shared memory implementation and dynamic Fault-Tolerance (חשוב מקבילי ברשתות דלילות.). Yonatan Aumann
1993	A*	`conf`	Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs FOCS Yonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin
1993	A*	`conf`	On Message Proof Systems with Known Space Verifiers. CRYPTO Yonatan Aumann, Uriel Feige
1992	A*	`conf`	Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) FOCS Yonatan Aumann, Michael O. Rabin
1992	A*	`conf`	Computing with Faulty Arrays STOC Yonatan Aumann, Michael Ben-Or
1991	A*	`conf`	Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) FOCS Yonatan Aumann, Michael Ben-Or
1991	J	`jnl`	Improved Memory Utilization in Deterministic PRAM Simulation. J. Parallel Distributed Comput. Yonatan Aumann, Assaf Schuster