Category:Game theory
![]() | Computing portal |
Here is a list of articles in the Game theory category of the Computing portal that unifies foundations of mathematics and computations using computers.
Game theory is included in the JEL classification codes as JEL: C7 |
Game theory is a branch of mathematics that uses models to study interactions with formalized incentive structures ("games"). It has applications in a variety of fields, including economics, evolutionary biology, political science, social psychology and military strategy.
Subcategories
This category has the following 4 subcategories, out of 4 total.
A
C
G
M
Pages in category "Game theory"
The following 200 pages are in this category, out of 217 total.
(previous page) (next page)- Finite game (computing)
- Game theory (computing)
*
- Evolutionary game theory (computing)
- Glossary of game theory (computing)
A
- AL procedure (computing)
- Algorithmic game theory (computing)
- Algorithmic mechanism design (computing)
- Ambiguity aversion (computing)
- Analytic narrative (computing)
- Asynchrony (game theory) (software)
- Auction theory (computing)
- Aumann's agreement theorem (computing)
- Author-level metrics (computing)
- Authority distribution (computing)
- Axiom of projective determinacy (computing)
B
- Backgammon opening theory (computing)
- Backward induction (computing)
- Bandwidth-sharing game (computing)
- Bankruptcy problem (computing)
- Banzhaf power index (computing)
- Bayesian efficiency (computing)
- Bayesian regret (computing)
- Behavioral game theory (computing)
- Bertrand paradox (economics) (computing)
- Bertrand–Edgeworth model (computing)
- Best response (computing)
- Bondareva–Shapley theorem (computing)
- The Bottle Imp (computing)
- Bounded rationality (computing)
- Braess's paradox (computing)
C
- CC–PP game (computing)
- Chainstore paradox (computing)
- Cheap talk (computing)
- Chemical game theory (chemistry)
- Chess opening (computing)
- Collusion (computing)
- Combinatorial explosion (computing)
- Commitment device (computing)
- Common knowledge (logic) (philosophy)
- Competitive altruism (biology)
- Competitive regret (computing)
- Complete information (computing)
- Complete mixing (computing)
- Compromise (computing)
- Confrontation analysis (computing)
- Conjectural variation (computing)
- Consensus dynamics (computing)
- Contingent cooperator (computing)
- Contract theory (computing)
- Cooperative game theory (computing)
- Coopetition (computing)
- Core (game theory) (software)
- Countersignaling (computing)
D
- Distributed algorithmic mechanism design (computing)
- Drama theory (computing)
- Dynamic inconsistency (computing)
E
- Economic justice (computing)
- Economic Justice (computing)
- Edgeworth conjecture (computing)
- Edgeworth paradox (computing)
- Edgeworth price cycle (computing)
- Escalation of commitment (computing)
- Evolution and the Theory of Games (computing)
- Evolutionarily stable state (computing)
- Expected utility hypothesis (computing)
- Expected value of including uncertainty (computing)
- Expected value of perfect information (computing)
- Expected value of sample information (computing)
- Expectiminimax (computing)
- Expectiminimax tree (computing)
F
- Fair division (computing)
- Fictitious play (computing)
- First-player and second-player win (computing)
- Fixed point (mathematics) (computing)
- Focal point (game theory) (software)
G
- Game complexity (computing)
- Game Description Language (computing)
- Game design (computing)
- Game semantics (computing)
- Game Theory Society (organization)
- Games and Economic Behavior (computing)
- General equilibrium theory (computing)
- General game playing (computing)
- General video game playing (computing)
- Generalized game theory (computing)
- Gibbs lemma (computing)
- Glicksberg's theorem (computing)
- Grand coalition (computing)
- Graph continuous function (computing)
- Graphical game theory (computing)
- Gridlock (economics) (computing)
H
- Hat puzzle (computing)
- Helly metric (computing)
- Hicks optimality (computing)
- Hierarchy of beliefs (computing)
- Hobbesian trap (philosophy)
- Homicidal chauffeur problem (computing)
- Homo economicus (computing)
I
- Implementation theory (computing)
- Incentive compatibility (computing)
- Inequity aversion (computing)
- Information set (game theory) (software)
- Interdependence theory (computing)
- International Society of Dynamic Games (organization)
K
- Kalai–Smorodinsky bargaining solution (computing)
- Keynesian beauty contest (computing)
- Kuhn's theorem (computing)
- Ky Fan inequality (game theory) (software)
- Ky Fan's inequality (computing)
L
- Lemke–Howson algorithm (computing)
- Level k theory (computing)
- List of games in game theory (computing)
M
- M equilibrium (computing)
- Markov strategy (computing)
- Martingale (probability theory) (computing)
- Mathematics of Operations Research (computing)
- Mathematics of Sudoku (computing)
- Max-dominated strategy (computing)
- Mean field game theory (computing)
- Mean-field game theory (computing)
- Mechanism design (computing)
- Median voter theorem (computing)
- Metagame analysis (computing)
- Metagaming (computing)
- Minimal-entropy martingale measure (computing)
- Minimax (computing)
- Minimax theorem (computing)
- Move by nature (computing)
- Moving-knife procedure (computing)
- Mutual knowledge (computing)
- Mutual knowledge (logic) (philosophy)
- Myerson–Satterthwaite theorem (computing)
N
- Negotiation theory (computing)
- No-win situation (computing)
- Non-credible threat (computing)
- Null move (computing)
O
- One-shot deviation principle (computing)
- Open Options Corporation (company)
- Open-loop model (computing)
- Outcome (game theory) (software)
P
- Pareto efficiency (computing)
- Parrondo's paradox (computing)
- Parthasarathy's theorem (computing)
- Penrose square root law (computing)
- Perfect information (computing)
- Perfect rationality (computing)
- Platonia dilemma (philosophy)
- Ply (game theory) (software)
- Price of anarchy (computing)
- Price of stability (computing)
- Prim–Read theory (computing)
- Punctuality (computing)
- Purification theorem (computing)
Q
- Quantum game theory (physics)
- Quantum pseudo-telepathy (physics)
- Quantum refereed game (computing)
R
- Ratchet effect (computing)
- Rational agent (computing)
- Rational ignorance (computing)
- Rational irrationality (computing)
- Rationalizability (computing)
- Replicator equation (computing)
- Revelation principle (computing)
- Risk aversion (psychology) (philosophy)
- Roemer model of political competition (computing)
- Rubinstein bargaining model (computing)
- Rule complex (computing)
S
- Sequential game (computing)
- Shapley value (computing)
- Shapley–Shubik power index (computing)
- Signalling (economics) (computing)
- Simulations and games in economics education (computing)
- Simultaneous action selection (computing)
- Simultaneous game (computing)
- Sion's minimax theorem (computing)
- Smart market (computing)
- Social rationality (computing)
- Social software (social procedure) (computing)
- Social trap (computing)
- Social value orientations (computing)
- Solution concept (computing)
- Solving chess (computing)
- Spite (game theory) (software)
- Stable marriage problem (computing)
- Stable roommates problem (computing)
- Stackelberg competition (computing)
- Strategic complements (computing)
- Strategic dominance (computing)
- Strategic fair division (computing)
- Strategic move (computing)
- Strategy (game theory) (software)
- Strategyproofness (computing)
- Subgame (computing)
- Subjective expected relative similarity (computing)
- Subjective expected relative similarity (SERS) (computing)
- Sunk cost (computing)
- Superrationality (computing)
- Swap regret (computing)
T
- Terminal investment hypothesis (computing)
- Theory of Games and Economic Behavior (computing)