Publications: by date

Publications (by date) (not fully up-to-date)

• Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, and Yonatan Aumann. "Fair and Square: Cake Cutting in Two Dimensions". Journal of Mathematical Economics, 70:1-28, May 2017. pdf
• Orit Arzi, Yonatan Auman and Yair Dombb. "Toss One's Cake and Eat it Too: Partial Divisions Can Improve Social Welfare in Cake Cutting". Social Choice and Welfare, 46(4):933-954, April, 2016. pdf.
• Initial version appeared as “Throw One's Cake - and Have It Too.“ In proceedings of the Forth International Symposium on Algorithmic Game Theory (SAGT): 69-80, 2011.
• Erel Segal-Halevi, Avinatan Hassidim, and Yonatan Aumann. "Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal". Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2015. pdf
• Yonatan Aumann, Yair Dombb, and Avinatan Hassidim. “Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods”. ACM Transactions on Economics and Computation, 4(1), December 2015. pdf.
  • Preliminary version appeared in the proceedings of the International conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2014.
• Erel Segal-Halevi, Avinatan Hassidim, and Yonatan Aumann. "Envy-Free Cake Cutting in Two Dimensions". Proceedings of the Twenty-Ninth Conference on Artificial Intelligence (AAAI), 2015. pdf.
• Igor Rochlin, Yonatan Aumann, David Sarne, Luba Golosman. “Efficiency and Fairness in Team Search with Self-Interested Agents”. Accepted to Autonomous Agents and Mutli-Agent Systems (invited paper). Appeared online, December 2015. pdf.
  • Initial version appeared in Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2014. pdf.
• Yonatan Aumann and Yair Dombb. “The Efficiency of Fair Division with Connected Pieces.“ ACM Transactions on Economics and Computation, 3(4), July 2015. pdf.
  • Preliminary version appeared in Internet and Network Economics - 6th International Workshop (WINE): 26-37, 2010.
• Amos Azaria, Yonatan Aumann, and Sarit Kraus. “Automated Agents for Reward Determination for Human Work in Crowdsourcing Applications” Journal of Autonomous Agents and Multi-Agent Systems, 28(6):934-955, November 2014. pdf.
  • Preliminary version appeared as “Automated Strategies for Determining Rewards for Human Work” in Proceedings of the Twenty-Sixth Conference on Artificial Intelligence (AAAI), pages 1514-1521, 2012.
  • Yonatan Aumann and David Sarne. "Exploration Costs as Means for Improving Performance in Multiagent Systems". Annals of Mathematics and Artificial Intelligence. 72(3), pages 297-329, November 2014. pdf
• Yonatan Aumann, Yair Dombb, and Avinatan Hassidim. “Computing Socially Efficient Cake Divisions”. Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 343-350, 2013. pdf.
• Noam Hazon, Yonatan Aumann, Sarit Kraus, and David Sarne. “Physical search problems with probabilistic knowledge.” Artificial Intelligence, 196: 26-52, March 2013. pdf. Combines two preliminary papers:
  • “Physical Search Problems Applying Economic Search Models” from Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pages 9-16, 2008, and
  • “Collaborative Multi Agent Physical Search with Probabilistic Knowledge.” From Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pages 167-174, 2009.
• Amos Azaria, Yonatan Aumann and David Sarne. “Distributed Matching with Mixed Maximum-Minimum Utilities”. Proceedings of the 2012 IEEE International Conference on Intelligent Agent Technology, pp. 134-139, 2012. pdf.
• Noam Hazon, Yonatan Aumann, Sarit Kraus and Michael Wooldridge. “On the Evaluation of Election Outcomes Under Uncertainty”. Artificial Intelligence , 189:1-18, September 2012. pdf.
  • Preliminary version appeared in proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), volume 2, pages 959-966, 2008.
• Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Pinter, and Zohar Yakhini. “Dotted Interval Graphs.” ACM Transactions on Algorithms, 8(2), 2012. pdf.
  • Preliminary version appeared as “Dotted Interval Graphs and High Throughput Genotyping”, in Proceedings of 26th Annual ACM-SIAM Symposium of Discrete Algorithms (SODA), pages 339-348, 2005.
