English
Related papers

Related papers: Prior-Free Clock Auctions for Bidders with Interde…

200 papers

In today's economy, selling a new zero-marginal cost product is a real challenge, as it is difficult to determine a product's "correct" sales price based on its profit and dissemination. As an example, think of the price of a new app or…

Trading and Market Microstructure · Quantitative Finance 2021-08-03 Daniel Fraiman

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

We investigate approximately optimal mechanisms in settings where bidders' utility functions are non-linear; specifically, convex, with respect to payments (such settings arise, for instance, in procurement auctions for energy). We provide…

Computer Science and Game Theory · Computer Science 2017-02-23 Amy Greenwald , Takehiro Oyakawa , Vasilis Syrgkanis

We study the equilibria of uniform price auctions where many asymmetric bidders have flat demands up to their respective quantity constraints. We present an iterative procedure that systematically finds an equilibrium outcome as well as an…

Theoretical Economics · Economics 2026-04-09 Kiho Yoon

We study the revenue comparison problem of auctions when the seller has a maxmin expected utility preference. The seller holds a set of priors around some reference belief, interpreted as an approximating model of the true probability law…

Theoretical Economics · Economics 2022-11-24 Sosung Baik , Sung-Ha Hwang

We consider the problem of designing auctions which maximize consumer surplus (i.e., the social welfare minus the payments charged to the buyers). In the consumer surplus maximization problem, a seller with a set of goods faces a set of…

Computer Science and Game Theory · Computer Science 2025-03-18 Tomer Ezra , Daniel Schoepflin , Ariel Shaulker

We study the limits of an information intermediary in the classical Bayesian auction, where a revenue-maximizing seller sells one item to $n$ buyers with independent private values. In addition, we have an intermediary who knows the buyers'…

Computer Science and Game Theory · Computer Science 2022-05-20 Reza Alijani , Siddhartha Banerjee , Kamesh Munagala , Kangning Wang

We study independent private values auction environments in which the auctioneer's revenue depends nonlinearly on bidders' interim winning probabilities. Our framework accommodates heterogeneity among bidders and places no ad hoc…

Theoretical Economics · Economics 2026-02-23 Pasha Andreyanov , Ilia Krasikov , Alex Suzdaltsev

We study the classic setting of envy-free pricing, in which a single seller chooses prices for its many items, with the goal of maximizing revenue once the items are allocated. Despite the large body of work addressing such settings, most…

Computer Science and Game Theory · Computer Science 2017-05-03 Elliot Anshelevich , Koushik Kar , Shreyas Sekar

Welfare maximization in bilateral trade has been extensively studied in recent years. Previous literature obtained incentive-compatible approximation mechanisms only for the private values case. In this paper, we study welfare maximization…

Computer Science and Game Theory · Computer Science 2025-07-01 Shahar Dobzinski , Alon Eden , Kira Goldner , Ariel Shaulker , Thodoris Tsilivis

In economics, there are many ways to describe the interaction between a "seller" and a "buyer". The most common one, with which we interact almost every day, is selling for a fixed price. This option is perfect for selling a mass product,…

General Finance · Quantitative Finance 2024-07-10 O. A. Malafeyev , I. E. Khomenko

This paper extends the incomplete model of Haile and Tamer (2003) from static English auctions to sequential English auctions. Because bidders may wait for future opportunities, the static condition that bidders do not let rivals win at…

Econometrics · Economics 2026-05-15 Dongwoo Kim , Kyoo il Kim , Pallavi Pal

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

Randomized mechanisms, which map a set of bids to a probability distribution over outcomes rather than a single outcome, are an important but ill-understood area of computational mechanism design. We investigate the role of randomized…

Computer Science and Game Theory · Computer Science 2009-04-17 Patrick Briest , Shuchi Chawla , Robert Kleinberg , S. Matthew Weinberg

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

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

We study the power and limitations of posted prices in multi-unit markets, where agents arrive sequentially in an arbitrary order. We prove upper and lower bounds on the largest fraction of the optimal social welfare that can be guaranteed…

Computer Science and Game Theory · Computer Science 2020-02-18 Tomer Ezra , Michal Feldman , Tim Roughgarden , Warut Suksompong

We study the bilateral trade problem where a seller owns a single indivisible item, and a potential buyer seeks to purchase it. Previous mechanisms for this problem only considered the case where the values of the buyer and the seller are…

Computer Science and Game Theory · Computer Science 2024-04-17 Shahar Dobzinski , Ariel Shaulker

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

Traditionally, the Bayesian optimal auction design problem has been considered either when the bidder values are i.i.d., or when each bidder is individually identifiable via her value distribution. The latter is a reasonable approach when…

Computer Science and Game Theory · Computer Science 2023-07-11 Nikhil R. Devanur , Zhiyi Huang , Christos-Alexandros Psomas