Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Recommendations
- Designing profit shares in matching and coalition formation games
- Computing stable coalitions: approximation algorithms for reward sharing
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
- Welfare guarantees for proportional allocations
- Welfare guarantees for proportional allocations
Cited in
(13)- On Pareto optimality in social distance games
- On the price of stability of some simple graph-based hedonic games
- How long does it take for all users in a social network to choose their communities?
- scientific article; zbMATH DE number 5823893 (Why is no real title available?)
- Designing profit shares in matching and coalition formation games
- Local fairness in hedonic games via individual threshold coalitions
- Allocation rules for games with optimistic aspirations
- Non-existence of stable social groups in information-driven networks
- How long does it take for all users in a social network to choose their communities?
- scientific article; zbMATH DE number 1534505 (Why is no real title available?)
- Computing stable coalitions: approximation algorithms for reward sharing
- Applying a reputation metric in a two-player resource sharing game
- Hedonic diversity games revisited
This page was built for publication: On proportional allocation in hedonic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681889)
