The Nucleolus of Directed Acyclic Graph Games
نویسندگان
چکیده
In this paper we consider a natural generalization of standard tree games where the underlying structure is a directed acyclic graph. We analyze the properties of the game and illustrate its relation with other graph based cost games. We show that although the game is not convex its core is always non-empty. Furthermore we provide a painting algorithm for large families of directed acyclic graph games that finds the nucleolus in polynomial time.
منابع مشابه
On the core and nucleolus of directed acyclic graph games
We introduce directed acyclic graph (DAG) games, a generalization of standard tree games, to study cost sharing on networks. This structure has not been previously analyzed from a cooperative game theoretic perspective. Every monotonic and subadditive cost game – including monotonic minimum cost spanning tree games – can be modeled as a DAG-game. We provide an efficiently verifiable condition s...
متن کاملOn the Core of Directed Acyclic Graph Games
There lies a network structure between fixed tree and minimum cost spanning tree networks that has not been previously analyzed from a cooperative game theoretic perspective, namely, directed acyclic graph (DAG) networks. In this paper we consider the cost allocation game defined on DAG-networks. We briefly discuss the relation of DAG-games with other networkbased cost games. We demonstrate tha...
متن کاملFinding Optimal Strategies of Almost Acyclic Simple Stochatic Games
The optimal value computation for turned-based stochastic games with reachability objectives, also known as simple stochastic games, is one of the few problems in NP∩coNP which are not known to be in P. However, there are some cases where these games can be easily solved, as for instance when the underlying graph is acyclic. In this work, we try to extend this tractability to several classes of...
متن کاملFinding Optimal Strategies of Almost Acyclic Simple Stochastic Games
The optimal value computation for turned-based stochastic games with reachability objectives, also known as simple stochastic games, is one of the few problems in NP ∩ coNP which are not known to be in P. However, there are some cases where these games can be easily solved, as for instance when the underlying graph is acyclic. In this work, we try to extend this tractability to several classes ...
متن کاملComputing kernels in graphs with a clique-cutset
In a directed graph, a kernel is a subset of the vertices that is both independent and absorbing. Not all directed graphs have a kernel, and finding classes of graphs having always a kernel or for which deciding the existence of a kernel is polynomial has been the topic of many works in graph theory. We formalize some techniques to build a kernel in a graph with a clique-cutset, knowing kernels...
متن کامل