• Amihood Amir, Yonatan Aumann, Avivit Levy, and Yuri Roshko. “Quasi-distinct parsing and optimal compression methods.“ Theoretical Computer Science, 422:1-14, 2012. pdf.
  • Preliminary version appeared in proceedings of 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), pages 12-25, 2009.
• Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein and Dekel Tsur. “Finding witnesses by peeling.“ ACM Transactions on Algorithms 7(2): 24, 2011. pdf.
  • Preliminary version appeared in proceedings of 18th Annual Symposium on Combinatorial Pattern Matching (CPM), pages 28-39, 2007.
• Yonatan. Aumann and Yair Dombb. “Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games.” Third International Symposium on Algorithmic Game Theory (SAGT 2010), pages 66-77, 2010. pdf.
• Tamar Shrot, Yonatan Aumann, and Sarit Kraus. “On agent types in coalition formation problems.” Proceedings of the 9th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), pages 757-764, 2010. pdf.
• Yonatan Aumann and Yehuda Lindell. “Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries”. Journal of Cryptology 23(2), 281-343, 2010. pdf.
  • Preliminary version appeared in proceedings of the 4th annual Theory of Cryptography Conference (TCC), pages 137-156, 2007.
• Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, and Ely Porat. “Approximate string matching with address bit errors”. Theoretical Computer Science 410(51): 5334-5346, 2009. pdf.
• Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, and Ely Porat. “Efficient computations of l1 and l? rearrangement distances”. Theoretical Computer Science 410(43): 4382-4390, 2009. pdf.
  • Preliminary version appeared in proceedings of the 14th International Symposium on String Processing and Information Retrieval (SPIRE), pages 39-49, 2007.
• Amihood Amir, Yonatan Aumann, Garry Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, and Uzi Vishne. “Pattern matching with address errors: Rearrangement distances.” Journal of Computer and System Sciences 75(6): 359-370, 2009. pdf.
  • Preliminary version appeared in proceedings of the 27th Annual ACM-SIAM Symposium of Discrete Algorithms (SODA), pages 1221-1229, 2006.
• Tamar Shrot, Yonatan Aumann, and Sarit Kraus. “Easy and hard coalition resource game formation problems: a parameterized complexity analysis.” Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 433-440, 2009. pdf.
• Amihood Amir, Yonatan Aumann, Oren Kapah and Avivit Levy. “Approximate String Matching with Address Bit Errors”. Proceedings of 19th Annual Symposium on Combinatorial Pattern Matching (CPM), pages 118-129, 2008.
• Yonatan Aumann and Yair Dombb. “Fixed Structure Complexity”. Proceedings of the Third International Workshop on Parameterized and Exact Computation (IWPEC), pages 30-42, 2008. pdf (full version).
• Doron Lipson, Zohar Yakhini, and Yonatan Aumann, "Optimization of Probe Coverage for High-Resolution Oligonucleotide aCGH". Bioinformatics 32(2), e77-e83, January 2007. pdf.
  • Preliminary version appeared in proceedings of the 5th annual European Conference on Computational Biology (ECCB), 2006.
• Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nati Linial and Zohar Yakhini. “Efficient Calculation of Interval Scores for DNA Copy Number”. Journal of Computational Biology (JCB) 13(2), 215-228, March 2006. pdf.
  • Preliminary version appeared in proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB), pages 83-100, 2005.
