Bayesian Generalized Network Design

06/30/2019
by   Yuval Emek, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2014

On Optimal Decision-Making in Ant Colonies

Colonies of ants can collectively choose the best of several nests, even...
research
01/10/2013

A Comparison of Axiomatic Approaches to Qualitative Decision Making Using Possibility Theory

In this paper we analyze two recent axiomatic approaches proposed by Dub...
research
07/26/2020

Efficient Approximation Schemes for Stochastic Probing and Prophet Problems

Our main contribution is a general framework to design efficient polynom...
research
03/16/2020

Stochastic Frontier Analysis with Generalized Errors: inference, model comparison and averaging

Our main contribution lies in formulation of a generalized, parametric m...
research
11/30/2020

How to Sell Information Optimally: an Algorithmic Study

We investigate the algorithmic problem of selling information to agents ...
research
09/25/2022

AI, Opacity, and Personal Autonomy

Advancements in machine learning have fuelled the popularity of using AI...
research
11/29/2021

A category theory framework for Bayesian learning

Inspired by the foundational works by Spivak and Fong and Cruttwell et a...

Please sign up or login with your details

Forgot password? Click here to reset