<--- Back to Details
First PageDocument Content
Nash equilibrium / Repeated game / Extensive-form game / Trembling hand perfect equilibrium / Subgame perfect equilibrium / Minimax / Subgame / Strategy / Game theory / Problem solving / Mathematics
Date: 2000-01-04 12:26:06
Nash equilibrium
Repeated game
Extensive-form game
Trembling hand perfect equilibrium
Subgame perfect equilibrium
Minimax
Subgame
Strategy
Game theory
Problem solving
Mathematics

Title: The Castle on the Hill Author: David K. Levine Department of Economics UCLA Los Angeles, CA[removed]phone/fax[removed]

Add to Reading List

Source URL: www.dklevine.com

Download Document from Source Website

File Size: 97,72 KB

Share Document on Facebook

Similar Documents

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

DocID: 1vqMk - View Document

2015 European Control Conference (ECC) July 15-17, 2015. Linz, Austria Approximate Closed-Loop Minimax Model Predictive Operation Control of Microgrids Christian A. Hans, Vladislav Nenchev, J¨org Raisch and Carsten Rein

2015 European Control Conference (ECC) July 15-17, 2015. Linz, Austria Approximate Closed-Loop Minimax Model Predictive Operation Control of Microgrids Christian A. Hans, Vladislav Nenchev, J¨org Raisch and Carsten Rein

DocID: 1uMON - View Document

Minimax Theory and its Applications Volume), No. 2, 265–283 Bounded Solutions to Nonlinear Problems in RN Involving the Fractional Laplacian Depending on Parameters

Minimax Theory and its Applications Volume), No. 2, 265–283 Bounded Solutions to Nonlinear Problems in RN Involving the Fractional Laplacian Depending on Parameters

DocID: 1unZ8 - View Document

Online Convex Optimization: From Gambling to Minimax Theorems by Playing Repeated Games Tim van Erven

Online Convex Optimization: From Gambling to Minimax Theorems by Playing Repeated Games Tim van Erven

DocID: 1u2Qx - View Document

CS364A: Algorithmic Game Theory Lecture #18: From External Regret to Swap Regret and the Minimax Theorem∗ Tim Roughgarden† November 20, 2013

CS364A: Algorithmic Game Theory Lecture #18: From External Regret to Swap Regret and the Minimax Theorem∗ Tim Roughgarden† November 20, 2013

DocID: 1tNkR - View Document