Good neighbors are hard to find: computational complexity of network formation - HAL Accéder directement au contenu
Article dans une revue Review of Economic Design Année : 2008

Good neighbors are hard to find: computational complexity of network formation

Résumé

We investigate the computational complexity of several decision problems in a simple strategic game of network formation.We find that deciding if a player has a strategy that guarantees him a certain payoff against a given strategy profile of the other players is an NP-complete problem. Deciding if there exists a strategy profile that guarantees a certain aggregate payoff is also NP-complete. Deciding if there is a Nash equilibrium in pure strategies which guarantees a certain payoff to each player is NP-hard. The problem of deciding if a given strategy profile is a Nash equilibrium is investigated as well.
Loading...

Dates et versions

hal-00268851, version 1 (01-04-2008)

Identifiants

Citer

Richard Baron, Jacques Durieu, Hans Haller, Philippe Solal, Savani Rahul. Good neighbors are hard to find: computational complexity of network formation. Review of Economic Design, 2008, 12 (1), pp.1-19. ⟨10.1007/s10058-008-0043-x⟩. ⟨hal-00268851⟩
67 Consultations
0 Téléchargements
Dernière date de mise à jour le 06/04/2024
comment ces indicateurs sont-ils produits

Altmetric

Partager

Gmail Facebook Twitter LinkedIn Plus