Related papers: Credible, Truthful, and Two-Round (Optimal) Auctio…

In this paper, we study online double auctions, where multiple sellers and multiple buyers arrive and depart dynamically to exchange one commodity. We show that there is no deterministic online double auction that is truthful and…

In this paper, we introduce a novel, non-recursive, maximal matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. It differs from the usual equilibrium matching, which clears a market at the…

In multi-item screening, optimal selling mechanisms are challenging to characterize and implement, even with full knowledge of valuation distributions. In this paper, we aim to develop tractable, interpretable, and implementable mechanisms…

We study reserve prices in auctions with independent private values when bidders are expectations-based loss averse. We find that the optimal public reserve price excludes fewer bidder types than under risk neutrality. Moreover, we show…

We provide simple and approximately revenue-optimal mechanisms in the multi-item multi-bidder settings. We unify and improve all previous results, as well as generalize the results to broader cases. In particular, we prove that the better…

We show that the multiplicative weight update method provides a simple recipe for designing and analyzing optimal Bayesian Incentive Compatible (BIC) auctions, and reduces the time complexity of the problem to pseudo-polynomial in…

In this paper, we introduce a Bayesian revenue-maximizing mechanism design model where the items have fixed, exogenously-given prices. Buyers are unit-demand and have an ordinal ranking over purchasing either one of these items at its given…

We construct prior-free auctions with constant-factor approximation guarantees with ordered bidders, in both unlimited and limited supply settings. We compare the expected revenue of our auctions on a bid vector to the monotone price…

We study the communication complexity of welfare maximization in combinatorial auctions with $m$ items and two subadditive bidders. A $\frac{1}{2}$-approximation can be guaranteed by a trivial randomized protocol with zero communication, or…

The long-term success of cryptocurrencies largely depends on the incentive compatibility provided to the validators. Bribery attacks, facilitated trustlessly via smart contracts, threaten this foundation. This work introduces, implements,…

Although the iterative double auction has been widely used in many different applications, one of the major problems in its current implementations is that they rely on a trusted third party to handle the auction process. This imposes the…

Auctions via social network, pioneered by Li et al. (2017), have been attracting considerable attention in the literature of mechanism design for auctions. However, no known mechanism has satisfied strategy-proofness, non-deficit,…

We are interested in the problem of optimal commitments in rank-and-bid based auctions, a general class of auctions that include first price and all-pay auctions as special cases. Our main contribution is a novel approach to solve for…

We study the optimal auction design problem when bidders' preferences follow the maxmin expected utility model. We suppose that each bidder's set of priors consists of beliefs close to the seller's belief, where "closeness" is defined by a…

If you recommend a product to me and I buy it, how much should you be paid by the seller? And if your sole interest is to maximize the amount paid to you by the seller for a sequence of recommendations, how should you recommend optimally if…

Automated bidding to optimize online advertising with various constraints, e.g. ROI constraints and budget constraints, is widely adopted by advertisers. A key challenge lies in designing algorithms for non-truthful mechanisms with ROI…

Strategyproofness in network auctions requires that bidders not only report their valuations truthfully, but also do their best to invite neighbours from the social network. In contrast to canonical auctions, where the value-monotone…

We consider a two-way trading problem, where investors buy and sell a stock whose price moves within a certain range. Naturally they want to maximize their profit. Investors can perform up to $k$ trades, where each trade must involve the…

Recently, a randomized mechanism has been discovered [Dughmi, Roughgarden and Yan; STOC'11] for combinatorial auctions that is truthful in expectation and guarantees a (1-1/e)-approximation to the optimal social welfare when players have…

Single-shot auctions are commonly used as a means to sell goods, for example when selling ad space or allocating radio frequencies, however devising mechanisms for auctions with multiple bidders and multiple items can be complicated. It has…