Approximate stable solutions in infinite tree problems

DOI10.1080/02331930902971369zbMath1203.91023OpenAlexW1975923398MaRDI QIDQ3066925

Joaquín Sánchez-Soriano, Vito Fragnelli, Natividad Llorca, S. H. Tijs

Publication date: 20 January 2011

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930902971369

zbMATH Keywords

spanning treescore-like solutionscountable infinite number of players

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Related Items (1)

A new rule for source connection problems

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• The core of a continuum economy with widespread externalities and finite coalitions: From finite to continuum economies
• Minimum cost spanning tree games and population monotonic allocation schemes.
• The core and related solution concepts for infinite assignment games
• The core of a game with a continuum of players and finite coalitions: The model and some results
• Balanced games arising from infinite linear models
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• The optimistic \(TU\) game in minimum cost spanning tree problems
• Minimum cost spanning tree games
• Cost allocation for a spanning tree
• On cost allocation for a spanning tree: A game theoretic approach
• Contagion
• Quasi-Cores in a Monetary Economy with Nonconvex Preferences

This page was built for publication: Approximate stable solutions in infinite tree problems