English
Related papers

Related papers: Bilateral Trade with Correlated Values

200 papers

Randomized mechanisms, which map a set of bids to a probability distribution over outcomes rather than a single outcome, are an important but ill-understood area of computational mechanism design. We investigate the role of randomized…

Computer Science and Game Theory · Computer Science 2009-04-17 Patrick Briest , Shuchi Chawla , Robert Kleinberg , S. Matthew Weinberg

We consider the problem of maximizing revenue for a monopolist offering multiple items to multiple heterogeneous buyers. We develop a simple mechanism that obtains a constant factor approximation under the assumption that the buyers' values…

Computer Science and Game Theory · Computer Science 2016-08-10 Shuchi Chawla , J. Benjamin Miller

In many shopping scenarios, e.g., in online shopping, customers have a large menu of options to choose from. However, most of the buyers do not browse all the options and make decision after considering only a small part of the menu. To…

Computer Science and Game Theory · Computer Science 2018-02-15 Nick Gravin , Zhihao Gavin Tang

We consider a revenue-maximizing seller with $m$ heterogeneous items and a single buyer whose valuation $v$ for the items may exhibit both substitutes (i.e., for some $S, T$, $v(S \cup T) < v(S) + v(T)$) and complements (i.e., for some $S,…

Computer Science and Game Theory · Computer Science 2017-04-11 Alon Eden , Michal Feldman , Ophir Friedler , Inbal Talgam-Cohen , S. Matthew Weinberg

The problem of designing a profit-maximizing, Bayesian incentive compatible and individually rational mechanism with flexible consumers and costly heterogeneous supply is considered. In our setup, each consumer is associated with a…

Computer Science and Game Theory · Computer Science 2018-02-01 Shiva Navabi , Ashutosh Nayyar

The Bayesian persuasion paradigm of strategic communication models interaction between a privately-informed agent, called the sender, and an ignorant but rational agent, called the receiver. The goal is typically to design a (near-)optimal…

Computer Science and Game Theory · Computer Science 2021-06-21 Ronen Gradwohl , Niklas Hahn , Martin Hoefer , Rann Smorodinsky

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

The fair allocation of mixed goods, consisting of both divisible and indivisible goods, has been a prominent topic of study in economics and computer science. We define an allocation as fair if its utility vector minimizes a symmetric…

Computer Science and Game Theory · Computer Science 2024-07-10 Yasushi Kawase , Koichi Nishimura , Hanna Sumita

We study the problem of a seller dynamically pricing $d$ distinct types of indivisible goods, when faced with the online arrival of unit-demand buyers drawn independently from an unknown distribution. The goods are not in limited supply,…

Data Structures and Algorithms · Computer Science 2017-06-13 Aaron Roth , Aleksandrs Slivkins , Jonathan Ullman , Zhiwei Steven Wu

We initiate the study of multidimensional Bayesian utility maximization, focusing on the unit-demand setting where values are i.i.d. across both items and buyers. The seminal result of Hartline and Roughgarden '08 studies simple,…

Computer Science and Game Theory · Computer Science 2025-02-18 Kira Goldner , Taylor Lundy

We study bilateral trade with interdependent values as an informed-principal problem. The mechanism-selection game has multiple equilibria that differ with respect to principal's payoff and trading surplus. We characterize the equilibrium…

Theoretical Economics · Economics 2022-02-22 Takeshi Nishimura

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

Consider a trade market with one seller and multiple buyers. The seller aims to sell an indivisible item and maximize their revenue. This paper focuses on a simple and popular mechanism--the fixed-price mechanism. Unlike the standard…

Computer Science and Game Theory · Computer Science 2024-11-19 Zhikang Fan , Weiran Shen

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 consider a social planner faced with a stream of myopic selfish agents. The goal of the social planner is to maximize the social welfare, however, it is limited to using only information asymmetry (regarding previous outcomes) and cannot…

Computer Science and Game Theory · Computer Science 2019-05-15 Lee Cohen , Yishay Mansour

We study the revenue performance of sequential posted price mechanisms and some natural extensions, for a general setting where the valuations of the buyers are drawn from a correlated distribution. Sequential posted price mechanisms are…

Computer Science and Game Theory · Computer Science 2015-10-02 Marek Adamczyk , Allan Borodin , Diodato Ferraioli , Bart de Keijzer , Stefano Leonardi

With the rapid development of distributed energy resources, increasing number of residential and commercial users have been switched from pure electricity consumers to prosumers that can both consume and produce energy. To properly manage…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-09-15 Bing Liu , Furan Xie , Li Chai

We consider the problem of posting prices for unit-demand buyers if all $n$ buyers have identically distributed valuations drawn from a distribution with monotone hazard rate. We show that even with multiple items asymptotically optimal…

Computer Science and Game Theory · Computer Science 2021-07-02 Alexander Braun , Matthias Buttkus , Thomas Kesselheim

We design an expected polynomial-time, truthful-in-expectation, (1-1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our results apply to bidders with valuations that are m matroid rank…

Computer Science and Game Theory · Computer Science 2011-04-19 Shaddin Dughmi , Tim Roughgarden , Qiqi Yan

We study fair allocation of indivisible goods to agents with unequal entitlements. Fair allocation has been the subject of many studies in both divisible and indivisible settings. Our emphasis is on the case where the goods are indivisible…

Computer Science and Game Theory · Computer Science 2017-04-12 Alireza Farhadi , Mohammad Ghodsi , MohammadTaghi Hajiaghayi , Sebastien Lahaie , David Pennock , Masoud Seddighin , Saeed Seddighin , Hadi Yami