NP-completeness in hedonic games (Q1886742)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	NP-completeness in hedonic games	scientific article

Statements

scholarly article

0 references

NP-completeness in hedonic games (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.geb.2003.10.003

0 references

Coralio Ballester

0 references

Games and Economic Behavior

0 references

publication date

19 November 2004

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

Hedonic games

0 references

Coalition formation

0 references

Computational complexity

0 references

NP-hard

0 references

NP-complete

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.geb.2003.10.003

0 references

0 references

Core in a simple coalition formation game

0 references

The complexity of computing a best response automaton in repeated games with mixed strategies

0 references

The stability of hedonic coalition structures

0 references

0 references

Farsighted stability in hedonic games

0 references

Hedonic Coalitions: Optimality and Stability

0 references

Computing the nucleolus of min-cost spanning tree games is NP-hard.

0 references

On the complexity of testing membership in the core of min-cost spanning tree games

0 references

0 references

The complexity of computing best-response automata in repeated games

0 references

0 references

An efficient algorithm for the “stable roommates” problem

0 references

0 references

Minesweeper is NP-complete.

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1886742

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1886742&oldid=34374256"