Bayesian generalized network design
From MaRDI portal
Publication:2202025
DOI10.1016/j.tcs.2020.07.010zbMath1455.68028arXiv1907.00484OpenAlexW2978836330MaRDI QIDQ2202025
Yangguang Shi, Shay Kutten, Ron Lavi, Yuval Emek
Publication date: 17 September 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.00484
smoothnessenergy consumptiongeneralized network designbest response dynamicsdiseconomies of scaleBayesian competitive ratioBayesian ignorance
Bayesian problems; characterization of Bayes procedures (62C10) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Randomized oblivious integral routing for minimizing power cost
- Potential games
- Progressive hedging-based metaheuristics for stochastic network design
- Intrinsic Robustness of the Price of Anarchy
- Set connectivity problems in undirected graphs and the directed steiner network problem
- Probability inequalities of the Tchebycheff type
- The Price of Stability for Network Design with Fair Cost Allocation
- Speed scaling to manage energy and temperature
- Survey on Oblivious Routing Strategies
- Oblivious network design
- Solving Optimization Problems with Diseconomies of Scale via Decoupling
- Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency
- Oblivious Routing for the Lp-norm
- Bayesian ignorance
- Mixing times and ℓp bounds for Oblivious routing
- Fibonacci heaps and their uses in improved network optimization algorithms
- Steiner Tree Approximation via Iterative Randomized Rounding
- Exact Price of Anarchy for Polynomial Congestion Games
