A non-cooperative approach to the cost spanning tree problem | Zendy

Gustavo Berganti�os | Zendy; Leticia Lorenzo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A non-cooperative approach to the cost spanning tree problem

Author(s) -

Gustavo Berganti�os,

Leticia Lorenzo

Publication year - 2004

Publication title -

mathematical methods of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.524

H-Index - 48

eISSN - 1432-5217

pISSN - 1432-2994

DOI - 10.1007/s001860400352

Subject(s) - nash equilibrium , spanning tree , computer science , mathematical optimization , tree (set theory) , mathematical economics , game theory , subgame , game tree , subgame perfect equilibrium , best response , normal form game , mathematics , epsilon equilibrium , repeated game , combinatorics

We associate to each cost spanning tree problem a non-cooperative game, which is inspired by a real-life problem. We study the Nash equilibria and subgame perfect Nash equilibria of this game. We prove that these equilibria are closely related with situations where agents connect sequentially to the source.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research