English
Related papers

Related papers: Static Pricing for Single Sample Multi-unit Prophe…

200 papers

Due to their numerous applications, in particular in Mechanism Design, Prophet Inequalities have experienced a surge of interest. They describe competitive ratios for basic stopping time problems where random variables get revealed…

Data Structures and Algorithms · Computer Science 2025-07-15 Moran Feldman , Ola Svensson , Rico Zenklusen

We design novel mechanisms for welfare-maximization in two-sided markets. That is, there are buyers willing to purchase items and sellers holding items initially, both acting rationally and strategically in order to maximize utility. Our…

Computer Science and Game Theory · Computer Science 2021-06-01 Alexander Braun , Thomas Kesselheim

Prophet inequalities consist of many beautiful statements that establish tight performance ratios between online and offline allocation algorithms. Typically, tightness is established by constructing an algorithmic guarantee and a…

Computer Science and Game Theory · Computer Science 2025-03-14 Jiashuo Jiang , Will Ma , Jiawei Zhang

We study the bilateral trade problem where a seller owns a single indivisible item, and a potential buyer seeks to purchase it. Previous mechanisms for this problem only considered the case where the values of the buyer and the seller are…

Computer Science and Game Theory · Computer Science 2024-04-17 Shahar Dobzinski , Ariel Shaulker

Prophet inequalities are a useful tool for designing online allocation procedures and comparing their performance to the optimal offline allocation. In the basic setting of $k$-unit prophet inequalities, the well-known procedure of Alaei…

Computer Science and Game Theory · Computer Science 2023-10-10 Jiashuo Jiang , Will Ma , Jiawei Zhang

We initiate the study of single-sample bilateral trade with a broker, drawing an analogy to the setting of single-sample bilateral trade without a broker considered in Babaioff et al. (2020) and Cai and Wu (2023). Our model captures the…

Computer Science and Game Theory · Computer Science 2026-03-04 MohammadTaghi Hajiaghayi , Gary Peng , Suho Shin

We study large markets with a single seller which can produce many types of goods, and many multi-minded buyers. The seller chooses posted prices for its many items, and the buyers purchase bundles to maximize their utility. For this…

Computer Science and Game Theory · Computer Science 2016-10-14 Elliot Anshelevich , Koushik Kar , Shreyas Sekar

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 the two-agent single-item bilateral trade. Ideally, the trade should happen whenever the buyer's value for the item exceeds the seller's cost. However, the classical result of Myerson and Satterthwaite showed that no mechanism can…

Computer Science and Game Theory · Computer Science 2022-05-03 Yumou Fei

We study a classic Bayesian mechanism design setting of monopoly problem for an additive buyer in the presence of budgets. In this setting a monopolist seller with $m$ heterogeneous items faces a single buyer and seeks to maximize her…

Computer Science and Game Theory · Computer Science 2018-10-09 Yu Cheng , Nick Gravin , Kamesh Munagala , Kangning Wang

This paper studies the sample complexity (aka number of comparisons) bounds for the active best-$k$ items selection from pairwise comparisons. From a given set of items, the learner can make pairwise comparisons on every pair of items, and…

Machine Learning · Computer Science 2021-08-02 Wenbo Ren , Jia Liu , Ness B. Shroff

We consider a general queueing system with price-sensitive customers in which the service provider seeks to balance two objectives, maximizing the average revenue rate and minimizing the average queue length. Customers arrive according to a…

Data Structures and Algorithms · Computer Science 2025-12-09 Jacob Bergquist , Adam N. Elmachtoub

In the multi-unit pricing problem, multiple units of a single item are for sale. A buyer's valuation for $n$ units of the item is $v \min \{ n, d\} $, where the per unit valuation $v$ and the capacity $d$ are private information of the…

Computer Science and Game Theory · Computer Science 2017-04-18 Nikhil R. Devanur , Nima Haghpanah , Christos-Alexandros Psomas

We provide a simple $(1-O(\frac{1}{\sqrt{k}}))$-selectable Online Contention Resolution Scheme for $k$-uniform matroids against a fixed-order adversary. If $A_i$ and $G_i$ denote the set of selected elements and the set of realized active…

Data Structures and Algorithms · Computer Science 2023-11-28 Atanas Dinev , S. Matthew Weinberg

The last success problem is an optimal stopping problem that aims to maximize the probability of stopping on the last success in a sequence of independent $n$ Bernoulli trials. In the classical setting where complete information about the…

Probability · Mathematics 2024-07-24 Toru Yoshinaga , Yasushi Kawase

We consider the problem of maximizing revenue when selling k items to a single buyer with known valuation distributions. We show that for a single, additive buyer whose valuations for for the items are distributed according to i.i.d.…

Computer Science and Game Theory · Computer Science 2016-11-30 Ron Kupfer

A special case of Myerson's classic result describes the revenue-optimal equilibrium when a seller offers a single item to a buyer. We study a repeated sales extension of this model: a seller offers to sell a single fresh copy of an item to…

Computer Science and Game Theory · Computer Science 2019-03-12 Nikhil R. Devanur , Yuval Peres , Balasubramanian Sivan

The comparison of a parameter in $k$ populations is a classical problem in statistics. Testing for the equality of means or variances are typical examples. Most procedures designed to deal with this problem assume that $k$ is fixed and that…

We consider the fundamental problem of selecting $k$ out of $n$ random variables in a way that the expected highest or second-highest value is maximized. This question captures several applications where we have uncertainty about the…

Computer Science and Game Theory · Computer Science 2020-12-16 Aranyak Mehta , Uri Nadav , Alexandros Psomas , Aviad Rubinstein

Despite having the same basic prophet inequality setup and model of loss aversion, conclusions in our multi-dimensional model differs considerably from the one-dimensional model of Kleinberg et al. For example, Kleinberg et al. gives a…

Computer Science and Game Theory · Computer Science 2023-09-28 Linda Cai , Joshua Gardner , S. Matthew Weinberg