English
Related papers

Related papers: Mechanism Design for Auctions with Externalities o…

200 papers

Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been a lot of attention on the auction process and its game-theoretic aspects, our focus is on the advertisers. In particular,…

Data Structures and Algorithms · Computer Science 2007-05-23 Jon Feldman , S. Muthukrishnan , Martin Pal , Cliff Stein

This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential auctions, simultaneous auctions, and the Trading Agent…

Computer Science and Game Theory · Computer Science 2012-07-19 Amy Greenwald , Justin Boyan

This note pursues two primary objectives. First, we analyze the outcomes of an all-pay auction within a store where buyers with and without financial constraints arrive at varying rates, and where buyer types are private information.…

Theoretical Economics · Economics 2024-04-16 Cemil Selcuk

Robust mechanism design is a rising alternative to Bayesian mechanism design, which yields designs that do not rely on assumptions like full distributional knowledge. We apply this approach to mechanisms for selling a single item, assuming…

Computer Science and Game Theory · Computer Science 2022-05-24 Nir Bachrach , Inbal Talgam-Cohen

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

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

We consider some classical optimization problems in path planning and network transport, and we introduce new auction-based algorithms for their optimal and suboptimal solution. The algorithms are based on mathematical ideas that are…

Optimization and Control · Mathematics 2022-07-21 Dimitri Bertsekas

We study individual rational, Pareto optimal, and incentive compatible mechanisms for auctions with heterogeneous items and budget limits. For multi-dimensional valuations we show that there can be no deterministic mechanism with these…

Computer Science and Game Theory · Computer Science 2012-10-01 Paul Duetting , Monika Henzinger , Martin Starnberger

We study the problem of fair online resource allocation via non-monetary mechanisms, where multiple agents repeatedly share a resource without monetary transfers. Previous work has shown that every agent can guarantee $1/2$ of their ideal…

Computer Science and Game Theory · Computer Science 2025-05-27 David X. Lin , Daniel Hall , Giannis Fikioris , Siddhartha Banerjee , Éva Tardos

In many settings agents participate in multiple different auctions that are not necessarily implemented simultaneously. Future opportunities affect strategic considerations of the players in each auction, introducing externalities.…

Computer Science and Game Theory · Computer Science 2011-12-30 Renato Paes Leme , Vasilis Syrgkanis , Eva Tardos

Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling…

Computer Science and Game Theory · Computer Science 2017-10-10 Simina Brânzei , Aris Filos-Ratsikas , Peter Bro Miltersen , Yulong Zeng

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…

Machine Learning · Computer Science 2023-03-02 Alex Stein , Avi Schwarzschild , Michael Curry , Tom Goldstein , John Dickerson

In a multiple-object auction, every bidder tries to win as many objects as possible with a bidding algorithm. This paper studies position-randomized auctions, which form a special class of multiple-object auctions where a bidding algorithm…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 Yuyu Chen , Ming-Yang Kao , Hsueh-I Lu

We study the mechanism design problem of selling $k$ items to unit-demand buyers with private valuations for the items. A buyer either participates directly in the auction or is represented by an intermediary, who represents a subset of…

Computer Science and Game Theory · Computer Science 2021-11-23 Gagan Aggarwal , Kshipra Bhawalkar , Guru Guruganesh , Andres Perlroth

The majority of online marketplaces offer promotion programs to sellers to acquire additional customers for their products. These programs typically allow sellers to allocate advertising budgets to promote their products, with higher…

Computer Science and Game Theory · Computer Science 2025-02-05 Anastasiia Soboleva , Alexander Ledovsky , Yuriy Dorn , Egor Samosvat , Andrey Tikhanov , Fyodor Prazdnikov

We introduce several new estimation methods that leverage shape constraints in auction models to estimate various objects of interest, including the distribution of a bidder's valuations, the bidder's ex ante expected surplus, and the…

Econometrics · Economics 2019-12-17 Joris Pinkse , Karl Schurter

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

Since economic mechanisms are often applied to very different instances of the same problem, it is desirable to identify mechanisms that work well in a wide range of circumstances. We pursue this goal for a position auction setting and…

Computer Science and Game Theory · Computer Science 2013-07-22 Paul Duetting , Felix Fischer , David C. Parkes

We study the efficiency of sequential first-price item auctions at (subgame perfect) equilibrium. This auction format has recently attracted much attention, with previous work establishing positive results for unit-demand valuations and…

Computer Science and Game Theory · Computer Science 2013-09-11 Michal Feldman , Brendan Lucier , Vasilis Syrgkanis

We introduce the notion of rigidity in auction design and use it to analyze some fundamental aspects of mechanism design. We focus on single-item auctions where the values of the bidders are drawn from some (possibly correlated)…

Computer Science and Game Theory · Computer Science 2022-12-21 Shahar Dobzinski , Ariel Shaulker