English
Related papers

Related papers: Multidimensional Screening with Precise Seller Inf…

200 papers

In this paper we consider multidimensional mechanism design problem for selling discrete substitutable items to a group of buyers. Previous work on this problem mostly focus on stochastic description of valuations used by the seller.…

Computer Science and Game Theory · Computer Science 2017-01-05 Maciej Drwal

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

Data buyers compete in a game of incomplete information about which a single data seller owns some payoff-relevant information. The seller faces a joint information- and mechanism-design problem: deciding which information to sell, while…

Computer Science and Game Theory · Computer Science 2024-11-18 Alessandro Bonatti , Munther Dahleh , Thibaut Horel , Amir Nouripour

A monopolist sells goods with possibly a characteristic consumers dislike (for instance, he sells random goods to risk averse agents), which does not affect the production costs. We investigate the question whether using undesirable goods…

Optimization and Control · Mathematics 2010-06-03 Aimé Lachapelle , Filippo Santambrogio

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 provide a characterization of revenue-optimal dynamic mechanisms in settings where a monopolist sells k items over k periods to a buyer who realizes his value for item i in the beginning of period i. We require that the mechanism…

Computer Science and Game Theory · Computer Science 2016-07-06 Itai Ashlagi , Constantinos Daskalakis , Nima Haghpanah

We study the envy free pricing problem faced by a seller who wishes to maximize revenue by setting prices for bundles of items. If there is an unlimited supply of items and agents are single minded then we show that finding the revenue…

Computer Science and Game Theory · Computer Science 2016-09-08 Amos Fiat , Amiram Wingarten

We consider markets consisting of a set of indivisible items, and buyers that have {\em sharp} multi-unit demand. This means that each buyer $i$ wants a specific number $d_i$ of items; a bundle of size less than $d_i$ has no value, while a…

Computer Science and Game Theory · Computer Science 2015-03-13 Ning Chen , Xiaotie Deng , Paul. W. Goldberg , Jinshan Zhang

A single unit of a good is sold to one of two bidders. Each bidder has either a high prior valuation or a low prior valuation for the good. Their prior valuations are independently and identically distributed. Each bidder may observe an…

Theoretical Economics · Economics 2022-05-10 Wanchang Zhang

A principal wishes to transact business with a multidimensional distribution of agents whose preferences are known only in the aggregate. Assuming a twist (= generalized Spence-Mirrlees single-crossing) hypothesis and that agents can choose…

Optimization and Control · Mathematics 2009-12-17 Alessio Figalli , Young-Heon Kim , Robert J. McCann

We study market interactions in which buyers are allowed to credibly reveal partial information about their types to the seller. Previous recent work has studied the special case of one buyer and one good, showing that such communication…

Computer Science and Game Theory · Computer Science 2022-05-05 Daniel Halpern , Gregory Kehne , Jamie Tucker-Foltz

Combining two or more items and selling them as one good, a practice called bundling, can be a very effective strategy for reducing the costs of producing, marketing, and selling goods. In this paper, we consider a form of multi-issue…

Multiagent Systems · Computer Science 2007-05-23 Koye Somefun , Tomas Klos , Han La Poutré

Selling a single item to $n$ self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximization. Since the optimal mechanisms are often impractical…

Computer Science and Game Theory · Computer Science 2024-11-06 Billy Jin , Thomas Kesselheim , Will Ma , Sahil Singla

A common practice in many auctions is to offer bidders an opportunity to improve their bids, known as a Best and Final Offer (BAFO) stage. This final bid can depend on new information provided about either the asset or the competitors. This…

Computer Science and Game Theory · Computer Science 2021-04-21 Galit Ashkenazi-Golan , Yevgeny Tsodikovich , Yannick Viossat

We consider a robust version of the revenue maximization problem, where a single seller wishes to sell $n$ items to a single unit-demand buyer. In this robust version, the seller knows the buyer's marginal value distribution for each item…

Computer Science and Game Theory · Computer Science 2020-08-27 Moshe Babaioff , Michal Feldman , Yannai A. Gonczarowski , Brendan Lucier , Inbal Talgam-Cohen

A defining feature of digital goods is that replication and degradation are costless: once a high-quality good is produced, low-quality versions can be created and distributed at no additional cost. This paper studies quality-based…

Theoretical Economics · Economics 2026-03-10 Pietro Dall'Ara , Elia Sartori

A seller offers an asset in a decentralised market. Buyers have private signals about their common value. I study whether the market becomes allocatively more efficient with (i) more buyers, (ii) better-informed buyers. Both increase the…

Theoretical Economics · Economics 2025-08-04 D. Carlos Akkar

Product bundling is a common selling mechanism used in online retailing. To set profitable bundle prices, the seller needs to learn consumer preferences from the transaction data. When customers purchase bundles or multiple products,…

Machine Learning · Statistics 2022-09-13 Ningyuan Chen , Setareh Farajollahzadeh , Guan Wang

We efficiently solve the optimal multi-dimensional mechanism design problem for independent bidders with arbitrary demand constraints when either the number of bidders is a constant or the number of items is a constant. In the first…

Computer Science and Game Theory · Computer Science 2011-12-20 Constantinos Daskalakis , S. Matthew Weinberg

We show that the mechanism-design problem for a monopolist selling multiple, heterogeneous objects to a buyer with ex ante symmetric and additive values is equivalent to the mechanism-design problem for a monopolist selling identical…

Theoretical Economics · Economics 2024-08-20 Sushil Bikhchandani , Debasis Mishra
‹ Prev 1 4 5 6 7 8 10 Next ›