English
Related papers

Related papers: Random Double Auction: A Robust Bilateral Trading …

200 papers

In practice, auction data are often endogenously censored and anonymous, revealing only limited outcome statistics rather than full bid profiles. We study robust auction design when the seller observes only aggregated, anonymous order…

Theoretical Economics · Economics 2026-02-26 Zhihao Gavin Tang , Shixin Wang

We introduce a dynamic mechanism design problem in which the designer wants to offer for sale an item to an agent, and another item to the same agent at some point in the future. The agent's joint distribution of valuations for the two…

Computer Science and Game Theory · Computer Science 2023-05-22 Christos Papadimitriou , George Pierrakos , Christos-Alexandros Psomas , Aviad Rubinstein

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

The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good mechanisms for risk-averse sellers. As is standard in the…

Computer Science and Game Theory · Computer Science 2010-04-02 Mukund Sundararajan , Qiqi Yan

Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. We study this problem from the perspective of a broker, in a regret…

Computer Science and Game Theory · Computer Science 2025-09-29 Simone Di Gregorio , Paul Dütting , Federico Fusco , Chris Schwiegelshohn

We consider a dynamic mechanism design problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a…

Computer Science and Game Theory · Computer Science 2024-10-04 Alireza Fallah , Michael I. Jordan , Annie Ulichney

A seller is selling a pair of divisible complementary goods to an agent. The agent consumes the goods only in a specific ratio and freely disposes of excess in either goods. The value of the bundle and the ratio are private information of…

Theoretical Economics · Economics 2022-07-15 Komal Malik , Kolagani Paramahamsa

In this work, we study spectrum auction problem where each request from secondary users has spatial, temporal, and spectral features. With the requests of secondary users and the reserve price of the primary user, our goal is to design…

Networking and Internet Architecture · Computer Science 2013-05-29 Yu-e Sun , He Huang , Xiang-Yang Li , Zhili Chen , Wei Yang , Hongli Xu , Liusheng Huang

We study the bilateral trade problem where a seller owns a single indivisible item, and a potential buyer seeks to purchase it. Previous mechanisms for this problem only considered the case where the values of the buyer and the seller are…

Computer Science and Game Theory · Computer Science 2024-04-17 Shahar Dobzinski , Ariel Shaulker

We continue the study of the performance for fixed-price mechanisms in the bilateral trade problem, and improve approximation ratios of welfare-optimal mechanisms in several settings. Specifically, in the case where only the buyer…

Computer Science and Game Theory · Computer Science 2023-03-29 Zhengyang Liu , Zeyu Ren , Zihe Wang

We study risk-free bidding strategies in combinatorial auctions with incomplete information. Specifically, what is the maximum profit that a complement-free (subadditive) bidder can guarantee in a multi-item combinatorial auction? Suppose…

Computer Science and Game Theory · Computer Science 2021-11-30 Vishnu V. Narayan , Gautam Rayaprolu , Adrian Vetta

We study robust mechanisms to sell a common-value good. We assume that the mechanism designer knows the prior distribution of the buyers' common value but is unsure of the buyers' information structure about the common value. We use linear…

Computer Science and Game Theory · Computer Science 2016-11-22 Songzi Du

A seller wants to sell an item to $n$ buyers. Buyer valuations are drawn i.i.d. from a distribution unknown to the seller; the seller only knows that the support is included in $[a, b]$. To be robust, the seller chooses a DSIC mechanism…

Theoretical Economics · Economics 2025-01-03 Jerry Anunrojwong , Santiago R. Balseiro , Omar Besbes

We consider the bilateral trade problem, in which two agents trade a single indivisible item. It is known that the only dominant-strategy truthful mechanism is the fixed-price mechanism: given commonly known distributions of the buyer's…

Computer Science and Game Theory · Computer Science 2021-12-21 Zi Yang Kang , Francisco Pernice , Jan Vondrák

We consider the fundamental scenario where a single item is to be sold to one of two agents. Both agents draw their valuation for the item from the same probability distribution. However, only one of them submits a bid to the mechanism. The…

Computer Science and Game Theory · Computer Science 2025-08-26 Ioannis Caragiannis , Georgios Kalantzis

In a seminal paper, McAfee (1992) presented the first dominant strategy truthful mechanism for double auction. His mechanism attains nearly optimal gain-from-trade when the market is sufficiently large. However, his mechanism may leave…

Computer Science and Game Theory · Computer Science 2016-09-07 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann

We study the classic bilateral trade setting. Myerson and Satterthwaite show that there is no Bayesian incentive compatible and budget-balanced mechanism that obtains the gains from trade of the first-best mechanism. Consider the…

Computer Science and Game Theory · Computer Science 2021-11-16 Moshe Babaioff , Shahar Dobzinski , Ron Kupfer

Bilateral trade is one of the most natural and important forms of economic interaction: A seller has a single, indivisible item for sale, and a buyer is potentially interested. The two parties typically have different, privately known…

Computer Science and Game Theory · Computer Science 2023-12-20 Yixuan Even Xu , Hanrui Zhang , Vincent Conitzer

We study the problem of fair online resource allocation via non-monetary mechanisms, where multiple agents repeatedly share a resource without monetary transfers. Previous work has shown that every agent can guarantee $1/2$ of their ideal…

Computer Science and Game Theory · Computer Science 2025-05-27 David X. Lin , Daniel Hall , Giannis Fikioris , Siddhartha Banerjee , Éva Tardos

We study collusion in a second-price auction with two bidders in a dynamic environment. One bidder can make a take-it-or-leave-it collusion proposal, which consists of both an offer and a request of bribes, to the opponent. We show that…

Theoretical Economics · Economics 2021-05-31 Jingfeng Lu , Zongwei Lu , Christian Riis