Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2007.10.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983125930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Stability of Minimum Coloring Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3365280 / 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: Totally balanced combinatorial optimization 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 rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shapley value for cooperative games under precedence constraints / 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: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique polynomials and independent set polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4538166 / 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: Q4369419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodularity of some classes of the combinatorial optimization games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the number of independent sets in chordal graphs / 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: Q5817870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the nucleolus of assignment games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:11, 28 June 2024

scientific article
Language Label Description Also known as
English
Fair cost allocations under conflicts - a game-theoretic point of view -
scientific article

    Statements

    Fair cost allocations under conflicts - a game-theoretic point of view - (English)
    0 references
    0 references
    16 May 2008
    0 references
    algorithmic game theory
    0 references
    combinatorial optimization game
    0 references
    cooperative game
    0 references
    transferable utility game
    0 references
    solution concept
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers