Bayesian generalized network design

Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study network coordination problems, as captured by the setting of generalized network design (Emek et al., STOC 2018), 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). 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.

Original languageEnglish
Title of host publication27th Annual European Symposium on Algorithms, ESA 2019
EditorsMichael A. Bender, Ola Svensson, Grzegorz Herman
ISBN (Electronic)9783959771245
DOIs
StatePublished - Sep 2019
Event27th Annual European Symposium on Algorithms, ESA 2019 - Munich/Garching, Germany
Duration: 9 Sep 201911 Sep 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume144
ISSN (Print)1868-8969

Conference

Conference27th Annual European Symposium on Algorithms, ESA 2019
Country/TerritoryGermany
CityMunich/Garching
Period9/09/1911/09/19

Keywords

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

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Bayesian generalized network design'. Together they form a unique fingerprint.

Cite this