An iterative procedure for evaluating digraph competitions
type: Item
instance of: scholarly article
title: An iterative procedure for evaluating digraph competitions
zbMATH Open document ID: 1007.91003
DOI: 10.1023/A:1016339832755
author: René van den Brink
author: Marco Slikker
author: Peter Borm
published in: Annals of Operations Research
publication date: 2002-09-03T00:00:00Z
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 93E20
zbMATH DE Number: 1794984
zbMATH Keywords: cooperative games
zbMATH Keywords: digraph competitions
zbMATH Keywords: limit measure
zbMATH Keywords: relational powermeasure
zbMATH Keywords: Shapley value
zbMATH Keywords: stochastic processes
MaRDI profile type: Publication
full work available at URL: a:1016339832755
OpenAlex ID: W1524584516
Recommended article: A note on the \(\beta\)-measure for digraph competitions
Recommended article: Competitive graph searches
Recommended article: Q4386072
Recommended article: Competitive Algorithms for Layered Graph Traversal
Recommended article: Competition-reachability of a graph
Recommended article: Digraph competitions and cooperative games
Recommended article: Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs
Recommended article: On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
Recommended article: On the algorithmic effectiveness of digraph decompositions and complexity measures
description: scientific article; zbMATH DE number 1794984