Pages that link to "Item:Q4575652"
From MaRDI portal
The following pages link to Online Contention Resolution Schemes (Q4575652):
Displaying 20 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Contention resolution, matrix scaling and fair allocation (Q2085755) (← links)
- Prophet secretary for \(k\)-knapsack and \(l\)-matroid intersection via continuous exchange property (Q2115881) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Formal barriers to simple algorithms for the matroid secretary problem (Q2152122) (← links)
- Optimal item pricing in online combinatorial auctions (Q2164686) (← links)
- Prophet inequalities vs. approximating optimum online (Q2190412) (← links)
- Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents (Q2237895) (← links)
- A simple optimal contention resolution scheme for uniform matroids (Q2699957) (← links)
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs (Q3304731) (← links)
- (Q5009622) (← links)
- Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals (Q5026446) (← links)
- Prophet Matching with General Arrivals (Q5085120) (← links)
- Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution (Q5085141) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions (Q5864664) (← links)
- Guess free maximization of submodular and linear sums (Q5925508) (← links)
- (Q6087217) (← links)
- Optimal item pricing in online combinatorial auctions (Q6589756) (← links)
- Buy-many mechanisms for many unit-demand buyers (Q6609124) (← links)
