English
Related papers

Related papers: Sequential Auctions and Externalities

200 papers

Simultaneous item auctions are simple procedures for allocating items to bidders with potentially complex preferences over different item sets. In a simultaneous auction, every bidder submits bids on all items simultaneously. The allocation…

Computer Science and Game Theory · Computer Science 2012-09-24 Michal Feldman , Hu Fu , Nick Gravin , Brendan Lucier

This paper studies an environment of simultaneous, separate, first-price auctions for complementary goods. Agents observe private values of each good before making bids, and the complementarity between goods is explicitly incorporated in…

Trading and Market Microstructure · Quantitative Finance 2013-12-11 Wiroy Shin

In many natural settings agents participate in multiple different auctions that are not simultaneous. In such auctions, future opportunities affect strategic considerations of the players. The goal of this paper is to develop a quantitative…

Computer Science and Game Theory · Computer Science 2012-06-22 Vasilis Syrgkanis , Eva Tardos

In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only…

Computer Science and Game Theory · Computer Science 2012-09-11 Zhiyi Huang , Nikhil R. Devanur , David Malec

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 study combinatorial auctions where each item is sold separately but simultaneously via a second price auction. We ask whether it is possible to efficiently compute in this game a pure Nash equilibrium with social welfare close to the…

Computer Science and Game Theory · Computer Science 2015-06-10 Shahar Dobzinski , Hu Fu , Robert Kleinberg

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

Sequential auctions for identical items with unit-demand, private-value buyers are common and often occur periodically without end, as new bidders replace departing ones. We model bidder uncertainty by introducing a probability that a…

Computer Science and Game Theory · Computer Science 2025-10-13 Amir Ban

In this work we consider selling items using a sequential first price auction mechanism. We generalize the assumption of conservative bidding to extensive form games (henceforth optimistic conservative bidding), and show that for both…

Computer Science and Game Theory · Computer Science 2015-02-02 Avinatan Hassidim , Yishay Mansour

We introduce draft auctions, which is a sequential auction format where at each iteration players bid for the right to buy items at a fixed price. We show that draft auctions offer an exponential improvement in social welfare at equilibrium…

Computer Science and Game Theory · Computer Science 2013-11-13 Nikhil R. Devanur , Jamie Morgenstern , Vasilis Syrgkanis

We study correlated equilibria and coarse equilibria of simple first-price single-item auctions in the simplest auction model of full information. Nash equilibria are known to always yield full efficiency and a revenue that is at least the…

Computer Science and Game Theory · Computer Science 2017-01-09 Michal Feldman , Brendan Lucier , Noam Nisan

We study a game with \emph{strategic} vendors who own multiple items and a single buyer with a submodular valuation function. The goal of the vendors is to maximize their revenue via pricing of the items, given that the buyer will buy the…

Computer Science and Game Theory · Computer Science 2014-08-04 Omer Lev , Joel Oren , Craig Boutilier , Jeffery S. Rosenschein

We study the efficiency of simple combinatorial auctions for the allocation of a set of items to a set of agents, with private subadditive valuation functions and budget constraints. The class we consider includes all auctions that allocate…

Computer Science and Game Theory · Computer Science 2020-07-29 Alexandros A. Voudouris

We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First, we consider item-bidding combinatorial…

Computer Science and Game Theory · Computer Science 2015-08-06 George Christodoulou , Alkmini Sgouritsa , Bo Tang

We model real-world data markets, where sellers post fixed prices and buyers are free to purchase from any set of sellers, as a simultaneous game. A key component here is the negative externality buyers induce on one another due to data…

Computer Science and Game Theory · Computer Science 2024-02-16 Safwan Hossain , Yiling Chen

We study equilibria in two-buyer sequential second-price (or first-price) auctions for identical goods. Buyers have weakly decreasing incremental values, and we make a behavioural no-overbidding assumption: the buyers do not bid above their…

Computer Science and Game Theory · Computer Science 2020-06-08 Mete Şeref Ahunbay , Brendan Lucier , Adrian Vetta

We consider a single buyer with a combinatorial preference that would like to purchase related products and services from different vendors, where each vendor supplies exactly one product. We study the general case where subsets of products…

Computer Science and Game Theory · Computer Science 2014-01-09 Moshe Babaioff , Noam Nisan , Renato Paes Leme

The all-pay auction, a classic competitive model, is widely applied in scenarios such as political elections, sports competitions, and research and development, where all participants pay their bids regardless of winning or losing. However,…

Theoretical Economics · Economics 2025-07-24 Yan Liu , Ying Qin , Zihe Wang

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

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
‹ Prev 1 2 3 10 Next ›