The University of Southampton
University of Southampton Institutional Repository

Generalized minimum spanning tree games

Generalized minimum spanning tree games
Generalized minimum spanning tree games
The minimum-cost spanning tree game is a special class of cooperative games defined on a graph with a set of vertices and a set of edges, where each player owns a vertex. Solutions of the game represent ways to distribute the total cost of a minimum-cost spanning tree among all the players. When the graph is partitioned into clusters, the generalized minimum spanning tree problem is to determine a minimum-cost tree including exactly one vertex from each cluster. This paper introduces the generalized minimum spanning tree game and studies some properties of this game. The paper also describes a constraint generation algorithm to calculate a stable payoff distribution and presents computational results obtained using the proposed algorithm
2192-4406
1-22
Le, P.
70c6e39a-4046-48e4-94f0-eab08c73882b
Nguyen, T.-D.
a6aa7081-6bf7-488a-b72f-510328958a8e
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Le, P.
70c6e39a-4046-48e4-94f0-eab08c73882b
Nguyen, T.-D.
a6aa7081-6bf7-488a-b72f-510328958a8e
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9

Le, P., Nguyen, T.-D. and Bektas, T. (2015) Generalized minimum spanning tree games. EURO Journal on Computational Optimization, 1-22. (doi:10.1007/s13675-015-0042-y).

Record type: Article

Abstract

The minimum-cost spanning tree game is a special class of cooperative games defined on a graph with a set of vertices and a set of edges, where each player owns a vertex. Solutions of the game represent ways to distribute the total cost of a minimum-cost spanning tree among all the players. When the graph is partitioned into clusters, the generalized minimum spanning tree problem is to determine a minimum-cost tree including exactly one vertex from each cluster. This paper introduces the generalized minimum spanning tree game and studies some properties of this game. The paper also describes a constraint generation algorithm to calculate a stable payoff distribution and presents computational results obtained using the proposed algorithm

Text
EJCO 27-05.pdf - Accepted Manuscript
Download (943kB)

More information

Accepted/In Press date: 17 July 2015
e-pub ahead of print date: 22 August 2015
Organisations: Southampton Business School

Identifiers

Local EPrints ID: 379367
URI: http://eprints.soton.ac.uk/id/eprint/379367
ISSN: 2192-4406
PURE UUID: 79021277-f62e-4ffc-ba7e-3dd08c800bc3
ORCID for T.-D. Nguyen: ORCID iD orcid.org/0000-0002-4158-9099
ORCID for T. Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 24 Jul 2015 13:33
Last modified: 15 Mar 2024 03:37

Export record

Altmetrics

Contributors

Author: P. Le
Author: T.-D. Nguyen ORCID iD
Author: T. Bektas ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×