Advances in Game TheoryPrinceton University Press, 21. 6. 1964 - Počet stran: 679 A classic treatment of game theory from the acclaimed Annals of Mathematics Studies series |
Obsah
Preface | 1 |
Games With a Random Move | 29 |
A Search Game | 39 |
The Rendezvous Value of a Metric Space | 49 |
Generalized Gross Substitutability and Extremization | 55 |
Adaptive Competitive Decision | 69 |
Infinite Games of Perfect Information | 85 |
Continuous Games of Perfect Information | 103 |
The Tensor Composition of Nonnegative Games | 307 |
On the Cardinality of Solutions of FourPerson Constant | 327 |
By Guillermo Owen | 345 |
ThreePerson Cooperative Games Without Side Payments | 377 |
Some Thoughts on the Theory of Cooperative Games | 407 |
The Bargaining Set for Cooperative Games | 443 |
Stable Payoff Configurations for Quota Games | 477 |
On the Bargaining Set M of mQuota Games | 501 |
A Theory of Pursuit and Evasion | 113 |
A Variational Approach to Differential Games | 127 |
A Differential Game Without Pure Strategy Solutions | 175 |
The Convergence Problem for Differential Games II | 195 |
Markov Games | 211 |
Homogeneous Games III | 255 |
Solutions of Compound Simple Games | 267 |
A Property of Stability Possessed by Certain Imputations | 513 |
Coalition Bargaining in nPerson Games | 531 |
The nPerson Bargaining Game | 547 |
Valuation of nPerson Games | 577 |
Mixed and Behavior Strategies in Infinite Extensive Games | 627 |
A General Solution for Finite Noncooperative Games Based | 651 |
Další vydání - Zobrazit všechny
Běžně se vyskytující výrazy a sousloví
A-stable A₁ admissible set Annals of Mathematics arbitrary assume B₁ bargaining set C₁ catalogues characteristic function coalition coalition structure components consider constant-sum games contains convex cooperative games corresponding counter objection D₁ defined definition denote dominates doubly discriminatory E₁ equation equilibrium strategy example exists finite follows game theory given Hence implies imputation inequalities K-game Lemma linearly equivalent m-coalitions matrix maximal mixed strategy n-person game Neumann obtain optimal strategy pair payoff vector play Princeton PROOF prove pure strategies quota game quota split regular decomposition risk-dominance S₁ S₂ saddle-point satisfies Section sequence Shapley Shapley value simple game space stability strategy set strictly effective subgame subset Suppose t₁ Theorem theory tion two-person U₁ v{ij value function w₁ w₂ weak player winning X₁ Y₁ Z₁