EconCSLib
Dependency graph
▾
Topics
Foundation
Argmax
Cost
Examples
Preference
Profile
Utility
Game Theory
Cooperative Game
Classes
Core
Shapley Value
Extensive Game
Core
Examples
Imperfect Information
Normal Form
Perfect Information
Repeated Game
Core
Folk Theorem
Incomplete Info
Stochastic Game
Asymptotic
Core
Value
Strategic Game
Bayesian Correlated
Continuous
Core
Dominance
Dynamics
Equilibrium
Refinements
Zero Sum
Applications
Continuous
Core
Examples
Learning
Minimax
Operators
Market Design
Matching
One To One
Math
Fixed Point
Lattice
Linear Algebra
Alternatives
Linear Programming
Duality
Minimax Bridge
Minimax
Order
Simplex
Mechanism Design
Auction
Basic
Bayesian
Knapsack
Online
Basic
Bayesian
Myerson
Transfer
Vcg
Social Choice
Fair Division
Core
Divisible
Cut And Choose
Dubins Spanier
Stromquist
Indivisible
Algorithms
Mms
Voting
Arrow
Gibbard Satterthwaite
Rules
▾
Keywords
action
acyclic
additive
affine
aggregation
algorithm
algorithms
all-pay
allocation
allocation-rule
alpha-mms
alternatives
antisymmetric
applications
approachability
approximate-equilibrium
approximation
argmax
arrow
asymptotic-value
auction
aumann-maschler
axiom
axioms
backward-induction
balancedness
bargaining
base-case
bayes-nash
bayesian
bayesian-equilibrium
bayesian-game
bayesian-mechanism
bayesian-nash-equilibrium
behavioral-strategy
belief
best-response
bewley-kohlberg
bid-profile
bids
big-match
bijection
binary-allocation
blocking-pair
bnic
bondareva-shapley
borda
bounds
brouwer
cake-cutting
calibration
cara
cardinal
catalog
cdf
cesaro
chance
characteristic-function
checker
clarke-pivot
classic
coalitional-game
combinatorics
common-knowledge
compactness
competitive-ratio
complementarity
completely-mixed
complexity
computation
condorcet
continuity
continuous-game
contraction
control
convergence
convex-combination
convex-game
convexity
core
correlated-equilibrium
correlation
correlation-device
cost
counterexample
cournot
cut-and-choose
decidable
decisive-coalition
deferred
deferred-acceptance
derived-game
determinacy
deviation
dictator
dirac
direct-mechanism
discontinuous-game
discounted-value
discounting
divisible
dominance
dsic
duality
dubins-spanier
duel
dutch-auction
dynamic-programming
dynamics
ef1
efficiency
efx
egalitarian
elimination
english-auction
entry-fee
envelope
envy-cycle
envy-free
equilibrium
equilibrium-manifold
equilibrium-refinement
equilibrium-selection
equitable
equivalence
ess
evolution
ex-ante
example
exercise
existence
expected-payoff
expected-utility
extensive-game
fair-division
fairness
farkas
feasible-payoff
fictitious-play
field-expansion
field-generic
finite-game
first-price
fixed-point
focal-point
folk-theorem
forward-induction
foundational
fourier-motzkin
fubini
gale-shapley
game-tree
general-sum
genericity
gibbard-satterthwaite
guarantee
history
idempotent
iia
imperfect-information
imperfect-monitoring
impossibility
imputation
incentive-compatibility
incomplete-information
independence
index
indifference
individual-rationality
indivisible
induction
information-set
instance
interim
intermediate-value-theorem
invariance
invariant
invariant-distribution
ipv
japanese-auction
kakutani
kkm
knapsack
kuhn-theorem
lattice
learning
limit
linear-algebra
linear-programming
loomis
lottery
lp-dual
lp-primal
lyapunov
majority
marginal-contribution
market-design
markov
matching
matrix-game
maximin
maximin-share
measure
mechanism
mechanism-design
memoization
memory
mertens
mertens-neyman
minimax
minority-game
mixed-strategy
mms
monad
monotone-game
monotonic
monotonicity
moving-knife
muller-satterthwaite
multiple-parameter
myerson
nash-equilibrium
nature
needle
no-externality
non-player
normal-form
normal-form-reduction
obedience
one-to-one
online-algorithm
optimal-auction
optimal-strategy
optimality
order
ordered-field
ordinal
outcome
parallel
pareto
partition
payment-construction
payment-identity
payoff
payoff-aggregation
payoff-vector
peak-memory
perfect-information
perfect-recall
perfection
perron-frobenius
plurality
polytope
population-game
positivity
posted-price
potential-game
predicate
preference
probability
profile
proof-plan
proper-equilibrium
proportional
provenance
prudence
quasi-linear-utility
random-order
randomized-strategy
rationality
rationalizability
refinement
regret
regularity
repeated-game
replicator-dynamics
representation
reserve-price
retract
revelation-principle
revenue-comparison
revenue-equivalence
revenue-improvement
risk
risk-aversion
robinson
robustness
rotation
round-robin
rule
rural-hospitals
saddle-point
sample-then-threshold
scarf
second-price
second-price-auction
selling-problem
semi-algebraic
separation
sequential-equilibrium
shapley-operator
shapley-value
signals
simple-game
simplex
single-item
single-parameter
singleton
sion
smooth-game
social-choice
social-welfare
solution-concept
source
stability
stable-set
staged
state-dynamics
stationary-distribution
stochastic-game
stochastic-matrix
strategic-equivalence
strategic-game
strategic-stability
strategy
strategy-proofness
strategyproof
strict-equilibrium
strict-preference
stromquist
subgame
subgame-perfect-equilibrium
superadditivity
supermodular-game
supermodularity
support
symmetric-equilibrium
symmetric-ipv
symmetry
tarski
termination
theorem
time-complexity
topology
total-preorder
transferable-utility
transfers
tropical
two-by-two
uniform-equilibrium
uniform-value
uniqueness
utilitarian
utility
utility-representation
valuation
value
value-operator
variational-inequality
vcg
vector-payoff
vickrey
ville
virtual-surplus
virtual-valuation
vnm
voting
wardrop-equilibrium
weak-duality
weakly-dominant
weighted-sum
welfare
welfare-without
well-founded
zermelo
zero-sum
Keyword: dynamic-programming
Theorem
Knapsack Relaxations And Dynamic Programming
proved
Example
Worked Example: Longest Common Subsequence DP Grid
formalized