Cooperative interval games: mountain situations with interval data
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 6300221 (Why is no real title available?)
- A Benders decomposition approach for the robust spanning tree problem with interval data
- Big boss interval games
- Connection problems in mountains and monotonic allocation schemes.
- Connection situations under uncertainty and cost monotonic solutions
- Convex interval games
- Cooperation under interval uncertainty
- Cost allocation for a spanning tree
- How to handle interval solutions for cooperative interval games
- Introduction to game theory
- Minimum cost spanning tree games
- Models in Cooperative Game Theory
- On cost allocation for a spanning tree: A game theoretic approach
- On the core and nucleolus of minimum cost spanning tree games
- Sequencing interval situations and related games
- Set-valued solution concepts using interval-type payoffs for interval games
- Some results on cooperative interval games
- The minimum spanning tree problem with fuzzy costs
Cited in
(5)- An application of crypto cloud computing in social networks by cooperative game theory
- The maximal allocated cost and minimal allocated benefit for interval data
- The interval Shapley value of an M/M/1 service system
- A direct projection-based group decision-making methodology with crisp values and interval data
- On the grey obligation rules
This page was built for publication: Cooperative interval games: mountain situations with interval data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349645)