We study the computational complexity of solving the following problem: Given a game G played on a finite directed graph G, output all nodes in G from which a specific player wins the game G. We provide algorithms for solving the above problem when the games have Büchi and parity winning conditions and the graph G is a tree with back-edges. The running time of the algorithm for Büchi games is O...

An abstract is not available for this content so a preview has been provided. As you have access to content, full PDF via the ‘Save PDF’ action button.

We present an efficient algorithm for computing O(1)-approximate pure Nash equilibria in weighted congestion games with polynomial latency functions of constant maximum degree. For games with linear latency functions, the approximation guarantee is 3+ √ 5 2 + O(γ) for arbitrarily small γ > 0; for latency functions of maximum degree d, it is d. The running time is polynomial in the number of bit...

In this paper we develop a new algorithm for deciding the winner in parity games, and hence also for the modal μ-calculus model checking. The design and analysis of the algorithm is based on a notion of game progress measures: they are witnesses for winning strategies in parity games. We characterize game progress measures as pre-fixed points of certain monotone operators on a complete lattice....

The classical algorithm for solving Büchi games requires time O(n ·m) for game graphs with n states and m edges. For game graphs with constant outdegree, the best known algorithm has running time O(n/ log n). We present two new algorithms for Büchi games. First, we give an algorithm that performs at most O(m) more work than the classical algorithm, but runs in time O(n) on infinitely many graph...

We consider cooperative transferable utility games, or simply TU-games, with limited communication structure in which players can cooperate if and only if they are connected in the communication graph. Solutions for such graph games can be obtained by applying standard solutions to a modified or restricted game that takes account of the cooperation restrictions. We discuss Harsanyi solutions wh...

this study has aimed to investigate the effect ofthree-dimensional and two-dimensional video games on problem-solving styles ofstudents. statistic society in this study consisted of persian gulf universitystudents in 2016-2017 academic year. and after notification by theproclamation, 45 students were selected voluntarily. at first all 45 students,completed intelligence test and past the experie...