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...
Guardado en:
Autores principales: | PhuocHoang Le, Tri-Dung Nguyen, Tolga Bektaş |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2016
|
Materias: | |
Acceso en línea: | https://doaj.org/article/d28e207ef285494bbd207cfa51dabe35 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A polyhedral approach to the generalized minimum labeling spanning tree problem
por: ThiagoGouveiada Silva, et al.
Publicado: (2019) -
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
por: Nicola Basilico, et al.
Publicado: (2020) -
Computing Euclidean Steiner trees over segments
por: Ernst Althaus, et al.
Publicado: (2020) -
Robust bilateral trade with discrete types
por: Kamyar Kargar, et al.
Publicado: (2018) -
A distributionally robust optimization approach for two-stage facility location problems
por: Arash Gourtani, et al.
Publicado: (2020)