#### Filter Results:

- Full text PDF available (33)

#### Publication Year

2007

2017

- This year (2)
- Last 5 years (23)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Deferred-acceptance auctions are auctions for binary single-parameter mechanism design problems whose allocation rule can be implemented using an adaptive reverse greedy algorithm. Milgrom and Segal [2014] recently introduced these auctions and proved that they satisfy a remarkable list of incentive guarantees: in addition to being dominant-strategy… (More)

- Paul Dütting, Thomas Kesselheim
- EC
- 2015

The algorithmic requirements for dominant strategy incentive compatibility, or truthfulness, are well understood. Is there a similar characterization of algorithms that when combined with a suitable payment rule yield near-optimal welfare in all equilibria? We address this question by providing a tight characterization of a (possibly randomized) mechanism's… (More)

- Paul Dütting, Monika Henzinger, Ingmar Weber
- WWW
- 2011

Auctions are widely used on the Web. Applications range from sponsored search to platforms such as eBay. In these and in many other applications the auctions in use are single-/multi-item auctions with unit demand. The main drawback of standard mechanisms for this type of auctions, such as VCG and GSP, is the <i>limited expressiveness</i> that they offer to… (More)

A fundamental result in mechanism design theory, the so-called revelation principle, asserts that for many questions concerning the existence of mechanisms with a given outcome one can restrict attention to truthful direct-revelation mechanisms. In practice, however, many mechanisms use a restricted message space. This motivates the study of the tradeoffs… (More)

- Paul Dütting, Felix A. Fischer, Pichayut Jirapinyo, John K. Lai, Benjamin Lubin, David C. Parkes
- ACM Trans. Economics and Comput.
- 2012

In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requirement with the goal of minimizing expected ex post regret, we are able to adapt statistical machine learning techniques to the design of payment rules. This computational approach… (More)

Designing double auctions is a complex problem, especially when there are restrictions on the sets of buyers and sellers that may trade with one another. The goal of this paper is to develop ``black-box reductions'' from double-auction design to the exhaustively-studied problem of designing single-sided mechanisms.
We consider several desirable properties… (More)

- Paul Dütting, Monika Henzinger, Martin Starnberger
- WINE
- 2013

The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maximizes social welfare is the VCG mechanism. For many valuation spaces computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We… (More)

- Paul Dütting, Robert D. Kleinberg
- ESA
- 2015

Consider a gambler and a prophet who observe a sequence of independent, non-negative numbers. The gambler sees the numbers one-by-one whereas the prophet sees the entire sequence at once. The goal of both is to decide on fractions of each number they want to keep so as to maximize the weighted fractional sum of the numbers chosen. The classic result of… (More)

- Paul Dütting, Monika Henzinger, Ingmar Weber
- Theor. Comput. Sci.
- 2009

We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions ui,j(pj) expressing his utility of being matched to item j at price pj . For this setting we prove that a bidder optimal outcome always exists, even when the utility functions are non-linear and noncontinuous. We give sufficient conditions… (More)

It is desirable for an economic mechanism that its properties hold in a robust way across multiple equilibria and under varying assumptions regarding the information available to the participants. In this paper we focus on the design of position auctions and seek mechanisms that guarantee high revenue in every efficient equilibrium under both complete and… (More)