Jazza
05-23-2005, 04:42 AM
i am interested in one on one zero sum games
a lot of these games end up with the EV a function of say X variables that player A gets to choose, and Y variables that player B gets to choose, all these variable have to be between 0 and 1
and usually the EV is linear in each variable (i'm not sure if this is the correct wording)
to further elaborate, suppose the variables that Player A chooses are labelled X(1), X(2), X(3),...., X(n)
the EV function can always be put in the form EV=X(m)*F+G for all m
where F and G are functions of all the variables Player A and Player B choose, except X(m)
So my questions are:
there is always at least 1 Nash Equilibrium yeah?
two perfect players will always choose a set of strategies that form a Nash Equilibrium yeah?
are there any algorithms for finding any or all of the Nash Equilibriums for the case i described?
a lot of these games end up with the EV a function of say X variables that player A gets to choose, and Y variables that player B gets to choose, all these variable have to be between 0 and 1
and usually the EV is linear in each variable (i'm not sure if this is the correct wording)
to further elaborate, suppose the variables that Player A chooses are labelled X(1), X(2), X(3),...., X(n)
the EV function can always be put in the form EV=X(m)*F+G for all m
where F and G are functions of all the variables Player A and Player B choose, except X(m)
So my questions are:
there is always at least 1 Nash Equilibrium yeah?
two perfect players will always choose a set of strategies that form a Nash Equilibrium yeah?
are there any algorithms for finding any or all of the Nash Equilibriums for the case i described?