Liad Blumrosen

Algorithmica, April, 2024

2023

How bad is the merger paradox?

[BibT_eX]

[DOI]

Yehonatan Mizrahi

Theor. Comput. Sci., November, 2023

2021

(Almost) efficient mechanisms for bilateral trading.

[BibT_eX]

[DOI]

Games Econ. Behav., 2021

2017

Posting Prices with Unknown Distributions.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2017

Selling Complementary Goods: Dynamics, Efficiency and Revenue.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Approximating Gains-from-Trade in Bilateral Trading.

[BibT_eX]

[DOI]

Yehonatan Mizrahi

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Networks of Complements.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Auctions with online supply.

[BibT_eX]

[DOI]

Aaron Roth

Games Econ. Behav., 2015

Multilateral Deferred-Acceptance Mechanisms.

[BibT_eX]

[DOI]

Osnat Zohar

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

2014

Reallocation mechanisms.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Economics and Computation, 2014

2013

Mechanism design with a restricted action space.

[BibT_eX]

[DOI]

Michal Feldman

Games Econ. Behav., 2013

The communication burden of payment determination.

[BibT_eX]

[DOI]

Michael Schapira

Games Econ. Behav., 2013

2011

Only valuable experts can be valued.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010

Informational limitations of ascending combinatorial auctions.

[BibT_eX]

[DOI]

J. Econ. Theory, 2010

2009

On the Computational Power of Demand Queries.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

2008

Computationally-feasible truthful auctions for convex bundles.

[BibT_eX]

[DOI]

Games Econ. Behav., 2008

Posted prices vs. negotiations: an asymptotic analysis.

[BibT_eX]

[DOI]

Thomas Holenstein

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Informational overhead of incentive compatibility.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

2007

Welfare Maximization in Congestion Games.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2007

Auctions with Severely Bounded Communication.

[BibT_eX]

[DOI]

Ilya Segal

J. Artif. Intell. Res., 2007

Implementing the Maximum of Monotone Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Information and communication in mechanism design (אינפורמציה ותקשורת בתכנון מנגנונים.).

[BibT_eX]

[DOI]

PhD thesis, 2006

Implementation with a bounded action space.

[BibT_eX]

[DOI]

Michal Feldman

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

2005

On the computational power of iterative auctions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

2003

Multi-player and Multi-round Auctions with Severely Bounded Communication.

[BibT_eX]

[DOI]

Ilya Segal

Proceedings of the Algorithms, 2003

2002

Auctions with Severely Bounded Communication.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

On-Line Markets for Distributed Object Services: The MAJIC System.

[BibT_eX]

[DOI]

Lior Levy