English
Related papers

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

200 papers

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

This paper reexamines the classic problem of revenue maximization in single-item auctions with $n$ buyers under the lens of the robust optimization framework. The celebrated Myerson's mechanism is the format that maximizes the seller's…

Computer Science and Game Theory · Computer Science 2024-09-16 Nick Gravin , Zhiqi Wang

We show that every universally truthful randomized mechanism for combinatorial auctions with submodular valuations that provides $m^{\frac 1 2 -\epsilon}$ approximation to the social welfare and uses value queries only must use…

Computer Science and Game Theory · Computer Science 2015-03-17 Shahar Dobzinski

Simulation models, in particular agent-based models, are gaining popularity in economics. The considerable flexibility they offer, as well as their capacity to reproduce a variety of empirically observed behaviours of complex systems, give…

Econometrics · Economics 2024-02-20 Joel Dyer , Patrick Cannon , J. Doyne Farmer , Sebastian Schmon

Bayesian optimization is a powerful global optimization technique for expensive black-box functions. One of its shortcomings is that it requires auxiliary optimization of an acquisition function at each iteration. This auxiliary…

Machine Learning · Statistics 2014-02-28 Ziyu Wang , Babak Shakibi , Lin Jin , Nando de Freitas

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 the matrix completion problem that leverages hierarchical similarity graphs as side information in the context of recommender systems. Under a hierarchical stochastic block model that well respects practically-relevant social…

Information Theory · Computer Science 2021-09-14 Junhyung Ahn , Adel Elmahdy , Soheil Mohajer , Changho Suh

We consider two canonical Bayesian mechanism design settings. In the single-item setting, we prove tight approximation ratio for anonymous pricing: compared with Myerson Auction, it extracts at least $\frac{1}{2.62}$-fraction of revenue;…

Computer Science and Game Theory · Computer Science 2018-11-05 Yaonan Jin , Pinyan Lu , Qi Qi , Zhihao Gavin Tang , Tao Xiao

We study mechanism design problems in the {\em ordinal setting} wherein the preferences of agents are described by orderings over outcomes, as opposed to specific numerical values associated with them. This setting is relevant when agents…

Computer Science and Game Theory · Computer Science 2014-03-11 Deeparnab Chakrabarty , Chaitanya Swamy

We consider the problem of maximizing the gains from trade (GFT) in two-sided markets. The seminal impossibility result by Myerson and Satterthwaite shows that even for bilateral trade, there is no individually rational (IR), Bayesian…

Computer Science and Game Theory · Computer Science 2024-04-01 Yang Cai , Christopher Liaw , Aranyak Mehta , Mingfei Zhao

We consider the problem of converting an arbitrary approximation algorithm for a single-parameter optimization problem into a computationally efficient truthful mechanism. We ask for reductions that are black-box, meaning that they require…

Computer Science and Game Theory · Computer Science 2011-09-12 Shuchi Chawla , Nicole Immorlica , Brendan Lucier

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 the problem of designing a two-sided market (double auction) to maximize the gains from trade (social welfare) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our goal is to do so for an…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

Bilateral trade is one of the most natural and important forms of economic interaction: A seller has a single, indivisible item for sale, and a buyer is potentially interested. The two parties typically have different, privately known…

Computer Science and Game Theory · Computer Science 2023-12-20 Yixuan Even Xu , Hanrui Zhang , Vincent Conitzer

We consider the provision of an abstract service to single-dimensional agents. Our model includes position auctions, single-minded combinatorial auctions, and constrained matching markets. When the agents' values are drawn from a…

Computer Science and Game Theory · Computer Science 2012-12-18 Nikhil R. Devanur , Jason D. Hartline , Qiqi Yan

For nearly any challenging scientific problem evaluation of the likelihood is problematic if not impossible. Approximate Bayesian computation (ABC) allows us to employ the whole Bayesian formalism to problems where we can use simulations…

Computation · Statistics 2011-07-04 Chris Barnes , Sarah Filippi , Michael P. H. Stumpf , Thomas Thorne

Bayesian experimental design involves the optimal allocation of resources in an experiment, with the aim of optimising cost and performance. For implicit models, where the likelihood is intractable but sampling from the model is possible,…

Machine Learning · Statistics 2019-02-26 Steven Kleinegesse , Michael Gutmann

Several scenarios require the optimization of non-convex black-box functions, that are noisy expensive to evaluate functions with unknown analytical expression, whose gradients are hence not accessible. For example, the hyper-parameter…

Machine Learning · Computer Science 2025-02-12 Eduardo C. Garrido-Merchán

We study resource allocation in two-sided markets from a fundamental perspective and introduce a general modeling and algorithmic framework to effectively incorporate the complex and multidimensional aspects of fairness. Our main technical…

Computer Science and Game Theory · Computer Science 2025-06-03 Javier Cembrano , Andrés Moraga , Victor Verdugo

Persuasion studies how an informed principal may influence the behavior of agents by the strategic provision of payoff-relevant information. We focus on the fundamental multi-receiver model by Arieli and Babichenko (2019), in which there…

Computer Science and Game Theory · Computer Science 2020-04-01 Matteo Castiglioni , Andrea Celli , Nicola Gatti