Yonatan Aumann

Auton. Agents Multi Agent Syst., June, 2024

Tractable Binary Contests.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., March, 2024

Reducing Leximin Fairness to Utilitarian Optimization.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Leximin Approximation: From Single-Objective to Multi-Objective.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Resilient Fair Allocation of Indivisible Goods.

[BibT_eX]

[DOI]

Dolev Mutzari

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Customer Service Combining Human Operators and Virtual Agents: A Call for Multidisciplinary AI Research.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Efficient Customer Service Combining Human Operators and Virtual Agents.

[BibT_eX]

[DOI]

CoRR, 2022

Robust Solutions for Multi-Defender Stackelberg Security Games.

[BibT_eX]

[DOI]

Dolev Mutzari

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Fair and Truthful Giveaway Lotteries.

[BibT_eX]

[DOI]

Tal Arbiv

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2020

Envy-Free Division of Land.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

2019

Temporal Information Design in Contests.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Approval voting with costly information.

[BibT_eX]

[DOI]

Michael Gershtein

Proceedings of the First International Conference on Distributed Artificial Intelligence, 2019

Selective Information Disclosure in Contests.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Double Auctions in Markets for Multiple Kinds of Goods.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Tractable (Simple) Contests.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

MUDA: A Truthful Multi-Unit Double-Auction Mechanism.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Distributed Matching with Mixed Maximum-Minimum Utilities.

[BibT_eX]

[DOI]

Amos Azaria

ACM Trans. Economics and Comput., 2017

2016

Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting.

[BibT_eX]

[DOI]

Orit Arzi

Soc. Choice Welf., 2016

Demand-flow of agents with gross-substitute valuations.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2016

Fair Division (Dagstuhl Seminar 16232).

[BibT_eX]

[DOI]

Jérôme Lang

Ariel D. Procaccia

Dagstuhl Reports, 2016

Envy-Free Cake-Cutting in Two Dimensions.

[BibT_eX]

[DOI]

CoRR, 2016

A Random-Sampling Double-Auction Mechanism.

[BibT_eX]

[DOI]

CoRR, 2016

Efficiency and fairness in team search with self-interested agents.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2016

SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

2015

Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

The Efficiency of Fair Division with Connected Pieces.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

Fair and Square: Cake-Cutting in Two Dimensions.

[BibT_eX]

[DOI]

CoRR, 2015

Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Envy-Free Cake-Cutting in Two Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Exploration costs as a means for improving performance in multiagent systems.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2014

Automated agents for reward determination for human work in crowdsourcing applications.

[BibT_eX]

[DOI]

Amos Azaria

Auton. Agents Multi Agent Syst., 2014

Auctioning a cake: truthful auctions of heterogeneous divisible goods.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Physical search problems with probabilistic knowledge.

[BibT_eX]

[DOI]

Artif. Intell., 2013

Computing socially-efficient cake divisions.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012

Quasi-distinct parsing and optimal compression methods.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Dotted interval graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

On the evaluation of election outcomes under uncertainty.

[BibT_eX]

[DOI]

Noam Hazon

Michael J. Wooldridge

Artif. Intell., 2012

The benefits of search costs in multiagent exploration.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Automated Strategies for Determining Rewards for Human Work.

[BibT_eX]

[DOI]

Amos Azaria

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Finding witnesses by peeling.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Throw One's Cake --- and Have It Too

[BibT_eX]

[DOI]

Orit Arzi

CoRR, 2011

Throw One's Cake - and Eat It Too.

[BibT_eX]

[DOI]

Orit Arzi

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.

[BibT_eX]

[DOI]

Yehuda Lindell

J. Cryptol., 2010

Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

On agent types in coalition formation problems.

[BibT_eX]

[DOI]

Tammar Shrot

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Search Costs as a Means for Improving Market Performance.

[BibT_eX]

[DOI]

Proceedings of the Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets, 2010

2009

Approximate string matching with address bit errors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Efficient computations of l1 and l∞ rearrangement distances.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Pattern matching with address errors: Rearrangement distances.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2009

Collaborative Multi Agent Physical Search with Probabilistic Knowledge.

[BibT_eX]

[DOI]

Noam Hazon

Proceedings of the IJCAI 2009, 2009

Easy and hard coalition resource game formation problems: a parameterized complexity analysis.

[BibT_eX]

[DOI]

Tammar Shrot

Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008

Fixed Structure Complexity.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Physical Search Problems Applying Economic Search Models.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Optimization of probe coverage for high-resolution oligonucleotide aCGH.

[BibT_eX]

[DOI]

Doron Lipson

Zohar Yakhini

Bioinform., 2007

