An iterative procedure for evaluating digraph competitions

DOI10.1023/A:1016339832755MaRDI QIDQ1614130zbMATH OpenOpenAlexFDO

Authors René van den Brink, Marco Slikker, Peter Borm

Publication date 3 September 2002

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016339832755

zbMATH Keywords

cooperative gamesdigraph competitionslimit measurerelational powermeasureShapley valuestochastic processes

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Cooperative games (91A12) Optimal stochastic control (93E20)

Recommendations

• A note on the -measure for digraph competitions
• Competitive graph searches
• scientific article; zbMATH DE number 1145906
• Competitive Algorithms for Layered Graph Traversal
• Competition-reachability of a graph
• Digraph competitions and cooperative games
• Exploring the complexity of layout parameters in tournaments and semi-complete digraphs
• On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
• On the algorithmic effectiveness of digraph decompositions and complexity measures

Cited in

(13)

• The dynamics of self-evaluation
• On two new social choice correspondences.
• Random walks and diffusion on networks
• A graph interpretation of the least squares ranking method
• Power measures and solutions for games under precedence constraints
• The flow network method
• A model of influence with a continuum of actions
• Anonymous social influence
• The consensus value: a new solution concept for cooperative games
• Axioms for centrality scoring with principal eigenvectors
• Internal slackening scoring methods
• A note on the -measure for digraph competitions
• Characterizations of the - and the degree network power measure

This page was built for publication: An iterative procedure for evaluating digraph competitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614130)