Bayesian generalized network design

We study network coordination problems, as captured by the setting of generalized network design (Emek et al. , STOC 2018 [18]), in the face of uncertainty resulting from partial information that the network users hold regarding the actions of their peers. This uncertainty is formalized using Alon et al. 's Bayesian ignorance framework (TCS 2012 [1]). While the approach of Alon et al. is purely combinatorial, the current paper takes into account computational considerations: Our main technical contribution is the development of (strongly) polynomial time algorithms for local decision making in the face of Bayesian uncertainty.

Authors

• Yuval Emek
• Shay Kutten
• Ron Lavi University of Bath, UK
• Yangguang Shi

Keywords

• Bayesian competitive ratio
• Bayesian ignorance
• Generalized network design
• Diseconomies of scale
• Energy consumption
• Smoothness
• Best response dynamics