Efficient Computations of l1 and linfinity Rearrangement Distances.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2007

2006

Function Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Visual information extraction.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2006

Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis.

[BibT_eX]

[DOI]

J. Comput. Biol., 2006

2005

Maximal Association Rules: A Tool for Mining Associations in Text.

[BibT_eX]

[DOI]

J. Intell. Inf. Syst., 2005

Designing optimally multiplexed SNP genotyping assays.

[BibT_eX]

[DOI]

Efrat Manisterski

Zohar Yakhini

J. Comput. Syst. Sci., 2005

Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler.

[BibT_eX]

[DOI]

Distributed Comput., 2005

Dotted interval graphs and high throughput genotyping.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

TEG: a hybrid approach to information extraction.

[BibT_eX]

[DOI]

Proceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, 2004

2003

A Statistical Theory for Quantitative Association Rules.

[BibT_eX]

[DOI]

Yehuda Lindell

J. Intell. Inf. Syst., 2003

Function Matching: Algorithms, Applications, and a Lower Bound.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Everlasting security in the bounded storage model.

[BibT_eX]

[DOI]

Yan Zong Ding

IEEE Trans. Inf. Theory, 2002

Structural extraction from visual layout of documents.

[BibT_eX]

[DOI]

Binyamin Rosenfeld

Ronen Feldman

Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, 2002

A Comparative Study of Information Extraction Strategies.

[BibT_eX]

[DOI]

Ronen Feldman

Michal Finkelstein-Landau

Eyal Hurvitz

Yizhar Regev

Ariel Yaroshevich

Proceedings of the Computational Linguistics and Intelligent Text Processing, 2002

2001

Linear-Consistency Testing.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

A Domain Independent Environment for Creating Information Extraction Modules.

[BibT_eX]

[DOI]

Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, 2001

2000

On the cost of recomputing: Tight bounds on pebbling with faults.

[BibT_eX]

[DOI]

Judit Bar-Ilan

Uriel Feige

Theor. Comput. Sci., 2000

Pattern Matching with Swaps.

[BibT_eX]

[DOI]

J. Algorithms, 2000

1999

Borders: An Efficient Algorithm for Association Generation in Dynamic Databases.

[BibT_eX]

[DOI]

J. Intell. Inf. Syst., 1999

Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers.

[BibT_eX]

[DOI]

Avivit Kapah-Levy

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Text Mining via Information Extraction.

[BibT_eX]

[DOI]

Proceedings of the Principles of Data Mining and Knowledge Discovery, 1999

Circle Graphs: New Visualization Tools for Text-Mining.

[BibT_eX]

[DOI]

Proceedings of the Principles of Data Mining and Knowledge Discovery, 1999

Information Theoretically Secure Communication in the Limited Storage Space Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1999

1998

An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm.

[BibT_eX]

[DOI]

Yuval Rabani

SIAM J. Comput., 1998

TextVis: An Integrated Visual Environment for Text Mining.

[BibT_eX]

[DOI]

Proceedings of the Principles of Data Mining and Knowledge Discovery, 1998

Trend Graphs: Visualizing the Evolution of Concept Relationships in Large Document Collections.

[BibT_eX]

[DOI]

Proceedings of the Principles of Data Mining and Knowledge Discovery, 1998

Knowledge Management: A Text Mining Approach.

[BibT_eX]

[DOI]

Proceedings of the PAKM 98, 1998

Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1998

1997

Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems.

[BibT_eX]

[DOI]

Lisa Zhang

Inf. Comput., 1997

Efficient Asynchronous Consensus with the Weak Adversary Scheduler.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), 1997

Efficient Algorithms for Discovering Frequent Sets in Incremental Databases.

[BibT_eX]

Proceedings of the Workshop on Research Issues on Data Mining and Knowledge Discovery, 1997

1996

Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Fault Tolerant Data Structures.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Improved Bounds for All Optical Routing.

[BibT_eX]

[DOI]

Yuval Rabani

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994

Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

1993

Computing with low degree networks: shared memory implementation and dynamic Fault-Tolerance (חשוב מקבילי ברשתות דלילות.).

[BibT_eX]

[DOI]

PhD thesis, 1993

Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

On Message Proof Systems with Known Space Verifiers.

[BibT_eX]

[DOI]

Uriel Feige

Proceedings of the Advances in Cryptology, 1993

1992

Computing with Faulty Arrays

[BibT_eX]

[DOI]

Michael Ben-Or

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Improved Memory Utilization in Deterministic PRAM Simulation.

[BibT_eX]

[DOI]

Assaf Schuster

J. Parallel Distributed Comput., 1991

Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract)

[BibT_eX]

[DOI]