Opportune moment strategies for a cost spanning tree game

F. Fernández (), M. Hinojosa (), A. Mármol () and J. Puerto ()

Mathematical Methods of Operations Research, 2009, vol. 70, issue 3, 463 pages

Abstract: Cost spanning tree problems concern the construction of a tree which provides a connection with the source for every node of the network. In this paper, we address cost sharing problems associated to these situations when the agents located at the nodes act in a non-cooperative way. A class of strategies is proposed which produce minimum cost spanning trees and, at the same time, are strong Nash equilibria for a non-cooperative game associated to the problem. They are also subgame perfect Nash equilibria. Copyright Springer-Verlag 2009

Keywords: Non-cooperative games; Spanning trees; Nash equilibria; C72; D85 (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00186-008-0279-9 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:70:y:2009:i:3:p:451-463

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-008-0279-9

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().