English
Related papers

Related papers: Efficient Two-Sided Markets with Limited Informati…

200 papers

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

This paper focuses on parameter estimation and introduces a new method for lower bounding the Bayesian risk. The method allows for the use of virtually \emph{any} information measure, including R\'enyi's $\alpha$, $\varphi$-Divergences, and…

Information Theory · Computer Science 2023-03-27 Amedeo Roberto Esposito , Adrien Vandenbroucque , Michael Gastpar

We consider a revenue-maximizing seller with $n$ items facing a single buyer. We introduce the notion of symmetric menu complexity of a mechanism, which counts the number of distinct options the buyer may purchase, up to permutations of the…

Computer Science and Game Theory · Computer Science 2020-05-08 Pravesh Kothari , Divyarthi Mohan , Ariel Schvartzman , Sahil Singla , S. Matthew Weinberg

The Gibbard-Satterthwaite Impossibility Theorem holds that dictatorship is the only Pareto optimal and strategyproof social choice function on the full domain of preferences. Much of the work in mechanism design aims at getting around this…

Computer Science and Game Theory · Computer Science 2017-03-21 Sophie Bade , Yannai A. Gonczarowski

In the design and analysis of revenue-maximizing auctions, auction performance is typically measured with respect to a prior distribution over inputs. The most obvious source for such a distribution is past data. The goal is to understand…

Computer Science and Game Theory · Computer Science 2015-11-30 Richard Cole , Tim Roughgarden

Myerson's seminal characterization of the revenue-optimal auction for a single item \cite{myerson1981optimal} remains a cornerstone of mechanism design. However, generalizing this framework to multi-item settings has proven exceptionally…

Computer Science and Game Theory · Computer Science 2025-10-08 Marios Mertzanidis , Athina Terzoglou

There is only one technique for prior-free optimal mechanism design that generalizes beyond the structurally benevolent setting of digital goods. This technique uses random sampling to estimate the distribution of agent values and then…

Computer Science and Game Theory · Computer Science 2011-08-25 Bach Q. Ha , Jason D. Hartline

We study a classical Bayesian mechanism design problem where a seller is selling multiple items to multiple buyers. We consider the case where the seller has costs to produce the items, and these costs are private information to the seller.…

Computer Science and Game Theory · Computer Science 2020-04-20 Yang Cai , Mingfei Zhao

An approximation of strategyproofness in large, two-sided matching markets is highly evident. Through simulations, one can observe that the percentage of agents with useful deviations decreases as the market size grows. Furthermore, there…

Multiagent Systems · Computer Science 2022-11-30 Lars Lien Ankile , Kjartan Krange , Yuto Yagi

Approximate Bayesian computing is a powerful likelihood-free method that has grown increasingly popular since early applications in population genetics. However, complications arise in the theoretical justification for Bayesian inference…

Computation · Statistics 2018-12-03 Suzanne Thornton , Wentao Li , Min-ge Xie

Bayesian optimisation is a well-known sample-efficient method for the optimisation of expensive black-box functions. However when dealing with big search spaces the algorithm goes through several low function value regions before reaching…

Machine Learning · Computer Science 2020-03-31 Anil Ramachandran , Sunil Gupta , Santu Rana , Cheng Li , Svetha Venkatesh

How should a buyer design procurement mechanisms when suppliers' costs are unknown, and the buyer does not have a prior belief? We demonstrate that simple mechanisms - that share a constant fraction of the buyer utility with the seller -…

Theoretical Economics · Economics 2025-12-11 Dirk Bergemann , Tibor Heumann , Stephen Morris

We consider the black-box reduction from multi-dimensional revenue maximization to virtual welfare maximization. Cai et al. show a polynomial-time approximation-preserving reduction, however, the mechanism produced by their reduction is…

Computer Science and Game Theory · Computer Science 2020-11-06 Yang Cai , Argyris Oikonomou , Grigoris Velegkas , Mingfei Zhao

We study the limits of an information intermediary in the classical Bayesian auction, where a revenue-maximizing seller sells one item to $n$ buyers with independent private values. In addition, we have an intermediary who knows the buyers'…

Computer Science and Game Theory · Computer Science 2022-05-20 Reza Alijani , Siddhartha Banerjee , Kamesh Munagala , Kangning Wang

Multi-winner approval-based voting has received considerable attention recently. A voting rule in this setting takes as input ballots in which each agent approves a subset of the available alternatives and outputs a committee of…

Computer Science and Game Theory · Computer Science 2024-02-15 Ioannis Caragiannis , Rob LeGrand , Evangelos Markakis , Emmanouil Pountourakis

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 investigate the power of randomness in the context of a fundamental Bayesian optimal mechanism design problem--a single seller aims to maximize expected revenue by allocating multiple kinds of resources to "unit-demand" agents with…

Computer Science and Game Theory · Computer Science 2010-02-24 Shuchi Chawla , David Malec , 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

Black-box optimization is often encountered for decision-making in complex systems management, where the knowledge of system is limited. Under these circumstances, it is essential to balance the utilization of new information with…

Computation · Statistics 2025-01-15 Teng Lian , Jian-Qiang Hu , Yuhang Wu , Zeyu Zheng

Bilateral trade, a fundamental topic in economics, models the problem of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. Despite the simplicity of this…

Machine Learning · Computer Science 2024-02-20 Nicolò Cesa-Bianchi , Tommaso Cesari , Roberto Colomboni , Federico Fusco , Stefano Leonardi