Finding nucleolus of flow game (Q5896983): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-008-9138-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3137934641 / 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: Strongly essential coalitions and the nucleolus of peer group 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: Algorithmic Aspects of the Core of Combinatorial Optimization Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding nucleolus of flow game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / 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: On the computation of the nucleolus of a cooperative game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computational complexity of membership test in flow games and linear production games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative facility location games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel/nucleolus of a standard tree game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization sets for the nucleolus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally Balanced Games and Games of Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Network Problems Yielding Totally Balanced 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: Computing the nucleolus of some combinatorially-structured games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the core of linear production games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nucleolus of balanced simple flow networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nucleolus of a Characteristic Function Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment game. I: The core / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the nucleolus of assignment games / rank
 
Normal rank

Latest revision as of 23:20, 1 July 2024

scientific article; zbMATH DE number 5601554
Language Label Description Also known as
English
Finding nucleolus of flow game
scientific article; zbMATH DE number 5601554

    Statements

    Finding nucleolus of flow game (English)
    0 references
    0 references
    0 references
    0 references
    2 September 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    flow game
    0 references
    nucleolus
    0 references
    linear program duality
    0 references
    efficient algorithm
    0 references
    \(\mathcal{NP}\)-hard
    0 references
    0 references
    0 references
    0 references