English
Related papers

Related papers: Single-Item Auctions with a Monopolist Intermediar…

200 papers

In this paper, we introduce a Bayesian revenue-maximizing mechanism design model where the items have fixed, exogenously-given prices. Buyers are unit-demand and have an ordinal ranking over purchasing either one of these items at its given…

Computer Science and Game Theory · Computer Science 2020-10-16 Will Ma

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 revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently distributed. We focus on general joint distributions, seeking…

Computer Science and Game Theory · Computer Science 2012-05-15 Christos Papadimitriou , George Pierrakos

We study the optimal mechanism design problem faced by a market intermediary who makes revenue by connecting buyers and sellers. We first show that the optimal intermediation protocol has substantial structure: it is the solution to an…

Computer Science and Game Theory · Computer Science 2012-10-12 Kamal Jain , Christopher A. Wilkens

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 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

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 consider the problem of a single seller repeatedly selling a single item to a single buyer (specifically, the buyer has a value drawn fresh from known distribution $D$ in every round). Prior work assumes that the buyer is fully rational…

Computer Science and Game Theory · Computer Science 2017-11-28 Mark Braverman , Jieming Mao , Jon Schneider , S. Matthew Weinberg

We study auction design in a setting where agents can communicate over a censorship-resistant broadcast channel like the ones we can implement over a public blockchain. We seek to design credible, strategyproof auctions in a model that…

Computer Science and Game Theory · Computer Science 2024-09-04 Tarun Chitra , Matheus V. X. Ferreira , Kshitij Kulkarni

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

Motivated by applications such as cloud computing, gig platforms, and blockchain auctions, we study optimal selling mechanisms for dynamic markets with stochastic supply and demand. In our model, buyers with private valuations and…

Theoretical Economics · Economics 2026-02-18 Yeon-Koo Che , Andrew B. Choi

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

Two sellers compete to sell identical products to a single buyer. Each seller chooses an arbitrary mechanism, possibly involving lotteries, to sell their product. The utility-maximizing buyer can choose to participate in one or both…

Computer Science and Game Theory · Computer Science 2025-05-27 Brendan Lucier , Raghuvansh R. Saxena

We study revenue optimization pricing algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation. We show that, in the case when both the seller and the buyer…

Computer Science and Game Theory · Computer Science 2018-05-08 Arsenii Vanunts , Alexey Drutsa

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 the information design problem in a single-unit auction setting. The information designer controls independent private signals according to which the buyers infer their binary private values. Assuming that the seller adopts the…

Theoretical Economics · Economics 2022-10-28 Yi-Chun Chen , Xiangqian Yang

When agents with independent priors bid for a single item, Myerson's optimal auction maximizes expected revenue, whereas Vickrey's second-price auction optimizes social welfare. We address the natural question of trade-offs between the two…

Computer Science and Game Theory · Computer Science 2012-05-15 Ilias Diakonikolas , Christos Papadimitriou , George Pierrakos , Yaron Singer

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

We study the optimal behavior of a bidder in a real-time auction subject to the requirement that a specified collections of heterogeneous items be acquired within given time constraints. The problem facing this bidder is cast as a…

Computational Engineering, Finance, and Science · Computer Science 2021-11-17 Ryan J. Kinnear , Ravi R. Mazumdar , Peter Marbach

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 ›