English
Related papers

Related papers: Limits of Efficiency in Sequential Auctions

200 papers

We study the efficiency guarantees in the simple auction environment where the auctioneer has one unit of divisible good to be distributed among a number of budget constrained agents. With budget constraints, the social welfare cannot be…

Computer Science and Game Theory · Computer Science 2015-02-16 Pinyan Lu , Tao Xiao

We consider the problem of designing revenue-optimal auctions for selling two items and bidders' valuations are independent among bidders but negatively correlated among items. In this paper, we obtain the closed-form optimal auction for…

Computer Science and Game Theory · Computer Science 2016-06-03 Pingzhong Tang , Zihe Wang

In this work we are concerned with the design of efficient mechanisms while eliciting limited information from the agents. First, we study the performance of sampling approximations in facility location games. Our key result is to show that…

Computer Science and Game Theory · Computer Science 2022-08-26 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos

The optimal pricing problem is a fundamental problem that arises in combinatorial auctions. Suppose that there is one seller who has indivisible items and multiple buyers who want to purchase a combination of the items. The seller wants to…

Computer Science and Game Theory · Computer Science 2016-11-24 Takanori Maehara , Yasushi Kawase , Hanna Sumita , Katsuya Tono , Ken-ichi Kawarabayashi

This paper studies mechanism design for auctions with externalities on budgets, a novel setting where the budgets that bidders commit are adjusted due to the externality of the competitors' allocation outcomes-a departure from traditional…

Computer Science and Game Theory · Computer Science 2025-04-22 Yusen Zheng , Yukun Cheng , Chenyang Xu , Xiaotie Deng

A seller with one unit of a good faces N\geq3 buyers and a single competitor who sells one other identical unit in a second-price auction with a reserve price. Buyers who do not get the seller's good will compete in the competitor's…

Theoretical Economics · Economics 2021-10-26 Kenneth Hendricks , Thomas Wiseman

We study a class of procurement auctions with a budget constraint, where an auctioneer is interested in buying resources or services from a set of agents. Ideally, the auctioneer would like to select a subset of the resources so as to…

Computer Science and Game Theory · Computer Science 2017-10-10 Georgios Amanatidis , Georgios Birmpas , Evangelos Markakis

We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-maximizing auctions under this communication restriction. For…

Computer Science and Game Theory · Computer Science 2011-10-13 L. Blumrosen , N. Nisan , I. Segal

In lowest unique bid auctions, $N$ players bid for an item. The winner is whoever places the \emph{lowest} bid, provided that it is also unique. We use a grand canonical approach to derive an analytical expression for the equilibrium…

Computer Science and Game Theory · Computer Science 2015-05-28 Simone Pigolotti , Sebastian Bernhardsson , Jeppe Juul , Gorm Galster , Pierpaolo Vivo

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…

Computer Science and Game Theory · Computer Science 2012-12-13 Elias Koutsoupias , Stefano Leonardi , Tim Roughgarden

Developing efficient sequential bidding strategies for repeated auctions is an important practical challenge in various marketing tasks. In this setting, the bidding agent obtains information, on both the value of the item at sale and the…

Machine Learning · Computer Science 2021-03-01 Juliette Achddou , Olivier Cappé , Aurélien Garivier

While auction theory views bids and valuations as continuous variables, real-world auctions are necessarily discrete. In this paper, we use a combination of analytical and computational methods to investigate whether incorporating…

Theoretical Economics · Economics 2022-08-17 Itzhak Rasooly , Carlos Gavidia-Calderon

We revisit the well-studied problem of budget-feasible procurement, where a buyer with a strict budget constraint seeks to acquire services from a group of strategic providers (the sellers). During the last decade, several strategyproof…

Computer Science and Game Theory · Computer Science 2021-07-22 Eric Balkanski , Pranav Garimidi , Vasilis Gkatzelis , Daniel Schoepflin , Xizhi Tan

We model a procurement scenario in which two \textit{imperfect} bidders act simultaneously on behalf of a single buyer, a configuration common in display advertising and referred to as \textit{side-by-side bidding} but largely unexplored in…

Computer Science and Game Theory · Computer Science 2025-12-05 Benjamin Heymann

In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budget constraints. When only the valuations are private and the…

Computer Science and Game Theory · Computer Science 2009-04-23 Sayan Bhattacharya , Vincent Conitzer , Kamesh Munagala , Lirong Xia

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 consider the problem of finding the (unique) minimal Walrasian equilibrium price in multi-item, multi-unit auction models: there are multiple indivisible items for sale, with several units of each item, and a bidder may be interested in…

Combinatorics · Mathematics 2026-05-01 Kazuo Murota , Akiyoshi Shioura

We consider the question of whether collusion among bidders (a "bidding ring") can be supported in equilibrium of unrepeated first-price auctions. Unlike previous work on the topic such as that by McAfee and McMillan [1992] and Marshall and…

Computer Science and Game Theory · Computer Science 2016-08-31 Kevin Leyton-Brown , Moshe Tennenholtz , Navin Bhat , Yoav Shoham

We are interested in mechanisms that maximize social welfare. In [1] this problem was studied for multi-unit auctions with unit demand bidders and for the public project problem, and in each case social welfare undominated mechanisms in the…

Computer Science and Game Theory · Computer Science 2008-10-20 Krzysztof R. Apt , Vangelis Markakis

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