scientific article; zbMATH DE number 5764797
From MaRDI portal
Publication:3579386
Cited in
(27)- Designing cost-sharing methods for Bayesian games
- Improved bounds in stochastic matching and optimization
- Bayesian generalized network design
- Stochastic dominance and the bijective ratio of online algorithms
- Parameterized analysis of the online priority and node-weighted Steiner tree problems
- Non-preemptive buffer management for latency sensitive packets
- Designing cost-sharing methods for Bayesian games
- Online network design with outliers
- Average-Case Competitive Analyses for One-Way Trading
- Price fluctuations: to buy or to rent
- Greedy algorithms for online survivable network design
- Online facility location with deletions
- Bayesian generalized network design
- Stochastic online metric matching
- Approximations to stochastic dynamic programs via information relaxation duality
- Designing networks with good equilibria under uncertainty
- Deterministic sampling algorithms for network design
- Average-case competitive analyses for one-way trading
- Prophet inequalities via the expected competitive ratio
- Prophet secretary for combinatorial auctions and matroids
- Order-competitive ratio
- An o( n)-approximation for submodular facility location
- Improved guarantees for the a priori TSP
- Online matching with delays and stochastic arrival times
- The A priori traveling repairman problem
- Beating competitive ratio 4 for graphic matroid secretary
- Smoothed analysis of online metric problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579386)