• Amihood Amir, Yonatan Aumann, Moshe Lewenstein, and Ely Porat. “Function Matching”. SIAM Journal of Computing (SICOMP) 35(5), 1007-1022, 2006. pdf.
• Yonatan Aumann, Ronen Feldman, Yair Liberzon, Benny Rosenfeld and Jonathan Schler. “Visual Information Extraction”. Knowledge and Information Systems (KAIS) 10(1), 1-15, July 2006.
• Amihood Amir, Yonatan Aumann, Ronen Feldman and Moshe Fresko. “Maximal Association Rules: a Tool for Mining Associations in Text”. Journal of Intelligent Information Systems (JIIS), 25(3), 333-345, November 2005.
  • Preliminary version appeared in Proceedings of the 3rd Annual Conference of Knowledge Discovery and Data Mining, (KDD '97), 1997, pages 167-170.
• Yonatan Aumann, Efrat Manisterski and Zohar Yakhini. “Designing Optimally Multiplexed SNP Genotyping Assays”. Journal of Computer and System Sciences (JCSS) special issue on Bioinformatics, 70(3), 399-417, May 2005. pdf.
  • Preliminary version in proceedings of the Workshop on Algorithms in Bioinformatics (WABI), 2003, pages 320-338.
• Yonatan Aumann and Michael Bender. “Low-Contention Asynchronous Consensus with the Value-Oblivious Adversary Scheduler”. Distributed Computing, 17(3):191-207, March 2005.
• Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, and Ely Porat. “Function Matching: Algorithms, Applications and a Lower Bound”. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, (ICALP), pages 929-942, 2003.
• Yonatan Aumann and Yehuda Lindell. “A Statistical Theory of Quantitative Association Rules”. Journal of Intelligent Information Systems (JIIS), 20 (3):255--283, 2003. pdf.
  • Preliminary version appeared in proceedings of the annual SIGKDD symposium on Data Mining (KDD), pages 261-270, 1999.
• Yonatan Aumann, Yan Zong Ding and Michael O. Rabin. “Everlasting Security in the Bounded Storage Model”. IEEE Transactions of Information Theory, 48:1668-1680, 2002. Invited paper. pdf.
• Binyamin Rosenfled, Ronen Feldman and Yonatan Aumann. “Structural extraction from visual layout of documents”. In Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management (CIKM), pages 203-210, November, 2002.
• Ronen Feldman, Yonatan Aumann, Michal Finkelstein-Landau, Eyal Hurvitz, Yizhar Regev, and Ariel Yaroshevich. “A Comparative Study of Information Extraction Strategies”. In Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing (CICLing), pages 349-359, 2002.
• Ronen Feldman, Yonatan Aumann, Yair Liberzon, Kfir Ankori, Jonathan Schler, and Binyamin Rosenfeld. “A Domain Independent Environment for Creating Information Extraction Modules”. In Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management (CIKM), pages 586-588, 2001.
• Yonatan Aumann, Johan Hastaad, Michael O. Rabin and Madhu Sudan. “Linear Consistency Testing”. Journal of Computer and System Sciences (JSSS) 62 (4), 589-607, July 2001. pdf.
  • Preliminary version appeared in proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM 99), LNCS vol. 1671, pages 109-120, 1999.
• Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, and Noa Lewenstein. “Pattern Matching with Swaps”. Journal of Algorithms 37, 247-266, 2000.
  • Preliminary version appeared in proceedings of the 36th Annual Symposium, on the Foundations of Computer Science (FOCS), 1997, pages 144-153.
• Yonatan Aumann, Judith Bar-Ilan and Uriel Feige. “On the Cost of Recomputing: Tight Bounds on pebbling with Faults”. Theoretical Computer Science, 233, 247-261, 2000. pdf.
  • Preliminary version appeared in proceedings of the 21st International Colloquium on Automata, Languages, and Programming (ICALP), Springer-Verlag, 1994, pages: 47-58.
