English
Related papers

Related papers: Descending Price Optimally Coordinates Search

200 papers

Repeated multi-unit auctions, where a seller allocates multiple identical items over many rounds, are common mechanisms in electricity markets and treasury auctions. We compare the two predominant formats: uniform-price and discriminatory…

Computer Science and Game Theory · Computer Science 2025-10-23 Marius Potfer , Vianney Perchet

We study how a budget-constrained bidder should learn to adaptively bid in repeated first-price auctions to maximize her cumulative payoff. This problem arose due to an industry-wide shift from second-price auctions to first-price auctions…

Computer Science and Game Theory · Computer Science 2026-04-14 Yige Wang , Jiashuo Jiang

The optimal price of each firm falls in the search cost of consumers, in the limit to the monopoly price, despite the exit of lower-value consumers in response to costlier search. Exit means that fewer inframarginal consumers remain. The…

Theoretical Economics · Economics 2020-04-06 Sander Heinsalu

We present our results on Uniform Price Auctions, one of the standard sealed-bid multi-unit auction formats, for selling multiple identical units of a single good to multi-demand bidders. Contrary to the truthful and economically efficient…

Computer Science and Game Theory · Computer Science 2013-06-20 Evangelos Markakis , Orestis Telelis

We present a deterministic exploration mechanism for sponsored search auctions, which enables the auctioneer to learn the relevance scores of advertisers, and allows advertisers to estimate the true value of clicks generated at the auction…

Computer Science and Game Theory · Computer Science 2011-11-10 Sudhir Kumar Singh , Vwani P. Roychowdhury , Milan Bradonjić , Behnam A. Rezaei

In the standard single-dimensional model of position auctions, bidders agree on the relative values of the positions and each of them submits a single bid that is interpreted in terms of these values. Motivated by current practice in…

Computer Science and Game Theory · Computer Science 2018-06-22 Paul Dütting , Felix Fischer , David C. Parkes

We initiate the study of how auction design affects the division of surplus among buyers. We propose a parsimonious measure for equity and apply it to the family of standard auctions for homogeneous goods. Our surplus-equitable mechanism is…

Theoretical Economics · Economics 2024-11-14 Simon Finster , Patrick Loiseau , Simon Mauras , Mathieu Molina , Bary Pradelski

How does competition in markets for information affect the creation and division of surplus? We study this question in a search environment in which an agent searches sequentially for a high-quality good and learns about the quality of…

Theoretical Economics · Economics 2026-05-26 Teddy Mekonnen , Bobak Pakzad-Hurson

Auctions are important mechanisms extensively implemented in various markets, e.g., search engines' keyword auctions, antique auctions, etc. Finding an optimal auction mechanism is extremely difficult due to the constraints of imperfect…

Machine Learning · Computer Science 2025-07-28 Jiayin Liu , Chenglong Zhang

A prevalent assumption in auction theory is that the auctioneer has full control over the market and that the allocation she dictates is final. In practice, however, agents might be able to resell acquired items in an aftermarket. A…

Theoretical Economics · Economics 2022-11-17 Moshe Babaioff , Nicole Immorlica , Yingkai Li , Brendan Lucier

The first-price auction is popular in practice for its simplicity and transparency. Moreover, its potential virtues grow in complex settings where incentive compatible auctions may generate little or no revenue. Unfortunately, the…

Computer Science and Game Theory · Computer Science 2013-04-30 Darrell Hoy , Kamal Jain , Christopher A. Wilkens

The goal of an auction is to determine commodity prices such that all participants are perfectly happy. Such a solution is called a competitive equilibrium and does not exist in general. For this reason we are interested in solutions which…

Optimization and Control · Mathematics 2013-09-04 Johannes C. Müller

We analyze the optimal information design in a click-through auction with fixed valuations per click, but stochastic click-through rates. While the auctioneer takes as given the auction rule of the click-through auction, namely the…

Theoretical Economics · Economics 2021-05-21 Dirk Bergemann , Paul Duetting , Renato Paes Leme , Song Zuo

Learning to bid in repeated first-price auctions is a fundamental problem at the interface of game theory and machine learning, which has seen a recent surge in interest due to the transition of display advertising to first-price auctions.…

Computer Science and Game Theory · Computer Science 2024-07-09 Rachitesh Kumar , Jon Schneider , Balasubramanian Sivan

We study two standard multi-unit auction formats for allocating multiple units of a single good to multi-demand bidders. The first one is the Discriminatory Auction, which charges every winner his winning bids. The second is the Uniform…

Computer Science and Game Theory · Computer Science 2016-05-02 Bart de Keijzer , Evangelos Markakis , Guido Schäfer , Orestis Telelis

We study multi-unit auctions in which bidders have limited knowledge of opponent strategies and values. We characterize optimal prior-free bids; these bids minimize the maximal loss in expected utility resulting from uncertainty surrounding…

Theoretical Economics · Economics 2023-05-02 Bernhard Kasberger , Kyle Woodward

A common economic process is crowdsearch, wherein a group of agents is invited to search for a valuable physical or virtual object, e.g. creating and patenting an invention, solving an open scientific problem, or identifying vulnerabilities…

Theoretical Economics · Economics 2023-11-16 Hans Gersbach , Akaki Mamageishvili , Fikri Pitsuwan

First-price auctions are one of the most popular mechanisms for selling goods and services, with applications ranging from display advertising to timber sales. Unlike their close cousin, the second-price auction, first-price auctions do not…

Computer Science and Game Theory · Computer Science 2025-02-17 Rachitesh Kumar , Omar Mouchtaki

This paper examines knapsack auctions as a method to solve the knapsack problem with incomplete information, where object values are private and sizes are public. We analyze three auction types-uniform price (UP), discriminatory price (DP),…

Computer Science and Game Theory · Computer Science 2024-05-02 Peyman Khezr , Vijay Mohan , Lionel Page

In this paper, we study how a budget-constrained bidder should learn to bid adaptively in repeated first-price auctions to maximize cumulative payoff. This problem arises from the recent industry-wide shift from second-price auctions to…

Computer Science and Game Theory · Computer Science 2026-04-14 Yige Wang , Jiashuo Jiang