Pages that link to "Item:Q3162517"
From MaRDI portal
The following pages link to Computing Stable Outcomes in Hedonic Games (Q3162517):
Displaying 14 items.
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities (Q456174) (← links)
- Coordination games on graphs (Q1677255) (← links)
- Dynamics in matching and coalition formation games with structural constraints (Q1711887) (← links)
- On Pareto optimality in social distance games (Q2093365) (← links)
- Hedonic expertise games (Q2670936) (← links)
- The Parallel Complexity of Coloring Games (Q2819445) (← links)
- The Price of Stability of Simple Symmetric Fractional Hedonic Games (Q2819461) (← links)
- Selfish Transportation Games (Q2971133) (← links)
- Settling the Complexity of Local Max-Cut (Almost) Completely (Q3012803) (← links)
- Dynamics of Profit-Sharing Games (Q4985773) (← links)
- Coordination Games on Weighted Directed Graphs (Q5085129) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games (Q5108232) (← links)
- Generalized graph \(k\)-coloring games (Q5918905) (← links)
