English
Related papers

Related papers: Generalization Guarantees for Multi-item Profit Ma…

200 papers

The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good mechanisms for risk-averse sellers. As is standard in the…

Computer Science and Game Theory · Computer Science 2010-04-02 Mukund Sundararajan , Qiqi Yan

Social goods are goods that grant value not only to their owners but also to the owners' surroundings, be it their families, friends or office mates. The benefit a non-owner derives from the good is affected by many factors, including the…

Computer Science and Game Theory · Computer Science 2017-07-04 Alon Eden , Tomer Ezra , Michal Feldman

Since economic mechanisms are often applied to very different instances of the same problem, it is desirable to identify mechanisms that work well in a wide range of circumstances. We pursue this goal for a position auction setting and…

Computer Science and Game Theory · Computer Science 2013-07-22 Paul Duetting , Felix Fischer , David C. Parkes

This paper develops a general approach, rooted in statistical learning theory, to learning an approximately revenue-maximizing auction from data. We introduce $t$-level auctions to interpolate between simple auctions, such as welfare…

Computer Science and Game Theory · Computer Science 2015-06-12 Jamie Morgenstern , Tim Roughgarden

In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requirement with the goal of minimizing expected ex post regret,…

Computer Science and Game Theory · Computer Science 2012-08-07 Paul Duetting , Felix Fischer , Pitchayut Jirapinyo , John K. Lai , Benjamin Lubin , David C. Parkes

We study multidimensional mechanism design in a common scenario where players have private information about their willingness to pay and their ability to pay. We provide a complete characterization of dominant-strategy incentive-compatible…

Computer Science and Game Theory · Computer Science 2014-05-01 Ahuva Mualem

This survey outlines a general and modular theory for proving approximation guarantees for equilibria of auctions in complex settings. This theory complements traditional economic techniques, which generally focus on exact and optimal…

Computer Science and Game Theory · Computer Science 2016-07-27 Tim Roughgarden , Vasilis Syrgkanis , Eva Tardos

This paper considers prior-independent mechanism design, namely identifying a single mechanism that has near optimal performance on every prior distribution. We show that mechanisms with truthtelling equilibria, a.k.a., revelation…

Computer Science and Game Theory · Computer Science 2018-08-01 Yiding Feng , Jason D. Hartline

We consider the classical mathematical economics problem of {\em Bayesian optimal mechanism design} where a principal aims to optimize expected revenue when allocating resources to self-interested agents with preferences drawn from a known…

Computer Science and Game Theory · Computer Science 2010-01-15 Shuchi Chawla , Jason Hartline , David Malec , Balasubramanian Sivan

We study how to maximize the broker's (expected) profit in a two-sided market, where she buys items from a set of sellers and resells them to a set of buyers. Each seller has a single item to sell and holds a private value on her item, and…

Computer Science and Game Theory · Computer Science 2019-05-24 Jing Chen , Bo Li , Yingkai Li

We study the power of price discrimination via an intermediary in bilateral trade, when there is a revenue-maximizing seller selling an item to a buyer with a private value drawn from a prior. Between the seller and the buyer, there is an…

Computer Science and Game Theory · Computer Science 2023-04-28 Shao-Heng Ko , Kamesh Munagala

We investigate revenue guarantees for auction mechanisms in a model where a distribution is specified for each bidder, but only some of the distributions are correct. The subset of bidders whose distribution is correctly specified…

Computer Science and Game Theory · Computer Science 2020-07-22 Makis Arsenis , Odysseas Drosis , Robert Kleinberg

We study the revenue guarantees and approximability of item pricing. Recent work shows that with $n$ heterogeneous items, item-pricing guarantees an $O(\log n)$ approximation to the optimal revenue achievable by any (buy-many) mechanism,…

Computer Science and Game Theory · Computer Science 2021-11-08 Shuchi Chawla , Rojin Rezvan , Yifeng Teng , Christos Tzamos

In the infinite-armed bandit problem, each arm's average reward is sampled from an unknown distribution, and each arm can be sampled further to obtain noisy estimates of the average reward of that arm. Prior work focuses on identifying the…

Machine Learning · Computer Science 2022-11-04 Yifei Wang , Tavor Baharav , Yanjun Han , Jiantao Jiao , David Tse

The Empirical Revenue Maximization (ERM) is one of the most important price learning algorithms in auction design: as the literature shows it can learn approximately optimal reserve prices for revenue-maximizing auctioneers in both repeated…

Computer Science and Game Theory · Computer Science 2020-10-13 Xiaotie Deng , Ron Lavi , Tao Lin , Qi Qi , Wenwei Wang , Xiang Yan

The aim of this paper is twofold. First, three theoretical principles are formalized: randomization, overrepresentation and restriction. We develop these principles and give a rationale for their use in choosing the sampling design in a…

Methodology · Statistics 2016-12-16 Yves Tillé , Matthieu Wilhelm

Auction theory traditionally assumes that bidders' valuation distributions are known to the auctioneer, such as in the celebrated, revenue-optimal Myerson auction. However, this theory does not describe how the auctioneer comes to possess…

Computer Science and Game Theory · Computer Science 2014-07-11 Avrim Blum , Yishay Mansour , Jamie Morgenstern

We study the performance of the Empirical Revenue Maximizing (ERM) mechanism in a single-item, single-seller, single-buyer setting. We assume the buyer's valuation is drawn from a regular distribution $F$ and that the seller has access to…

Computer Science and Game Theory · Computer Science 2021-03-02 Mete Şeref Ahunbay , Adrian Vetta

We consider the well known, and notoriously difficult, problem of a single revenue-maximizing seller selling two or more heterogeneous goods to a single buyer whose private values for the goods are drawn from a (possibly correlated) known…

Computer Science and Game Theory · Computer Science 2022-09-23 Sergiu Hart , Noam Nisan

Academic research in the field of recommender systems mainly focuses on the problem of maximizing the users' utility by trying to identify the most relevant items for each user. However, such items are not necessarily the ones that maximize…

Information Retrieval · Computer Science 2017-07-26 Dietmar Jannach , Gediminas Adomavicius