✦ LIBER ✦

Noncooperative cost spanning tree games with budget restrictions

✍ Scribed by Gustavo Bergantiños; Leticia Lorenzo

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 185 KB
Volume: 55
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.20319

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We extend the noncooperative game associated with the cost spanning tree problem introduced by Bergantiños and Lorenzo (Math Method Oper Res 59(2004), 393–403) to situations where agents have budget restrictions. We study the Nash equilibria, subgame perfect Nash equilibria, and strong Nash equilibria of this game. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008

📜 SIMILAR VOLUMES

Models and heuristics for the k -degree

Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs

✍ Christophe Duhamel; Luís Gouveia; Pedro Moura; Maurício de Souza 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract The __k__ ‐Degree constrained Minimum Spanning Tree Problem (__k__ ‐DMSTP) consists in finding a minimal cost spanning tree satisfying the condition that every node has a degree no greater than a fixed value __k__. Here we consider an extension where besides the edge costs, a concave co