A note on anti-coordination and social interactions
From MaRDI portal
Publication:386417
DOI10.1007/s10878-012-9486-7zbMath1282.90148arXiv1201.0410MaRDI QIDQ386417
Publication date: 9 December 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.0410
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items
Schedules for marketing products with negative externalities, The fashion game: network extension of matching pennies
Cites Work
- Unnamed Item
- Anti-coordination and social interactions
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Optimization, approximation, and complexity classes
- Claw-free graphs---a survey
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Potential games
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Dynamics in Network Interaction Games
- On Syntactic versus Computational Views of Approximability
- Combinatorial optimization. Theory and algorithms.