Matroid prophet inequalities and applications to multi-dimensional mechanism design
From MaRDI portal
Publication:1735736
DOI10.1016/j.geb.2014.11.002zbMath1419.91332OpenAlexW2080956807MaRDI QIDQ1735736
S. Matthew Weinberg, Robert D. Kleinberg
Publication date: 29 March 2019
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2014.11.002
Optimal stochastic control (93E20) Auctions, bargaining, bidding and selling, and other market models (91B26) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (6)
Prophet Matching with General Arrivals ⋮ Prophet inequality with competing agents ⋮ Secretary and online matching problems with machine learned advice ⋮ Introduction to the special issue -- Algorithmic Game Theory -- STOC/FOCS/SODA 2012 ⋮ Prophet secretary through blind strategies ⋮ A Simple and Approximately Optimal Mechanism for a Buyer with Complements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of threshold stop rules and maximum for independent nonnegative random variables
- Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5--12, 2009. Proceedings, Part II
- Optimal stopping of independent random variables and maximizing prophets
- Prophet-type inequalities for multi-choice optimal stopping
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On variants of the matroid secretary problem
- Multi-parameter mechanism design and sequential posted pricing
- Approximation algorithms for restless bandit problems
- Competitive Weighted Matching in Transversal Matroids
- Comparison of optimal value and constrained maxima expectations for independent random variables
- Optimal Auction Design
- Semiamarts and finite values
- Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
- Matroid Secretary for Regular and Decomposable Matroids
- Multi-armed Bandits with Metric Switching Costs
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- Bayesian Mechanism Design
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
This page was built for publication: Matroid prophet inequalities and applications to multi-dimensional mechanism design