English
Related papers

Related papers: Anonymous Pricing in Large Markets

200 papers

We consider the problem of maximizing the expected revenue from selling $k$ homogeneous goods to $n$ unit-demand buyers who arrive sequentially with independent and identically distributed valuations. In this setting the optimal posted…

Computer Science and Game Theory · Computer Science 2019-04-17 Paul Dütting , Felix Fischer , Max Klimm

We resolve the complexity of revenue-optimal deterministic auctions in the unit-demand single-buyer Bayesian setting, i.e., the optimal item pricing problem, when the buyer's values for the items are independent. We show that the problem of…

Computer Science and Game Theory · Computer Science 2017-02-24 Xi Chen , Ilias Diakonikolas , Dimitris Paparas , Xiaorui Sun , Mihalis Yannakakis

Strategic information is valuable either by remaining private (for instance if it is sensitive) or, on the other hand, by being used publicly to increase some utility. These two objectives are antagonistic and leaking this information might…

Machine Learning · Statistics 2020-03-03 Etienne Boursier , Vianney Perchet

Consider a trade market with one seller and multiple buyers. The seller aims to sell an indivisible item and maximize their revenue. This paper focuses on a simple and popular mechanism--the fixed-price mechanism. Unlike the standard…

Computer Science and Game Theory · Computer Science 2024-11-19 Zhikang Fan , Weiran Shen

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

This paper studies optimal bundling of products with non-additive values. Under monotonic preferences and single-peaked profits, I show a monopolist finds pure bundling optimal if and only if the optimal sales volume for the grand bundle is…

General Economics · Economics 2022-04-22 Soheil Ghili

We study a dynamic market setting where an intermediary interacts with an unknown large sequence of agents that can be either sellers or buyers: their identities, as well as the sequence length $n$, are decided in an adversarial, online…

Computer Science and Game Theory · Computer Science 2017-03-29 Yiannis Giannakopoulos , Elias Koutsoupias , Philip Lazos

We consider a two-way trading problem, where investors buy and sell a stock whose price moves within a certain range. Naturally they want to maximize their profit. Investors can perform up to $k$ trades, where each trade must involve the…

Data Structures and Algorithms · Computer Science 2017-06-19 Stanley P. Y. Fung

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 an online revenue maximization problem where the consumers arrive i.i.d from some unknown distribution and purchase a bundle of products from the sellers. The classical approach generally assumes complete knowledge of the consumer…

Computer Science and Game Theory · Computer Science 2022-10-04 Owen Shen

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

Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. We study this problem from the perspective of a broker, in a regret…

Computer Science and Game Theory · Computer Science 2025-09-29 Simone Di Gregorio , Paul Dütting , Federico Fusco , Chris Schwiegelshohn

We obtain revenue guarantees for the simple pricing mechanism of a single posted price, in terms of a natural parameter of the distribution of buyers' valuations. Our revenue guarantee applies to the single item n buyers setting, with…

Computer Science and Game Theory · Computer Science 2015-06-02 Balasubramanian Sivan , Vasilis Syrgkanis , Omer Tamuz

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

We continue the study of the performance for fixed-price mechanisms in the bilateral trade problem, and improve approximation ratios of welfare-optimal mechanisms in several settings. Specifically, in the case where only the buyer…

Computer Science and Game Theory · Computer Science 2023-03-29 Zhengyang Liu , Zeyu Ren , Zihe Wang

We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-18 Johanne Cohen , Jonas Lefèvre , Khaled Maâmra , Laurence Pilard , Devan Sohier

This paper investigates the impact of anonymous trading on the agents' strategy in an optimal execution framework. It mainly explores the specificity of order attribution on the Toronto Stock Exchange, where brokers can choose to either…

Mathematical Finance · Quantitative Finance 2022-10-11 Rene Carmona , Claire Zeng

The buying and selling of information is taking place at a scale unprecedented in the history of commerce, thanks to the formation of online marketplaces for user data. Data providing agencies sell user information to advertisers to allow…

Computer Science and Game Theory · Computer Science 2012-04-26 Moshe Babaioff , Robert Kleinberg , Renato Paes Leme

We study simple and approximately optimal auctions for agents with a particular form of risk-averse preferences. We show that, for symmetric agents, the optimal revenue (given a prior distribution over the agent preferences) can be…

Computer Science and Game Theory · Computer Science 2013-01-04 Hu Fu , Jason Hartline , Darrell Hoy

We study market interactions in which buyers are allowed to credibly reveal partial information about their types to the seller. Previous recent work has studied the special case of one buyer and one good, showing that such communication…

Computer Science and Game Theory · Computer Science 2022-05-05 Daniel Halpern , Gregory Kehne , Jamie Tucker-Foltz
‹ Prev 1 4 5 6 7 8 10 Next ›