On the complexity of problems on simple games (Q5388151): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complete simple games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dimension of simple monotonic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Cooperative Solution Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of weighted voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple games and weighted games: A theoretical and computational viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted voting, abstention, and multiple levels of approval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometric separability of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness for calculating power indices of weighted majority games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision tree approximations of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for regular set-covering and threshold synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some problems concerning voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple games and magic squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4700639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank

Latest revision as of 02:40, 5 July 2024

scientific article; zbMATH DE number 6025217
Language Label Description Also known as
English
On the complexity of problems on simple games
scientific article; zbMATH DE number 6025217

    Statements

    On the complexity of problems on simple games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 April 2012
    0 references
    0 references
    simple
    0 references
    weighted
    0 references
    majority games
    0 references
    NP-completeness
    0 references
    0 references