Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems.
Argyrios DeligkasEduard EibenGregory Z. GutinPhilip R. NearyAnders YeoPublished in: CoRR (2023)
Keyphrases
- decision problems
- multiagent coordination
- optimization problems
- np hardness
- efficient solutions
- computational complexity
- multi class
- np complete
- computer games
- extensive form games
- computational issues
- solution concepts
- plan execution
- non binary
- related problems
- solving problems
- space complexity
- video games
- data sets
- game theory
- multiagent systems
- mobile robot
- evolutionary algorithm
- multi agent systems
- cooperative