• Yonatan Aumann and Michael O. Rabin. “Information Theoretically Secure Communication in the Limited Storage Space Model”. In Advances in Cryptology (CRYPTO), LNCS vol. 1666, pages 65-79, 1999.
• Yonatan Aumann, Ronen Feldman, Orly Lipshtat, and Heikki Manilla. “Borders: an Efficient Algorithm for Association Generation in Dynamic Databases”. Journal of Intelligent Information System (JIIS), 12:61-73, 1999.
• Yonatan Aumann and Avivit Kapach-Levy. “Cooperative Sharing and Asynchronous Consensus Using Single-Reader/Single-Writer Registers”. In Proceedings of 10th Annual ACM-SIAM Symposium of Discrete Algorithms (SODA), pages 61-70, 1999.
• Yonatan Aumann and Michael O. Rabin. “Authentication, Enhanced Security and Error Correcting Codes”, In Advances in Cryptology (CRYPTO), LNCS vol. 1462, pages 299-303, 1998.
• Ronen Feldman, Yonatan Aumann, Amir Zilberstein, and Yair Ben-Yehuda, “Trend Graphs: Visualizing the Evolution of Concept Relationships in Large Document Collections.” In Principles of Data Mining and Knowledge Discovery (PKDD), LNCS vol. 1510, pages 38-46, 1998.
• David Landau, Ronen Feldman, Yonatan Aumann, Moshe Fresko, Yehuda Lindell, Orly Lipshtat, and O. Zamir, “Text-Vis: An Integrated Visual Environment for Text Mining.” In Principles of Data Mining and Knowledge Discovery (PKDD), LNCS vol. 1510, pages 38-46, 1998.
• Yonatan Aumann and Yuval Rabani. “An O(log k) Approximate Min-cut Max-flow Theorem and Approximation Algorithm for Multi-Commodity Flows”. SIAM Journal of Computing (SICOMP), 27(1), 291-301, February 1998. pdf.
• Yonatan Aumann. “Efficient Asynchronous Consensus with the Weak Adversary Scheduler”. In Proceedings of 16th Annual ACM Symposium on Principles of Distributed Computing (PODC), 1997. Pages 209-218.
• Ronen Feldman, Yonatan Aumann, Amihood Amir, and Heikki Mannila. “Efficient Algorithms for Discovering Frequent Sets in Incremental Databases”, In Proceedings of SIGMOD '97 workshop on Data Mining, May, 1997. Pages 159-66.
• Yonatan Aumann, Michael Bender and Lisa Zhang. “Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems”. Information and Computation, 139(1), 1-16, November 1997.
  • Preliminary version appeared in Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1996, pages: 270-276.
• Yonatan Aumann and Micheal Bender. “Fault-Tolerant Data Structures”. In Proceedings of the 37th Annual Symposium, on the Foundations of Computer Science (FOCS), 1996, pages: 580-589.
• Yonatan Aumann and Micheal Bender. “Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler”, In Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP), Springer-Verlag, 1996, pages: 622-633.
• Yonatan Aumann and Yuval Rabani. “Improved Bounds for All Optical Routing”. In Proceedings of 6th Annual ACM-SIAM Symposium of Discrete Algorithms (SODA), 1995, pages: 567-576.
• Yonatan Aumann and Micheal O. Rabin. “Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation”. Theoretical Computer Science, 128, 3-30, 1994. pdf.
  • Preliminary version appeared in Proceedings of the 33rd Annual Symposium, on the Foundations of Computer Science (FOCS), 1992, pages: 147-156.
• Yonatan Aumann, Krishna Palem, Zvi Kedem and Michael O. Rabin. “Highly Efficient Asynchronous Execution of Large Grained Parallel Programs”, In Proceedings of the 34th Annual Symposium on the Foundations of Computer Science (FOCS), November 1993, pages: 271-280.
• Yonatan Aumann and Uriel Feige. “One Message Proof Systems with Known Space Verifies”, In Proceedings of Crypto '93 (CRYPTO), Springer-Verlag, 1993, pages: 85-99.
• Yonatan Aumann and Micheal Ben-Or. “Computing with Faulty arrays”, In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC), 1992, pages: 162-169.
• Yonatan Aumann and Micheal Ben-Or. “Asymptotically Optimal PRAM Emulation on Faulty Hypercubes”, In Proceedings of the 32nd Annual Symposium on the Foundations of Computer Science (FOCS), 1991, pages: 440-446.
• Yonatan Aumann and Hanna Parnas. “Evaluation of the Time Course of Neurotransmitter Release from the Measured PSC and MPSC”. Bulletin of Mathematical Biology, 53(4) 537-555, 1991.
• Yonatan Aumann and Assaf Schuster. “Improved Memory Utilization in deterministic PRAM Simulation”. Journal of Parallel and Distributed Computing, invited paper to special Issue on Shared Memory Multi-Processors. 12(2), 146-151, July 1991.
  • Preliminary version appeared in Proceedings of the Third Symposium on the Frontiers of Massivel Parallel Computation, October 1990, pages: 22-29.