Spanning-tree games
From MaRDI portal
Recommendations
Cites work
- A Solution of the Shannon Switching Game
- Algorithmic Game Theory
- Alternation
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Cost allocation in networks: The bulk supplier problem
- Cost monotonicity, consistency and minimum cost spanning tree games
- Flow games
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 140096 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- On saturation games
- On the combinational complexity of certain symmetric Boolean functions
- On the core and nucleolus of minimum cost spanning tree games
- On the History of the Minimum Spanning Tree Problem
- On the length of a random minimum spanning tree
- On the shortest spanning subtree of a graph and the traveling salesman problem
- On the value of a random minimum spanning tree problem
- The Map-Coloring Game
- The Stackelberg minimum spanning tree game
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Cited in
(10)- Tree-connected peer group situations and peer group games
- Three-person spanning tree games
- Domination game played on trees and spanning subgraphs
- The matroid cup game
- scientific article; zbMATH DE number 65694 (Why is no real title available?)
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- Specializations and generalizations of the Stackelberg minimum spanning tree game
- The Stackelberg minimum spanning tree game
- Weighted tree games
- The minimum cost spanning forest game
This page was built for publication: Spanning-tree games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005136)
