The following pages link to Coordination games on graphs (Q1677255):
Displaying 17 items.
- Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
- Local and global price of anarchy of graphical games (Q631783) (← links)
- Topological price of anarchy bounds for clustering games on networks (Q777968) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Digraph competitions and cooperative games (Q1403964) (← links)
- On discrete preferences and coordination (Q1686225) (← links)
- Dynamic matching pennies on networks (Q2329417) (← links)
- A note on concurrent graph sharing games (Q2830435) (← links)
- Anti-coordination Games and Stable Graph Colorings (Q2856137) (← links)
- Invitation games and the price of stability (Q2988870) (← links)
- (Q3059253) (← links)
- Efficient Coordination in Weakest-Link Games (Q4610788) (← links)
- (Q5018506) (← links)
- Coordination Games on Weighted Directed Graphs (Q5085129) (← links)
- Two-Level Cooperative Game on Hypergraph (Q6059054) (← links)
- The optimal way to play the most difficult repeated two-player coordination games (Q6064834) (← links)
- Discrete preference games with logic-based agents: formal framework, complexity, and islands of tractability (Q6579293) (← links)