• Graduate Programs
  • Research
  • Browse our Courses
  • Events
    • Events Calendar
    • Events Archive
    • Summer School
      • Applied Public Policy Evaluation
      • Deep Learning
      • Development Economics
      • Economics of Blockchain and Digital Currencies
      • Economics of Climate Change
      • The Economics of Crime
      • Foundations of Machine Learning with Applications in Python
      • From Preference to Choice: The Economic Theory of Decision-Making
      • Inequalities in Health and Healthcare
      • Marketing Research with Purpose
      • Markets with Frictions
      • Modern Toolbox for Spatial and Functional Data
      • Sustainable Finance
      • Tuition Fees and Payment
      • Business Data Science Summer School Program
    • Tinbergen Institute Lectures
    • 2026 Tinbergen Institute Opening Conference
    • Annual Tinbergen Institute Conference
  • News
  • Summer School
    • Applied Public Policy Evaluation
    • Deep Learning
    • Development Economics
    • Economics of Blockchain and Digital Currencies
    • Economics of Climate Change
    • The Economics of Crime
    • Foundations of Machine Learning with Applications in Python
    • From Preference to Choice: The Economic Theory of Decision-Making
    • Inequalities in Health and Healthcare
    • Marketing Research with Purpose
    • Markets with Frictions
    • Modern Toolbox for Spatial and Functional Data
    • Sustainable Finance
    • Tuition Fees and Payment
  • Alumni

van den Brink, J.R., Katsev, I. and van der Laan, G. (2010). An algorithm for computing the nucleolus of disjunctive games with an acyclic permission structure European Journal of Operational Research, 207:817--826.


  • Journal
    European Journal of Operational Research

A cooperative game with a permission structure describes a situation in which players in a cooperative TU-game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. In this paper we consider non-negative additive games with an acyclic permission structure. For such a game we provide a polynomial time algorithm for computing the nucleolus of the induced restricted game. The algorithm is applied to a market situation where sellers can sell objects to buyers through a directed network of intermediaries. {\textcopyright} 2010 Elsevier B.V. All rights reserved.