English
Related papers

Related papers: Perfect Bayesian Equilibria in Repeated Sales

200 papers

We study the problem of characterizing revenue optimal auctions for single-minded buyers. Each buyer is interested only in a specific bundle of items and has a value for the same. Both his bundle and its value are his private information.…

Computer Science and Game Theory · Computer Science 2010-09-14 Vineet Abhishek , Bruce Hajek

The intuition that profit is optimized by maximizing marginal revenue is a guiding principle in microeconomics. In the classical auction theory for agents with linear utility and single-dimensional preferences, Bulow and Roberts (1989) show…

Computer Science and Game Theory · Computer Science 2014-06-06 Saeed Alaei , Hu Fu , Nima Haghpanah , Jason Hartline

This paper studies Markov perfect equilibria in a repeated duopoly model where sellers choose algorithms. An algorithm is a mapping from the competitor's price to own price. Once set, algorithms respond quickly. Customers arrive randomly…

Theoretical Economics · Economics 2022-07-04 Rohit Lamba , Sergey Zhuk

We study a version of the classical Cayley-Moser optimal stopping problem, in which a seller must sell an asset by a given deadline, with the offers, which are independent random variables with a known distribution, arriving at random…

Probability · Mathematics 2025-11-05 Guy Katriel

We study the Bayesian coarse correlated equilibrium (BCCE) of continuous and discretised first-price and all-pay auctions under the standard symmetric independent private-values model. Our study is motivated by the question of how the…

Computer Science and Game Theory · Computer Science 2024-11-19 Mete Şeref Ahunbay , Martin Bichler

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

A double auction game with an infinite number of buyers and sellers is introduced. All sellers posses one unit of a good, all buyers desire to buy one unit. Each seller and each buyer has a private valuation of the good. The distribution of…

Computer Science and Game Theory · Computer Science 2012-10-23 Matthijs Ruijgrok

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

Myerson derived a simple and elegant solution to the single-parameter revenue-maximization problem in his seminal work on optimal auction design assuming the usual model of quasi-linear utilities. In this paper, we consider a slight…

Computer Science and Game Theory · Computer Science 2016-01-27 Amy Greenwald , Takehiro Oyakawa , Vasilis Syrgkanis

We consider a seller faced with buyers which have the ability to delay their decision, which we call patience. Each buyer's type is composed of value and patience, and it is sampled i.i.d. from a distribution. The seller, using posted…

Computer Science and Game Theory · Computer Science 2022-06-28 Eitan-Hai Mashiah , Idan Attias , Yishay Mansour

Very few exact solutions are known for the monopolist's $k$-item $n$-buyer maximum revenue problem with additive valuation in which $k, n >1$ and the buyers $i$ have independent private distributions $F^j_i$ on items $j$. In this paper we…

Computer Science and Game Theory · Computer Science 2016-07-14 Andrew Chi-Chih Yao

In the multi-unit pricing problem, multiple units of a single item are for sale. A buyer's valuation for $n$ units of the item is $v \min \{ n, d\} $, where the per unit valuation $v$ and the capacity $d$ are private information of the…

Computer Science and Game Theory · Computer Science 2017-04-18 Nikhil R. Devanur , Nima Haghpanah , Christos-Alexandros Psomas

We study single-item single-unit Bayesian posted price auctions, where buyers arrive sequentially and their valuations for the item being sold depend on a random, unknown state of nature. The seller has complete knowledge of the actual…

Computer Science and Game Theory · Computer Science 2022-03-30 Matteo Castiglioni , Giulia Romano , Alberto Marchesi , Nicola Gatti

Time or money? That is a question! In this paper, we consider this dilemma in the pricing regime, in which we try to find the optimal pricing scheme for identical items with heterogenous time-sensitive buyers. We characterize the…

Computer Science and Game Theory · Computer Science 2024-02-23 Zhengyang Liu , Liang Shan , Zihe Wang

We consider a principal seller with $m$ heterogeneous products to sell to an additive buyer over independent items. The principal can offer an arbitrary menu of product bundles, but faces competition from smaller and more agile single-item…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Linda Cai , Brendan Lucier

We consider two canonical Bayesian mechanism design settings. In the single-item setting, we prove tight approximation ratio for anonymous pricing: compared with Myerson Auction, it extracts at least $\frac{1}{2.62}$-fraction of revenue;…

Computer Science and Game Theory · Computer Science 2018-11-05 Yaonan Jin , Pinyan Lu , Qi Qi , Zhihao Gavin Tang , Tao Xiao

This paper considers Bayesian revenue maximization in the $k$-unit setting, where a monopolist seller has $k$ copies of an indivisible item and faces $n$ unit-demand buyers (whose value distributions can be non-identical). Four basic…

Computer Science and Game Theory · Computer Science 2022-07-22 Yaonan Jin , Shunhua Jiang , Pinyan Lu , Hengjie Zhang

We study the revenue maximization problem of a seller with n heterogeneous items for sale to a single buyer whose valuation function for sets of items is unknown and drawn from some distribution D. We show that if D is a distribution over…

Computer Science and Game Theory · Computer Science 2018-07-05 Aviad Rubinstein , S. Matthew Weinberg

We analyze a nonlinear pricing model where the seller controls both product pricing (screening) and buyer information about their own values (persuasion). We prove that the optimal mechanism always consists of finitely many signals and…

Theoretical Economics · Economics 2025-03-11 Dirk Bergemann , Tibor Heumann , Stephen Morris

We consider the problem of computing a (pure) Bayes-Nash equilibrium in the first-price auction with continuous value distributions and discrete bidding space. We prove that when bidders have independent subjective prior beliefs about the…

Computer Science and Game Theory · Computer Science 2023-03-06 Aris Filos-Ratsikas , Yiannis Giannakopoulos , Alexandros Hollender , Philip Lazos , Diogo Poças