English
Related papers

Related papers: A Geometric Analysis of Gains from Trade

200 papers

We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…

Probability · Mathematics 2007-05-23 Mathew D. Penrose , J. E. Yukich

In online bilateral trade, a platform posts prices to incoming pairs of buyers and sellers that have private valuations for a certain good. If the price is lower than the buyers' valuation and higher than the sellers' valuation, then a…

Computer Science and Game Theory · Computer Science 2024-05-24 François Bachoc , Nicolò Cesa-Bianchi , Tommaso Cesari , Roberto Colomboni

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

In this paper, we study the two-facility location game on a line with optional preference where the acceptable set of facilities for each agent could be different and an agent's cost is his distance to the closest facility within his…

Data Structures and Algorithms · Computer Science 2019-07-23 Minming Li , Pinyan Lu , Yuhao Yao , Jialin Zhang

In this paper, we show a tight approximation guarantee for budget-feasible mechanisms with an additive buyer. We propose a new simple randomized mechanism with approximation ratio of $2$, improving the previous best known result of $3$. Our…

Computer Science and Game Theory · Computer Science 2020-07-22 Nick Gravin , Yaonan Jin , Pinyan Lu , Chenhao Zhang

The celebrated Myerson--Satterthwaite theorem shows that in bilateral trade, no mechanism can be simultaneously fully efficient, Bayesian incentive compatible (BIC), and budget balanced (BB). This naturally raises the question of how…

Machine Learning · Computer Science 2026-03-10 Yang Cai , Vineet Gupta , Zun Li , Aranyak Mehta

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

Inspired by Internet ad auction applications, we study the problem of allocating a single item via an auction when bidders place very different values on the item. We formulate this as the problem of prior-free auction and focus on…

Computer Science and Game Theory · Computer Science 2009-09-30 Vahab Mirrokni , S. Muthukrishnan , Uri Nadav

The seminal impossibility result of Myerson and Satterthwaite (1983) states that for bilateral trade, there is no mechanism that is individually rational (IR), incentive compatible (IC), weakly budget balanced, and efficient. This has led…

Computer Science and Game Theory · Computer Science 2018-02-23 Moshe Babaioff , Yang Cai , Yannai A. Gonczarowski , Mingfei Zhao

We study the problem of designing a two-sided market (double auction) to maximize the gains from trade (social welfare) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our goal is to do so for an…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

We consider one buyer and one seller. For a bundle $(t,q)\in [0,\infty[\times [0,1]=\mathbb{Z}$, $q$ either refers to the wining probability of an object or a share of a good, and $t$ denotes the payment that the buyer makes. We define…

Computer Science and Game Theory · Computer Science 2024-10-25 Mridu Prabal Goswami

We focus on a permutation betting market under parimutuel call auction model where traders bet on the final ranking of n candidates. We present a Proportional Betting mechanism for this market. Our mechanism allows the traders to bet on any…

Computer Science and Game Theory · Computer Science 2008-12-18 Shipra Agrawal , Zizhuo Wang , Yinyu Ye

Consider an exchange mechanism which accepts diversified offers of various commodities and redistributes everything it receives. We impose certain conditions of fairness and convenience on such a mechanism and show that it admits unique…

Computer Science and Game Theory · Computer Science 2024-09-24 Pradeep Dubey , Siddhartha Sahi , Martin Shubik

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

Consider the following toy problem. There are $m$ rectangles and $n$ points on the plane. Each rectangle $R$ is a consumer with budget $B_R$, who is interested in purchasing the cheapest item (point) inside R, given that she has enough…

Computer Science and Game Theory · Computer Science 2012-07-25 Parinya Chalermsook , Khaled Elbassioni , Danupon Nanongkai , He Sun

We study bilateral trade between two strategic agents. The celebrated result of Myerson and Satterthwaite states that in general, no incentive-compatible, individually rational and weakly budget balanced mechanism can be efficient. I.e., no…

Computer Science and Game Theory · Computer Science 2021-11-08 Yuan Deng , Jieming Mao , Balasubramanian Sivan , Kangning Wang

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 consider a one-dimensional "gas" of inelastically colliding particles where kinetic energy is dissipated by the excitation of vibrational degrees of freedom. In our model the coefficient of restitution is a stochastic quantity whose…

Condensed Matter · Physics 2007-05-23 Goetz Giese

Robust mechanism design is a rising alternative to Bayesian mechanism design, which yields designs that do not rely on assumptions like full distributional knowledge. We apply this approach to mechanisms for selling a single item, assuming…

Computer Science and Game Theory · Computer Science 2022-05-24 Nir Bachrach , Inbal Talgam-Cohen

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