English
Related papers

Related papers: On Simple Mechanisms for Dependent Items

200 papers

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

The classical multivariate extreme value theory tries to capture the extremal dependence between the components under a multivariate domain of attraction condition and it requires each of the components to be in the domain of attraction of…

Probability · Mathematics 2011-04-13 Rajat Subhra Hazra , Krishanu Maulik

We consider the revenue maximization problem of a monopolist via a non-Myersonian approach that could generalize to multiple items and multiple buyers. Although such an approach does not lead to any closed-form solution of the problem, it…

Computer Science and Game Theory · Computer Science 2017-11-30 Song Zuo

Finding the optimal (revenue-maximizing) mechanism to sell multiple items has been a prominent and notoriously difficult open problem. Existing work has mainly focused on deriving analytical results tailored to a particular class of…

Theoretical Economics · Economics 2026-01-09 Kento Hashimoto , Keita Kuwahara , Reo Nonaka

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

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

Distributionally robust stochastic optimization (DRSO) is a framework for decision-making problems under certainty, which finds solutions that perform well for a chosen set of probability distributions. Many different approaches for…

Optimization and Control · Mathematics 2017-01-17 Rui Gao , Anton J. Kleywegt

What fraction of the potential social surplus in an environment can be extracted by a revenue-maximizing monopolist? We investigate this problem in Bayesian single-parameter environments with independent private values. The precise answer…

Computer Science and Game Theory · Computer Science 2013-05-03 Robert Kleinberg , Yang Yuan

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

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 consider a principal seller with $m$ heterogeneous products to sell to an additive buyer over independent items. The principal can offer an arbitrary menu of product bundles, but faces competition from smaller and more agile single-item…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Linda Cai , Brendan Lucier

In the setup of selling one or more goods, various papers have shown, in various forms and for various purposes, that a small change in the distribution of a buyer's valuations may cause only a small change in the possible revenue that can…

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

We consider the problem of guaranteeing maximin-share (MMS) when allocating a set of indivisible items to a set of agents with fractionally subadditive (XOS) valuations. For XOS valuations, it has been previously shown that for some…

Computer Science and Game Theory · Computer Science 2023-10-24 Hannaneh Akrami , Kurt Mehlhorn , Masoud Seddighin , Golnoosh Shahkarami

We examine information structure design, also called "persuasion" or "signaling", in the presence of a constraint on the amount of communication. We focus on the fundamental setting of bilateral trade, which in its simplest form involves a…

Computer Science and Game Theory · Computer Science 2020-03-09 Shaddin Dughmi , David Kempe , Ruixin Qiang

We study individual rational, Pareto optimal, and incentive compatible mechanisms for auctions with heterogeneous items and budget limits. For multi-dimensional valuations we show that there can be no deterministic mechanism with these…

Computer Science and Game Theory · Computer Science 2012-10-01 Paul Duetting , Monika Henzinger , Martin Starnberger

We consider a revenue-maximizing single seller with $m$ items for sale to a single buyer whose value $v(\cdot)$ for the items is drawn from a known distribution $D$ of support $k$. A series of works by Cai et al. establishes that when each…

Computer Science and Game Theory · Computer Science 2020-07-13 Natalie Collina , S. Matthew Weinberg

A Markov tree is a probabilistic graphical model for a random vector indexed by the nodes of an undirected tree encoding conditional independence relations between variables. One possible limit distribution of partial maxima of samples from…

Methodology · Statistics 2021-01-19 Stefka Asenova , Gildas Mazo , Johan Segers

We consider the problem of a revenue-maximizing seller with m items for sale to n additive bidders with hard budget constraints, assuming that the seller has some prior distribution over bidder values and budgets. The prior may be…

Computer Science and Game Theory · Computer Science 2016-05-09 Constantinos Daskalakis , Nikhil R. Devanur , S. Matthew Weinberg

We study revenue maximization in settings where agents' values are interdependent: each agent receives a signal drawn from a correlated distribution and agents' values are functions of all of the signals. We introduce a variant of the…

Computer Science and Game Theory · Computer Science 2014-08-20 Shuchi Chawla , Hu Fu , Anna Karlin

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