An iterative procedure for evaluating digraph competitions
From MaRDI portal
Publication:1614130
DOI10.1023/A:1016339832755zbMath1007.91003OpenAlexW1524584516MaRDI QIDQ1614130
Marco Slikker, René van den Brink, P. E. M. 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
cooperative gamesstochastic processesShapley valuelimit measuredigraph competitionsrelational powermeasure
Cooperative games (91A12) Optimal stochastic control (93E20) Directed graphs (digraphs), tournaments (05C20)
Related Items
Axioms for centrality scoring with principal eigenvectors ⋮ The consensus value: a new solution concept for cooperative games ⋮ Power measures and solutions for games under precedence constraints ⋮ A note on the \(\beta\)-measure for digraph competitions ⋮ Random walks and diffusion on networks ⋮ A model of influence with a continuum of actions ⋮ Internal slackening scoring methods ⋮ Anonymous social influence ⋮ On two new social choice correspondences. ⋮ Characterizations of the \(\beta\)- and the degree network power measure ⋮ A graph interpretation of the least squares ranking method
