#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2011

2019

- This year (11)
- Last 5 years (30)
- Last 10 years (40)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

The (men-proposing) deferred acceptance algorithm, which finds the men-optimal stable matching in a two-sided marriage market, is known to be strategy-proof for all men. This algorithm is now used… (More)

- Yannai A. Gonczarowski, Noam Nisan
- STOC
- 2016

We present a polynomial-time algorithm that, given samples from the unknown valuation distribution of each bidder, learns an auction that approximately maximizes the auctioneer's revenue in a variety… (More)

- Yannai A. Gonczarowski, Moshe Tennenholtz
- ArXiv
- 2014

Can noncooperative behaviour of merchants lead to a market allocation that prima facie seems anticompetitive? We introduce a model in which service providers aim at optimizing the number of customers… (More)

The Gale-Shapley algorithm for the Stable Marriage Problem is known to take $\Theta(n^2)$ steps to find a stable marriage in the worst case, but only $\Theta(n \log n)$ steps in the average case… (More)

In this work we derive a variant of the classic Glivenko-Cantelli Theorem, which asserts uniform convergence of the empirical Cumulative Distribution Function (CDF) to the CDF of the underlying… (More)

- Itai Ashlagi, Yannai A. Gonczarowski
- J. Economic Theory
- 2015

Many two-sided matching markets, from labor markets to school choice programs, use a clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is well known to be… (More)

- Moshe Babaioff, Yannai A. Gonczarowski, Noam Nisan
- STOC
- 2016

We consider a monopolist that is selling <i>n</i> items to a single additive buyer, where the buyerâs values for the items are drawn according to independent distributions… (More)

A protocol P is Pareto-optimal if no protocol Q can decide as fast as P for all adversaries, while allowing at least one process to decide strictly earlier, in at least one instance. Pareto optimal… (More)

- Yannai A. Gonczarowski
- STOC
- 2017

The question of the minimum menu-size for approximate (i.e., up-to-ε) Bayesian revenue maximization when selling two goods to an additive risk-neutral quasilinear buyer was introduced by Hart and… (More)

The unbeatability of a consensus protocol, introduced by Halpern, Moses and Waarts in [14], is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel… (More)