English
Related papers

Related papers: On Infinite Separations Between Simple and Optimal…

200 papers

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 study the revenue maximization problem of a seller with n heterogeneous items for sale to a single buyer whose valuation function for sets of items is unknown and drawn from some distribution D. We show that if D is a distribution over…

Computer Science and Game Theory · Computer Science 2018-07-05 Aviad Rubinstein , S. Matthew Weinberg

We consider a monopolist seller facing a single buyer with additive valuations over n heterogeneous, independent items. It is known that in this important setting optimal mechanisms may require randomization [HR12], use menus of infinite…

Computer Science and Game Theory · Computer Science 2015-11-17 Aviad Rubinstein

An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the…

Theoretical Economics · Economics 2020-08-27 Alex Suzdaltsev

We study revenue maximization in a buyer-seller setting where the seller has a single object and the buyer has both a private valuation and a private budget. Private budgets complicate the classic single-product monopoly problem, making…

Computer Science and Game Theory · Computer Science 2026-04-30 Juan Carlos Carbajal , Ahuva Mualem

We provide sufficient conditions for revenue maximization in a two-good monopoly where the buyer's values for the items come from independent (but not necessarily identical) distributions over bounded intervals. Under certain distributional…

Computer Science and Game Theory · Computer Science 2015-11-24 Yiannis Giannakopoulos , Elias Koutsoupias

We consider optimal mechanism design for the case with one buyer and two items. The buyer's valuations towards the two items are independent and additive. In this setting, optimal mechanism is unknown for general valuation distributions. We…

Computer Science and Game Theory · Computer Science 2014-04-30 Zihe Wang , Pingzhong Tang

A unified approach to derive optimal finite differences is presented which combines three critical elements for numerical performance especially for multi-scale physical problems, namely, order of accuracy, spectral resolution and…

Computational Physics · Physics 2019-10-23 Komal Kumari , Raktim Bhattacharya , Diego A. Donzis

For revenue and welfare maximization in single-dimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple in form, can perform surprisingly well compared to the…

Computer Science and Game Theory · Computer Science 2010-10-28 Qiqi Yan

We study revenue maximization by deterministic mechanisms for the simplest case for which Myerson's characterization does not hold: a single seller selling two items, with independently distributed values, to a single additive buyer. We…

Computer Science and Game Theory · Computer Science 2018-04-20 Moshe Babaioff , Noam Nisan , Aviad Rubinstein

We consider revenue-optimal mechanism design in the interdimensional setting, where one dimension is the 'value' of the buyer, and one is a 'type' that captures some auxiliary information. One setting is the FedEx Problem, for which FGKK…

Computer Science and Game Theory · Computer Science 2020-02-18 Nikhil Devanur , Kira Goldner , Raghuvansh Saxena , Ariel Schvartzman , S. Matthew Weinberg

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 the problem of designing mechanisms when agents' valuation functions are drawn from unknown and correlated prior distributions. In particular, we are given a prior distribution $\D$, and we are interested in designing a (truthful)…

Computer Science and Game Theory · Computer Science 2023-10-13 Anuran Makur , Marios Mertzanidis , Alexandros Psomas , Athina Terzoglou

Multi-item revenue-optimal mechanisms are known to be extremely complex, often offering buyers randomized lotteries of goods. In the standard buy-one model, it is known that optimal mechanisms can yield revenue infinitely higher than that…

Computer Science and Game Theory · Computer Science 2022-11-22 Sepehr Assadi , Vikram Kher , George Li , Ariel Schvartzman

We consider an economic environment where a seller wants to sell an indivisible unit of good to a buyer. We show that revenue from any strategy-proof and individually rational mechanism defined on closed intervals of rich single crossing…

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

Multi-item mechanisms can be very complex offering many different bundles to the buyer that could even be randomized. Such complexity is thought to be necessary as the revenue gaps between randomized and deterministic mechanisms, or…

Computer Science and Game Theory · Computer Science 2019-07-03 Shuchi Chawla , Yifeng Teng , Christos Tzamos

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

When selling many goods with independent valuations, we develop a distributionally robust framework, consisting of a two-player game between seller and nature. The seller has only limited knowledge about the value distribution. The seller…

Computer Science and Game Theory · Computer Science 2026-03-30 Tim S. G. van Eck , Pieter Kleer , Johan S. H. van Leeuwaarden

Using duality theory techniques we derive simple, closed-form formulas for bounding the optimal revenue of a monopolist selling many heterogeneous goods, in the case where the buyer's valuations for the items come i.i.d. from a uniform…

Computer Science and Game Theory · Computer Science 2015-10-14 Yiannis Giannakopoulos

In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Victor Korotkikh , Galina Korotkikh
‹ Prev 1 2 3 10 Next ›