Power surplus solutions for weighted hypergraph communication situations
From MaRDI portal
Publication:6060660
DOI10.1111/itor.13118OpenAlexW4206962181WikidataQ120064601 ScholiaQ120064601MaRDI QIDQ6060660
Reinoud Joosten, Unnamed Author, Xianghui Li, Marc Uetz
Publication date: 29 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/6e3cacce-5dd0-42bb-b87a-c0330bd24c28
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Harsanyi power solutions for graph-restricted games
- A new weight scheme for the Shapley value
- A linear proportional effort allocation rule
- Monotonic solutions of cooperative games
- A value for cooperative games with levels structure of cooperation
- Conference structures and fair allocation rules
- Allocation rules for hypergraph communication situations
- The degree value for games with communication structure
- An axiomatic characterization of the position value for network situations
- Weighted position values
- Potential maximizers and network formation
- A characterization of the position value
- On the Desirability of Acyclic Database Schemes
- On the Position Value for Communication Situations
- Graphs and Cooperation in Games
- WEIGHTED MYERSON VALUE
- LINK MONOTONIC ALLOCATION SCHEMES
This page was built for publication: Power surplus solutions for weighted hypergraph communication situations