Pages that link to "Item:Q3596717"
From MaRDI portal
The following pages link to A Game Theoretic Approach for Efficient Graph Coloring (Q3596717):
Displayed 14 items.
- Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game (Q503156) (← links)
- Coordination games on graphs (Q1677255) (← links)
- On the Nash number and the diminishing Grundy number of a graph (Q2127607) (← links)
- Non-existence of stable social groups in information-driven networks (Q2158297) (← links)
- How long does it take for all users in a social network to choose their communities? (Q2334040) (← links)
- On spectrum sharing games (Q2377140) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- The Parallel Complexity of Coloring Games (Q2819445) (← links)
- Network Coloring and Colored Coin Games (Q2961393) (← links)
- (Q3305724) (← links)
- Coordination Games on Weighted Directed Graphs (Q5085129) (← links)
- Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620) (← links)
- Generalized graph \(k\)-coloring games (Q5918905) (← links)
