Shortest Path Games : Computational Complexity of Solution Concepts
نویسنده
چکیده
منابع مشابه
Graph-based coalitional games: an analysis via characteristics
In this paper we motivate a new approach to analyse the computational complexity of solution concepts and playerbased properties, as well as other properties of coalitional games. This approach is based on the idea to abstract away from detailed game representations to analyse games via standard complexity proofs, towards a more abstract approach, where games are analysed by focusing on influen...
متن کاملThe Inverse Shortest Paths Problem with Upper Bounds on Shortest Paths Costs
We examine the computational complexity of the inverse shortest paths problem with upper bounds on shortest path costs, and prove that obtaining a globally optimum solution to this problem is NP-complete. An algorithm for nding a locally optimum solution is proposed, discussed and tested.
متن کاملOn the complexity of undominated core and farsighted solution concepts in coalitional games
In this paper, we study the computational complexity of solution concepts in the context of coalitional games. Firstly, we distinguish two different kinds of core, the undominated core and excess core, and investigate the difference and relationship between them. Secondly, we thoroughly investigate the computational complexity of undominated core and three farsighted solution concepts—farsighte...
متن کاملComparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
The Random Shortest Path Problem with the second moment criterion is discussed in this paper. After the formulation of the problem, exact algorithms, based on general concepts for solving the Multi-objective Shortest Path Problem, are described. Next, several approximate algorithms are proposed. It is shown that the complexity of the exact algorithms is exponential, while the complexity of the ...
متن کاملCooperative Benefit and Cost Games under Fairness Concerns
Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...
متن کامل