Computing the nucleolus of weighted voting games in pseudo-polynomial time (Q2089798): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Erratum: ``PRIMES is in P'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game theoretic analysis of a bankruptcy problem from the Talmud / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nucleolus of shortest path games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding nucleolus of flow game / 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: Q4633840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nucleolus of min-cost spanning tree games is NP-hard. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nucleolus of neighbor games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Games: The Least Core and the Nucleolus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the nucleolus and the kernel of the assignment game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nucleolus of a Characteristic Function Game / rank
 
Normal rank

Revision as of 15:07, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing the nucleolus of weighted voting games in pseudo-polynomial time
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references