与 «RATIONALIZABLE»相关的英语书籍
在以下的参考文献中发现
rationalizable的用法。与
rationalizable相关的书籍以及同一来源的简短摘要提供其在 英语文献中的使用情境。
1
Essentials of Game Theory: A Concise, Multidisciplinary ...
3.4 RATIONALIZABILITY A strategy is rationalizable if a perfectly rational player
could justifiably play it against one or more perfectly rational opponents.
Informally, a strategy profile for player i is rationalizable if it is a best response to
some ...
Kevin Leyton-Brown, Yoav Shoham, 2008
2
A Course in Game Theory
If OJ C Ai is rationalizable according to Definition 54.1 then define Zi = {a^ U (U^.
Y?) and Zj = (U^Xj) for each j C N \ {i}. If it is rationalizable according to Definition
55.1 then define n\ = ^(j) and ^j(aj) = p.j(aj) for each j C N and each integer t > 2.
Martin J. Osborne, Ariel Rubinstein, 1994
3
Abstracts of the Fifth Spanish Meeting on Game Theory and ...
A rationalizable foresight path is a feasible path of behavior pattern along which
every agent takes a strategy that maximizes his expected discounted payoff
against another path which is in turn a rationalizable foresight path. A strategy ...
4
Equilibrium and Rationality: Game Theory Revised by Decision ...
In a two-person game they call an agent's strategy “rationalizable” if and only if it
maximizes expected utility with respect to a probability assignment to strategies
of his opponent that has her maximize expected utility with respect to a
probability ...
5
Frontiers of Game Theory
Strategies which have already been eliminated at a previous step as not
cautiously rationalizable should never be readmitted into the set of cautiously
rationalizable strategies.4 For similar reasons, the limit sets do not generally
satisfy the ...
K. G. Binmore, A. P. Kirman, Piero Tani, 1993
6
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical ...
A rationalizable strategy profile is a strategy profile that consists only of
rationalizable strategies. For example, in the Matching Pennies game given in
Figure 3.6, the pure strategy heads is rationalizable for the row player. First, the
strategy ...
Yoav Shoham, Kevin Leyton-Brown, 2008
7
The Bounds of Reason: Game Theory and the Unification of the ...
Pure strategies that survive this back-and-forth iterated elimination of pure
strategies are call rationalizable (Bernheim 1984; Pearce 1984). One elegant
formal characterization of rationalizable strategies is in terms of best response
sets.
8
Handbook of Utility Theory: Volume 2: Extensions
the unique properly rationalizable strategy in each subgame, and so a unique
profile of properly rationalizable strategies in the game as a whole. Finally,
proper rationalizability is a strict refinement of W-perfect ratio- nalizability, but
there is no ...
Salvador Barbera, Peter Hammond, Christian Seidl, 2004
9
Essays in Economic Theory, Growth, and Labour Markets: A ...
The minimal requirements of rationality are essentially those of Bernheim (1984)
and Pearce (1984), which are formalized in what they call rationalizable behavior
. Let Z, c Aj be the set of rationalizable actions of player i, and let z = x^uaZy .
George Bitros, Y. S. Katsoulacos, 2002
10
Epistemic Game Theory: Reasoning and Choice
Consider for both players i a set of standard beliefs B,- Q A(C,~) about i's choice.
Say that the pair (31,32) of belief sets is e-perfectly rationalizable if for both
players i, and every belief b,- G B}, we have that (1) b,-(c,~) 2 c(c,-) for all c,- G C},
and ...
