English
Related papers

Related papers: Robustly Optimal Mechanisms for Selling Multiple G…

200 papers

We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition…

Computer Science and Game Theory · Computer Science 2016-05-16 Georgios Amanatidis , Georgios Birmpas , Evangelos Markakis

We consider multi-item exchange markets in which agents want to receive one of their target bundles of resources. The model encompasses well-studied markets for kidney exchange, lung exchange, and multi-organ exchange. We identify a general…

Computer Science and Game Theory · Computer Science 2020-07-10 Haris Aziz

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

This article aims to introduce the paradigm of distributional robustness from the field of convex optimization to tackle optimal design problems under uncertainty. We consider realistic situations where the physical model, and thereby the…

Optimization and Control · Mathematics 2025-07-30 Charles Dapogny , Julien Prando , Boris Thibert

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

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 a repeated trading problem in which a mechanism designer facilitates trade between a single seller and multiple buyers. Our model generalizes the classic bilateral trade setting to a multi-buyer environment. Specifically, the…

Computer Science and Game Theory · Computer Science 2025-03-04 Anna Lunghi , Matteo Castiglioni , Alberto Marchesi

We study the power of price discrimination via an intermediary in bilateral trade, when there is a revenue-maximizing seller selling an item to a buyer with a private value drawn from a prior. Between the seller and the buyer, there is an…

Computer Science and Game Theory · Computer Science 2023-04-28 Shao-Heng Ko , Kamesh Munagala

The seller of an asset has the option to buy hard information about the value of the asset from an intermediary. The seller can then disclose the acquired information before selling the asset in a competitive market. We study how the…

Theoretical Economics · Economics 2020-10-19 S. Nageeb Ali , Nima Haghpanah , Xiao Lin , Ron Siegel

Bid shading has become a standard practice in the digital advertising industry, in which most auctions for advertising (ad) opportunities are now of first price type. Given an ad opportunity, performing bid shading requires estimating not…

Computer Science and Game Theory · Computer Science 2024-10-22 Yanlin Qu , Ravi Kant , Yan Chen , Brendan Kitts , San Gultekin , Aaron Flores , Jose Blanchet

This paper is concerned with personalized pricing models aimed at maximizing the expected revenues or profits for a single item. While it is essential for personalized pricing to predict the purchase probabilities for each consumer, these…

Optimization and Control · Mathematics 2024-07-23 Shunnosuke Ikeda , Naoki Nishimura , Noriyoshi Sukegawa , Yuichi Takano

We consider the fundamental problem of designing a truthful single-item auction with the challenging objective of extracting a large fraction of the highest agent valuation as revenue. Following a recent trend in algorithm design, we assume…

Computer Science and Game Theory · Computer Science 2024-01-25 Ioannis Caragiannis , Georgios Kalantzis

Since economic mechanisms are often applied to very different instances of the same problem, it is desirable to identify mechanisms that work well in a wide range of circumstances. We pursue this goal for a position auction setting and…

Computer Science and Game Theory · Computer Science 2013-07-22 Paul Duetting , Felix Fischer , David C. Parkes

A competitive market is modeled as a game of incomplete information. One player observes some payoff-relevant state and can sell (possibly noisy) messages thereof to the other, whose willingness to pay is contingent on their own beliefs. We…

Computer Science and Game Theory · Computer Science 2025-05-02 Thomas Falconer , Anubhav Ratha , Jalal Kazempour , Pierre Pinson , Maryam Kamgarpour

In many realistic problems of allocating resources, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We study the…

Computer Science and Game Theory · Computer Science 2014-05-27 Wei Huang , Jian Lou , Zhonghua Wen

This paper studies some basic problems in a multiple-object auction model using methodologies from theoretical computer science. We are especially concerned with situations where an adversary bidder knows the bidding algorithms of all the…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 Ming-Yang Kao , Junfeng Qi , Lei Tan

A patient seller aims to sell a good to an impatient buyer (i.e., one who discounts utility over time). The buyer will remain in the market for a period of time $T$, and her private value is drawn from a publicly known distribution. What is…

Computer Science and Game Theory · Computer Science 2023-02-14 Yuan Deng , Jieming Mao , Balasubramanian Sivan , Kangning Wang

We study the problem of selling information to a data-buyer who faces a decision problem under uncertainty. We consider the classic Bayesian decision-theoretic model pioneered by [Blackwell, 1951, 1953]. Initially, the data buyer has only…

Computer Science and Game Theory · Computer Science 2022-02-21 Dirk Bergemann , Yang Cai , Grigoris Velegkas , Mingfei Zhao

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

A seller chooses a reserve price in a second-price auction to maximize worst-case expected revenue when she knows only the mean of value distribution and an upper bound on either values themselves or variance. Values are private and iid.…

Theoretical Economics · Economics 2020-08-10 Alex Suzdaltsev