All pages
From Theory
Jump to:
navigation
,
search
All pages
Display pages starting at:
Display pages ending at:
Namespace:
(Main)
Talk
User
User talk
Theory
Theory talk
File
File talk
MediaWiki
MediaWiki talk
Template
Template talk
Help
Help talk
Category
Category talk
Hide redirects
All pages
0-1 Games
A proof of the min-max theorem
Adam Tauman Kalai
Adam Tauman Kalai/
Adam Tauman Kalai CV
Adversarial routing game
Auctions
Bargaining
Bounded rationality
CS 8803FC - Foundations of Cryptography. Spring 2008
CS 8803TFC - Theoretical Foundations of Cryptography, Spring 2010
CS 8803TFC - Theoretical Foundations of Cryptography, Spring 2011
CS 8803 - Game Theory and Computer Science. Spring 2008
Chernoff/Hoeffding bounds
Coalitional Form
Common Knowledge
Complexity of iterated elimination of dominated strategies
Computing correlated equilibrium
Convex-concave games
Correlated Equilibrium
Cryptography Group
Cryptography Group at Georgia Tech
Cryptography group
Cryptography reading group
Domestic foreign production example
Epsilon-equilibria
Evolutationarily stable strategy
Evolutationarily stable strategy and Correlated Equilibrium
Evolutionarily Stable Strategy (ESS)
Extensive-form games
FC08 Assignment 1
FC08 Assignment 2
FC08 Assignment 3
FC08 Assignment 5
Folk theorem
Further notation
GTCS Assignment 1
GTCS Assignment 2
GTCS Assignment 3
GTCS Assignment 4
GTCS FINAL Assignment
GTCS Lecture 1/10/08
GTCS Lecture 1/15/08
GTCS Lecture 1/17/08
GTCS Lecture 1/22/08
GTCS Lecture 1/8/08
GTCS Lecture 2/26/08
Hardness of finding NE
Incomplete information
Iterated elimination of dominated strategies
KalaiSastry08
Large Games
Main Page
Market Equilibrium
Match pennies
Midterm
Min-max theorem
Mixed-strategy normal-form game
Multi-armed bandits
Nash equilibria in perturbed games
Nash equilibrium
Network formation game
Normal-form game
Persistent Nash equilibrium
Price of anarchy
Price of stability
Price of stability and the Network formation game
Proof of the weighted majority theorem
Rational learning
Repeated games
Repeated n-decision game
Stable Nash equilibrium
Strict Nash equilibrium
Structured decision-making algorithm
Subgame-perfect equilibrium
Summary: the complexity of solving/playing normal-form zero-sum games
Swap regret
The Core
The Shapley Value
Trembling-hand perfect equilibrium
Uniqueness
Uniqueness of the Shapley Value
Utility theory
Weighted-majority algorithm
Weighted majority
Weighted majority algorithm and the min-max theorem
Weighted majority theorem
Yael Tauman Kalai
Yael Tauman Kalai/
Zero-sum game
Zero-sum games
Navigation menu
Views
Special page
Personal tools
Log in
Navigation
Main page
Recent changes
Random page
Help
Search
Tools
Special pages
Printable version