English
Related papers

Related papers: Resource allocation with costly participation

200 papers

We study the problem of selling a resource through an auction mechanism. The winning buyer in turn develops this resource to generate profit. Two forms of payment are considered: charging the winning buyer a one-time payment, or an initial…

Computer Science and Game Theory · Computer Science 2012-07-27 Vineet Abhishek , Bruce Hajek , Steven R. Williams

On ad exchange platforms the place for advertisement is sold through different kinds of auctions. However, it is not uncommon the situation where the seller repeatedly encounters only one buyer, thus the posted price auction degenerates…

Computer Science and Game Theory · Computer Science 2019-02-05 Nikita Kalinin

All-pay auctions, a common mechanism for various human and agent interactions, suffers, like many other mechanisms, from the possibility of players' failure to participate in the auction. We model such failures, and fully characterize…

Computer Science and Game Theory · Computer Science 2017-02-15 Yoad Lewenberg , Omer Lev , Yoram Bachrach , Jeffrey S. Rosenschein

Richman games are zero-sum games, where in each turn players bid in order to determine who will play next [Lazarus et al.'99]. We extend the theory to impartial general-sum two player games called \emph{bidding games}, showing the existence…

Computer Science and Game Theory · Computer Science 2018-08-13 Gil Kalai , Reshef Meir , Moshe Tennenholtz

In classic auction theory, reserve prices are known to be effective for improving revenue for the auctioneer against quasi-linear utility maximizing bidders. The introduction of reserve prices, however, usually do not help improve total…

Computer Science and Game Theory · Computer Science 2021-11-05 Santiago Balseiro , Yuan Deng , Jieming Mao , Vahab Mirrokni , Song Zuo

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

We study revenue maximization in multi-item auctions, where bidders have subadditive valuations over independent items. Providing a simple mechanism that is approximately revenue-optimal in this setting is a major open problem in mechanism…

Computer Science and Game Theory · Computer Science 2023-10-13 Yang Cai , Ziyun Chen , Jinzhao Wu

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

Recurring auctions are ubiquitous for selling durable assets like artworks and homes, with follow-up auctions held for unsold items. We investigate such auctions theoretically and empirically. Theoretical analysis demonstrates that…

Theoretical Economics · Economics 2025-02-19 Shanglyu Deng , Qiyao Zhou

We study revenue optimization in a repeated auction between a single seller and a single buyer. Traditionally, the design of repeated auctions requires strong modeling assumptions about the bidder behavior, such as it being myopic, infinite…

Computer Science and Game Theory · Computer Science 2019-03-12 Shipra Agrawal , Constantinos Daskalakis , Vahab Mirrokni , Balasubramanian Sivan

A special case of Myerson's classic result describes the revenue-optimal equilibrium when a seller offers a single item to a buyer. We study a repeated sales extension of this model: a seller offers to sell a single fresh copy of an item to…

Computer Science and Game Theory · Computer Science 2019-03-12 Nikhil R. Devanur , Yuval Peres , Balasubramanian Sivan

We study sequential procurement auctions where the sellers are provided with a ``best and final offer'' (BAFO) strategy. This strategy allows each seller $i$ to effectively ``freeze'' their price while remaining active in the auction, and…

Computer Science and Game Theory · Computer Science 2025-03-17 Vasilis Gkatzelis , Randolph Preston McAfee , Renato Paes Leme

Inspired by Internet ad auction applications, we study the problem of allocating a single item via an auction when bidders place very different values on the item. We formulate this as the problem of prior-free auction and focus on…

Computer Science and Game Theory · Computer Science 2009-09-30 Vahab Mirrokni , S. Muthukrishnan , Uri Nadav

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 study mechanisms for selling a single item when buyers have private costs for participating in the mechanism. An agent's participation cost can also be interpreted as an outside option value that she must forego to participate. This…

Computer Science and Game Theory · Computer Science 2023-11-07 Yannai A. Gonczarowski , Nicole Immorlica , Yingkai Li , Brendan Lucier

We consider a dynamic mechanism design problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a…

Computer Science and Game Theory · Computer Science 2024-10-04 Alireza Fallah , Michael I. Jordan , Annie Ulichney

The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good mechanisms for risk-averse sellers. As is standard in the…

Computer Science and Game Theory · Computer Science 2010-04-02 Mukund Sundararajan , Qiqi Yan

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

We present a general framework for designing approximately revenue-optimal mechanisms for multi-item additive auctions, which applies to both truthful and non-truthful auctions. Given a (not necessarily truthful) single-item auction format…

Computer Science and Game Theory · Computer Science 2022-09-23 Constantinos Daskalakis , Maxwell Fishelson , Brendan Lucier , Vasilis Syrgkanis , Santhoshini Velusamy

We study a seller who sells a single good to multiple bidders with uncertainty over the joint distribution of bidders' valuations, as well as bidders' higher-order beliefs about their opponents. The seller only knows the (possibly…

Theoretical Economics · Economics 2022-02-16 Ethan Che
‹ Prev 1 2 3 10 Next ›