Polymatroid Prophet Inequalities
From MaRDI portal
Publication:3452806
DOI10.1007/978-3-662-48350-3_37zbMath1466.68087arXiv1307.5299MaRDI QIDQ3452806
Paul Dütting, Robert D. Kleinberg
Publication date: 19 November 2015
Published in: Algorithms - ESA 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.5299
90C27: Combinatorial optimization
91B26: Auctions, bargaining, bidding and selling, and other market models
91B44: Economics of information
68W27: Online algorithms; streaming algorithms
91B03: Mechanism design theory
Related Items
Strong Algorithms for the Ordinal Matroid Secretary Problem, Hiring Secretaries over Time: The Benefit of Concurrent Employment, Prophet Secretary, Secretary markets with local information, Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents, From pricing to prophets, and back!, Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs
Cites Work
- Unnamed Item
- Comparison of threshold stop rules and maximum for independent nonnegative random variables
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Revenue maximization with a single sample
- Polyhedral Clinching Auctions and the AdWords Polytope
- Multi-parameter mechanism design and sequential posted pricing
- Approximation algorithms for restless bandit problems
- An Ascending Vickrey Auction for Selling Bases of a Matroid
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- Optimal Auction Design
- Semiamarts and finite values
- Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities
- Multi-armed Bandits with Metric Switching Costs
- Combinatorial Auctions via Posted Prices
- Matroid prophet inequalities
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
