Prophet secretary for combinatorial auctions and matroids
The secretary and the prophet inequality problems are central to the field of Stop**
Theory. Recently, there has been a lot of work in generalizing these models to multiple items …
Theory. Recently, there has been a lot of work in generalizing these models to multiple items …
Optimal single-choice prophet inequalities from samples
A Rubinstein, JZ Wang, SM Weinberg - ar** rules for
prophets. This extends the connection that any prophet type inequality can be turned into a …
prophets. This extends the connection that any prophet type inequality can be turned into a …
Secretary problems with non-uniform arrival order
For a number of problems in the theory of online algorithms, it is known that the assumption
that elements arrive in uniformly random order enables the design of algorithms with much …
that elements arrive in uniformly random order enables the design of algorithms with much …
Online independent set beyond the worst-case: Secretaries, prophets, and periods
We investigate online algorithms for maximum (weight) independent set on graph classes
with bounded inductive independence number ρ like interval and disk graphs with …
with bounded inductive independence number ρ like interval and disk graphs with …
Nearly optimal pricing algorithms for production constrained and laminar bayesian selection
In the Bayesian online selection problem, the goal is to find a pricing algorithm for serving a
sequence of arriving buyers that maximizes the expected social-welfare (or revenue) subject …
sequence of arriving buyers that maximizes the expected social-welfare (or revenue) subject …
Robust algorithms for the secretary problem
In classical secretary problems, a sequence of $ n $ elements arrive in a uniformly random
order, and we want to choose a single item, or a set of size $ K $. The random order model …
order, and we want to choose a single item, or a set of size $ K $. The random order model …
Simple and Optimal Online Contention Resolution Schemes for -Uniform Matroids
A Dinev, SM Weinberg - arxiv preprint arxiv:2309.10078, 2023 - arxiv.org
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 …
Scheme for $ k $-uniform matroids against a fixed-order adversary. If $ A_i $ and $ G_i …
Prophets, secretaries, and maximizing the probability of choosing the best
Suppose a customer is faced with a sequence of fluctuating prices, such as for airfare or a
product sold by a large online retailer. Given distributional information about what price they …
product sold by a large online retailer. Given distributional information about what price they …