Power Indices in Spanning Connectivity Games (Q3638444): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1904666
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mike S. Paterson / rank
 
Normal rank
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.1007/978-3-642-02158-9_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2113596593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinants of matrices related to the Pascal triangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Network Reliability Analysis: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations research games: A survey. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network analysis. Methodological foundations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control and voting power in corporate networks: Concepts and computational aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3365280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new index of power for simple n-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Properties of the Banzhaf Power Index / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Power-Index Comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning network games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic games are spanning network games / rank
 
Normal rank

Latest revision as of 18:48, 1 July 2024

scientific article
Language Label Description Also known as
English
Power Indices in Spanning Connectivity Games
scientific article

    Statements

    Power Indices in Spanning Connectivity Games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    network connectivity
    0 references
    coalitional games
    0 references
    Banzhaf index
    0 references
    Shapley-Shubik index
    0 references
    0 references