An Algorithmic Solution of N-Person Games
نویسندگان
چکیده
function is a function which estimates what resulting value Two-person, perfect information, constant sum games have been studied in Artificial Intelligence. This paper opens up the issue of playing n-person games and proposes a procedure for constant sum or non-constant sum games. It is proved that a procedure, max”, locates an equilibrium point given the entire game tree. The minimax procedure for 2person games using look ahead finds a saddle point of approximations, while maxn finds an equilibrium point of the values of the evaluation function for n-person games using look ahead. Maz” is further analyzed with respect to some pruning schemes.
منابع مشابه
A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games
Abstract This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...
متن کامل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...
متن کاملBI-MATRIX GAMES WITH INTUITIONISTIC FUZZY GOALS
In this paper, we present an application of intuitionistic fuzzyprogramming to a two person bi-matrix game (pair of payoffs matrices) for thesolution with mixed strategies using linear membership and non-membershipfunctions. We also introduce the intuitionistic fuzzy(IF) goal for a choiceof a strategy in a payoff matrix in order to incorporate ambiguity of humanjudgements; a player wants to max...
متن کاملON THE SET OF SOLVABLE w-PERSON GAMES
The set Gn of all n-person games 1 may be considered a convex subset of a euclidean space; Gn has dimension 2 n — n — 2. Although it has not been proved that all games possess a solution, large classes of solvable games have been discovered. In [2], Shapley defined a certain class of solvable games—the quota games—and showed that from the point of view of dimension, the set Qn of all ^-person q...
متن کاملThe Algorithmics of Solitaire-Like Games
One-person solitaire-like games are explored with a view to using them in teaching algorithmic problem solving. The key to understanding solutions to such games is the identification of invariant properties of polynomial arithmetic. We demonstrate this via three case studies: solitaire itself, tiling problems and a novel class of one-person games. The known classification of states of the game ...
متن کامل