• Graduate Program
  • Research
  • Browse our Courses
  • Events
    • Events Calendar
    • Events Archive
    • Tinbergen Institute Lectures
    • Summer School
      • Deep Learning
      • Economics of Blockchain and Digital Currencies
      • Foundations of Machine Learning with Applications in Python
      • Marketing Research with Purpose
      • Modern Toolbox for Spatial and Functional Data
      • Sustainable Finance
      • Tuition Fees and Payment
      • Tinbergen Institute Summer School Program
    • Annual Tinbergen Institute Conference archive
  • News
  • Summer School
    • Deep Learning
    • Economics of Blockchain and Digital Currencies
    • Foundations of Machine Learning with Applications in Python
    • Marketing Research with Purpose
    • Modern Toolbox for Spatial and Functional Data
    • Sustainable Finance
  • Alumni

van den Brink, J.R. and Borm, P. (2002). Digraph Competitions and Cooperative Games Theory and Decision, 53:327--342.


  • Journal
    Theory and Decision

Digraph games are cooperative TU-games associated to domination structures which can be modeled by directed graphs. Examples come from sports competitions or from simple majority win digraphs corresponding to preference profiles in social choice theory. The Shapley value, core, marginal vectors and selectope vectors of digraph games are characterized in terms of so-called simple score vectors. A general characterization of the class of (almost positive) TU-games where each selectope vector is a marginal vector is provided in terms of game semi-circuits. Finally, applications to the ranking of teams in sports competitions and of alternatives in social choice theory are discussed.