English
Related papers

Related papers: Screening with Persuasion

200 papers

We study information disclosure in competitive markets with adverse selection. Sellers privately observe product quality, with higher quality entailing higher production costs, while buyers trade at the market-clearing price after observing…

Theoretical Economics · Economics 2025-10-03 Andrea Di Giovan Paolo , Jose Higueras

We consider a dynamic pricing problem for repeated contextual second-price auctions with multiple strategic buyers who aim to maximize their long-term time discounted utility. The seller has limited information on buyers' overall demand…

Machine Learning · Computer Science 2023-02-08 Negin Golrezaei , Patrick Jaillet , Jason Cheuk Nam Liang

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

I consider an environment in which a decision maker faces uncertainty and privately holds information in the form of a signal about the true state of the world. The decision maker purchases additional information from a data broker before…

Theoretical Economics · Economics 2026-03-02 Arlindo Skënderaj

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

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

Most work in mechanism design assumes that buyers are risk neutral; some considers risk aversion arising due to a non-linear utility for money. Yet behavioral studies have established that real agents exhibit risk attitudes which cannot be…

Computer Science and Game Theory · Computer Science 2018-03-13 Shuchi Chawla , Kira Goldner , J. Benjamin Miller , Emmanouil Pountourakis

We study robustly optimal mechanisms for selling multiple items. The seller maximizes revenue against a worst-case distribution of a buyer's valuations within a set of distributions, called an "ambiguity" set. We identify the exact forms of…

Theoretical Economics · Economics 2024-08-26 Yeon-Koo Che , Weijie Zhong

We consider a monopolist seller facing a single buyer with additive valuations over n heterogeneous, independent items. It is known that in this important setting optimal mechanisms may require randomization [HR12], use menus of infinite…

Computer Science and Game Theory · Computer Science 2015-11-17 Aviad Rubinstein

A ubiquitous learning problem in today's digital market is, during repeated interactions between a seller and a buyer, how a seller can gradually learn optimal pricing decisions based on the buyer's past purchase responses. A fundamental…

Computer Science and Game Theory · Computer Science 2021-10-06 Quinlan Dawkins , Minbiao Han , Haifeng Xu

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 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 consider the design of a revenue-optimal mechanism when two items are available to be sold to a single buyer whose valuation is uniformly distributed over an arbitrary rectangle $[c_1,c_1+b_1]\times[c_2,c_2+b_2]$ in the positive…

Computer Science and Game Theory · Computer Science 2019-03-06 D. Thirumulanathan , Rajesh Sundaresan , Y Narahari

Consider a market where a seller owns an item for sale and a buyer wants to purchase it. Each player has private information, known as their type. It can be costly and difficult for the players to reach an agreement through direct…

Computer Science and Game Theory · Computer Science 2024-10-29 Zhikang Fan , Weiran Shen

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

Using duality theory techniques we derive simple, closed-form formulas for bounding the optimal revenue of a monopolist selling many heterogeneous goods, in the case where the buyer's valuations for the items come i.i.d. from a uniform…

Computer Science and Game Theory · Computer Science 2015-10-14 Yiannis Giannakopoulos

We provide an elementary proof that revenue-maximizing mechanisms exist in multi-parameter settings whenever the distribution of valuations has finite expectation.

Computer Science and Game Theory · Computer Science 2026-01-07 Sergiu Hart , Noam Nisan

A seller is pricing identical copies of a good to a stream of unit-demand buyers. Each buyer has a value on the good as his private information. The seller only knows the empirical value distribution of the buyer population and chooses the…

Computer Science and Game Theory · Computer Science 2023-05-12 Siddhartha Banerjee , Kamesh Munagala , Yiheng Shen , Kangning Wang