Typically, game theory assumes that players are rational, a requirement which that players always make the decision which most benefits them based on the information available (as defined by that game), but also that players are always capable of making that decision (regardless of the amount of calculation which might be necessary in practice).
Branches of game theory include cooperative game theory, in which players can negotiate and enforce bargains and non-cooperative game theory, in which the only meaningful agreements are those which are “self-enforcing,” that is, which the players have an incentive not to break.
Many fields of mathematics (set theory, recursion theory, topology, and combinatorics, among others) apply game theory by representing problems as games and then use game theoretic techniques to find a solution. (To see how an application might work, consider that a proof can be viewed as a game between a ”prover” and a ”refuter,” where every universal quantifier represents a move by the refuter, and every existenial one a move by the prover; the proof is valid exactly when the prover can always win the corresponding game.)
|Date of creation||2013-03-22 12:51:55|
|Last modified on||2013-03-22 12:51:55|
|Last modified by||Henry (455)|