English
Related papers

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

200 papers

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

Inference from limited data requires a notion of measure on parameter space, most explicit in the Bayesian framework as a prior. Here we demonstrate that Jeffreys prior, the best-known uninformative choice, introduces enormous bias when…

Other Statistics · Statistics 2023-04-03 Michael C. Abbott , Benjamin B. Machta

Scientific experiments are usually expensive due to complex experimental preparation and processing. Experimental design is therefore involved with the task of finding the optimal experimental input that results in the desirable output by…

Machine Learning · Statistics 2020-02-27 Cheng Li , Sunil Gupta , Santu Rana , Vu Nguyen , Antonio Robles-Kelly , Svetha Venkatesh

We address auctions in two-sided markets with budget constraints on buyers, a fundamental setting also crucial for applications such as display advertising. Our goal is to design efficient mechanisms that satisfy dominant strategy incentive…

Computer Science and Game Theory · Computer Science 2024-11-05 Ryosuke Sato

We consider a revenue-maximizing seller with $m$ heterogeneous items and a single buyer whose valuation $v$ for the items may exhibit both substitutes (i.e., for some $S, T$, $v(S \cup T) < v(S) + v(T)$) and complements (i.e., for some $S,…

Computer Science and Game Theory · Computer Science 2017-04-11 Alon Eden , Michal Feldman , Ophir Friedler , Inbal Talgam-Cohen , S. Matthew Weinberg

In this article, we construct semiparametrically efficient estimators of linear functionals of a probability measure in the presence of side information using an easy empirical likelihood approach. We use estimated constraint functions and…

Methodology · Statistics 2023-03-01 Shan Wang , Hanxiang Peng

Black-box optimization refers to the optimization problem whose objective function and/or constraint sets are either unknown, inaccessible, or non-existent. In many applications, especially with the involvement of humans, the only way to…

We consider a selfish variant of the knapsack problem. In our version, the items are owned by agents, and each agent can misrepresent the set of items she owns---either by avoiding reporting some of them (understating), or by reporting…

Computer Science and Game Theory · Computer Science 2016-03-01 Itai Feigenbaum , Matthew P. Johnson

A Bayesian design is given by maximising an expected utility over a design space. The utility is chosen to represent the aim of the experiment and its expectation is taken with respect to all unknowns: responses, parameters and/or models.…

Methodology · Statistics 2019-01-16 Antony M. Overstall , James M. McGree

Bayesian optimization is a sample-efficient method for solving expensive, black-box optimization problems. Stochastic programming concerns optimization under uncertainty where, typically, average performance is the quantity of interest. In…

Machine Learning · Statistics 2025-02-19 Jack M. Buckingham , Ivo Couckuyt , Juergen Branke

Likelihood-free Bayesian inference algorithms are popular methods for calibrating the parameters of complex, stochastic models, required when the likelihood of the observed data is intractable. These algorithms characteristically rely…

Computation · Statistics 2021-12-23 Thomas P Prescott , David J Warne , Ruth E Baker

Budget feasible mechanism design studies procurement combinatorial auctions where the sellers have private costs to produce items, and the buyer(auctioneer) aims to maximize a social valuation function on subsets of items, under the budget…

Computer Science and Game Theory · Computer Science 2012-11-09 Xiaohui Bei , Ning Chen , Nick Gravin , Pinyan Lu

Two sellers compete to sell identical products to a single buyer. Each seller chooses an arbitrary mechanism, possibly involving lotteries, to sell their product. The utility-maximizing buyer can choose to participate in one or both…

Computer Science and Game Theory · Computer Science 2025-05-27 Brendan Lucier , Raghuvansh R. Saxena

We study the problem of selection in the context of Bayesian persuasion. We are given multiple agents with hidden values (or quality scores), to whom resources must be allocated by a welfare-maximizing decision-maker. An intermediary with…

Computer Science and Game Theory · Computer Science 2025-11-18 Yannan Bai , Kamesh Munagala , Yiheng Shen , Davidson Zhu

As a natural approach to modeling system safety conditions, chance constraint (CC) seeks to satisfy a set of uncertain inequalities individually or jointly with high probability. Although a joint CC offers stronger reliability certificate,…

Optimization and Control · Mathematics 2022-04-04 Haoming Shen , Ruiwei Jiang

In this work, we give a novel general approach for distribution testing. We describe two techniques: our first technique gives sample-optimal testers, while our second technique gives matching sample lower bounds. As a consequence, we…

Data Structures and Algorithms · Computer Science 2016-05-10 Ilias Diakonikolas , Daniel M. Kane

This paper compares three approaches to the problem of selecting among probability models to fit data (1) use of statistical criteria such as Akaike's information criterion and Schwarz's "Bayesian information criterion," (2) maximization of…

Methodology · Statistics 2016-11-04 William B. Poland , Ross D. Shachter

The compounding of plastics with recycled material remains a practical challenge, as the properties of the processed material is not as easy to control as with completely new raw materials. For a data scientist, it makes sense to plan the…

Human-Computer Interaction · Computer Science 2025-11-21 Dorina Weichert , Gunar Ernis , Marvin Worthmann , Peter Ryzko , Lukas Seifert

We consider the problem of maximizing revenue for a monopolist offering multiple items to multiple heterogeneous buyers. We develop a simple mechanism that obtains a constant factor approximation under the assumption that the buyers' values…

Computer Science and Game Theory · Computer Science 2016-08-10 Shuchi Chawla , J. Benjamin Miller

In many real world problems, optimization decisions have to be made with limited information. The decision maker may have no a priori or posteriori data about the often nonconvex objective function except from on a limited number of points…

Optimization and Control · Mathematics 2011-11-10 Tansu Alpcan