The \(cg\)-average tree value for games on cycle-free fuzzy communication structures
From MaRDI portal
Publication:2334469
DOI10.1007/s11750-019-00518-0zbMath1426.91018OpenAlexW2964064970WikidataQ127737260 ScholiaQ127737260MaRDI QIDQ2334469
I. Gallego, Julio R. Fernández, Andrés Jiménez-Losada, Manuel Ordóñez
Publication date: 7 November 2019
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-019-00518-0
Cooperative games (91A12) Games involving graphs (91A43) Signaling and communication in game theory (91A28) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Banzhaf value for games with fuzzy communication structure: computing the power of the political groups in the European parliament
- Games on fuzzy communication structures with Choquet players
- Games with permission structures: The conjunctive approach
- Generating functions for computing the Myerson value
- The average tree solution for cooperative games with communication structure
- Myerson values for games with fuzzy communication structure
- The average tree solution for cycle-free graph games
- Theory of capacities
- ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES
- Cooperative Fuzzy Games
- Graphs and Cooperation in Games
- A Shapley function on a class of cooperative fuzzy games.
This page was built for publication: The \(cg\)-average tree value for games on cycle-free fuzzy communication structures