English
Related papers

Related papers: On Multi-Dimensional Gains from Trade Maximization

200 papers

In various markets where sellers compete in price, price oscillations are observed rather than convergence to equilibrium. Such fluctuations have been empirically observed in the retail market for gasoline, in airline pricing and in the…

Computer Science and Game Theory · Computer Science 2015-04-28 Moshe Babaioff , Renato Paes Leme , Balasubramanian Sivan

Optimal mechanism design enjoys a beautiful and well-developed theory, and also a number of killer applications. Rules of thumb produced by the field influence everything from how governments sell wireless spectrum licenses to how the major…

Computer Science and Game Theory · Computer Science 2014-09-23 Tim Roughgarden

In this paper, we introduce a Bayesian revenue-maximizing mechanism design model where the items have fixed, exogenously-given prices. Buyers are unit-demand and have an ordinal ranking over purchasing either one of these items at its given…

Computer Science and Game Theory · Computer Science 2020-10-16 Will Ma

We study a real-time bidding problem resulting from a set of contractual obligations stipulating that a firm win a specified number of heterogeneous impressions or ad placements over a defined duration in a real-time auction. The contracts…

Systems and Control · Electrical Eng. & Systems 2020-12-21 R. J. Kinnear , R. R. Mazumdar , P. Marbach

A seminal theorem of Myerson and Satterthwaite (1983) proves that, in a game of bilateral trade between a single buyer and a single seller, no mechanism can be simultaneously individually-rational, budget-balanced, incentive-compatible and…

Computer Science and Game Theory · Computer Science 2017-11-23 Erel Segal-Halevi , Avinatan Hassidim

We consider the problem of welfare maximization in two-sided markets using simple mechanisms that are prior-independent. The Myerson-Satterthwaite impossibility theorem shows that even for bilateral trade, there is no feasible (IR,…

Computer Science and Game Theory · Computer Science 2019-12-24 Moshe Babaioff , Kira Goldner , Yannai A. Gonczarowski

This paper studies convex duality in optimal investment and contingent claim valuation in markets where traded assets may be subject to nonlinear trading costs and portfolio constraints. Under fairly general conditions, the dual expressions…

Mathematical Finance · Quantitative Finance 2016-03-10 Teemu Pennanen , Ari-Pekka Perkkiö

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 repeated bilateral trade when the valuations of the sellers and the buyers are contextual. More precisely, the agents' valuations are given by the inner product of a context vector with two unknown $d$-dimensional vectors -- one…

Computer Science and Game Theory · Computer Science 2026-02-16 Romain Cosson , Federico Fusco , Anupam Gupta , Stefano Leonardi , Renato Paes Leme , Matteo Russo

In multi-item screening, optimal selling mechanisms are challenging to characterize and implement, even with full knowledge of valuation distributions. In this paper, we aim to develop tractable, interpretable, and implementable mechanisms…

Theoretical Economics · Economics 2025-10-20 Shixin Wang

We study multi-item profit maximization when there is an underlying distribution over buyers' values. In practice, a full description of the distribution is typically unavailable, so we study the setting where the mechanism designer only…

Machine Learning · Computer Science 2023-05-09 Maria-Florina Balcan , Tuomas Sandholm , Ellen Vitercik

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

Computer Science and Game Theory · Computer Science 2024-12-17 Mridu Prabal Goswami

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

We provide an elementary proof that revenue-maximizing mechanisms exist in multi-parameter settings whenever the distribution of valuations has finite expectation.

Computer Science and Game Theory · Computer Science 2026-01-07 Sergiu Hart , Noam Nisan

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

Consider a seller with m heterogeneous items for sale to a single additive buyer whose values for the items are arbitrarily correlated. It was previously shown that, in such settings, distributions exist for which the seller's optimal…

Computer Science and Game Theory · Computer Science 2018-12-03 Christos-Alexandros Psomas , Ariel Schvartzman , S. Matthew Weinberg

We investigate online pricing in two-sided markets where a platform repeatedly posts prices based on binary accept/reject feedback to maximize gains-from-trade (GFT) or profit. We characterize the regret achievable across three mechanism…

Computer Science and Game Theory · Computer Science 2026-02-13 Yiding Feng , Mengfan Ma , Bo Peng , Zongqi Wan

We model the role of an online platform disrupting a market with unit-demand buyers and unit-supply sellers. Each seller can transact with a subset of the buyers whom she already knows, as well as with any additional buyers to whom she is…

Computer Science and Game Theory · Computer Science 2024-06-12 Luca D'Amico-Wong , Yannai A. Gonczarowski , Gary Qiurui Ma , David C. Parkes

We study multi-product monopoly pricing where the seller jointly designs the selling mechanism and the information structure for the buyer to learn his values. Unlike the case with exogenous information, we show that when the seller…

Computer Science and Game Theory · Computer Science 2025-10-29 Yang Cai , Yingkai Li , Jinzhao Wu

We study fair division of indivisible goods in a single-parameter environment. In particular, we develop truthful social welfare maximizing mechanisms for fairly allocating indivisible goods. Our fairness guarantees are in terms of solution…

Computer Science and Game Theory · Computer Science 2019-01-29 Siddharth Barman , Ganesh Ghalme , Shweta Jain , Pooja Kulkarni , Shivika Narang
‹ Prev 1 4 5 6 7 8 10 Next ›