
Open access
Date
2017-07Type
- Conference Paper
Abstract
We consider a problem of information structure design in team decision problems and team games. We propose simple, scalable greedy algorithms for adding a set of extra information links to optimize team performance and resilience to non-cooperative and adversarial agents. We show via a simple counterexample that the set function mapping additional information links to team performance is in general not supermodular. Although this implies that the greedy algorithm is not accompanied by worst-case performance guarantees, we illustrate through numerical experiments that it can produce effective and often optimal or near optimal information structure modifications. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000239544Publication status
publishedExternal links
Book title
20th IFAC World Congress. ProceedingsJournal / series
IFAC-PapersOnLineVolume
Pages / Article No.
Publisher
ElsevierEvent
Subject
Team decision theory; team games; information structure design; DecentralizedOrganisational unit
09578 - Kamgarpour, Maryam (ehemalig) / Kamgarpour, Maryam (former)
More
Show all metadata