JEL C7 — Game Theory and Bargaining Theory
Inherited economics order with provisional editorial placements for new problems; ranks are independent of permanent problem identifiers. About rankings
Browse by JEL classification
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
107 records · Search and filter
- Econ-156 Exact Nash complexity in concisely represented potential games
- Econ-162 Strategic queue stability
- Econ-163 Explicit constant-regret bounds for plain Optimistic Hedge
- Econ-169 Approximating the least unpopularity margin
- Econ-179 Output-sensitive enumeration of weakly stable matchings with ties
- Econ-182 Approximating the least unpopularity factor in house allocation
- Econ-203 Improving search-and-mix approximation guarantees
- Econ-207 Approximating MAX-SMTI under master-list restrictions
- Econ-217 Approximating the minimum repair budget for one-failure supermatches
- Econ-221 Lattice structure under one preference change on each side
- Econ-229 Maximum number of reachable deferred-acceptance states
- Econ-231 Dynamic matching with congestion, waiting and entry
- Econ-241 Stable-roommates robustness to preference perturbations
- Econ-256 Learning in games and convergence
- Econ-260 Stationary measures with common noise: historical question and remaining scope
- Econ-272 House exchanges along longer social-network cycles
- Econ-275 Winning positions and nim-values in Circular Nim
- Econ-289 Statistical confidence in game equilibria
- Econ-297 Growing numbers of changed agents: correcting an overbroad complexity promise
- Econ-303 A combinatorial polynomial-time nucleolus algorithm for matching games
- Econ-308 Banach-space antipassivity for evolutionary-game smoothing
- Econ-342 A most-probably popular house allocation
- Econ-356 Minimum reachable-state count for doubly prime stable-marriage instances
- Econ-357 A matching with highest stability probability in the lottery model
- Econ-370 Reduced-game validity
- Econ-373 Parameterized computation of a reachable Pareto-optimal allocation
- Econ-377 A most-probably rank-maximal house allocation
- Econ-391 Popularity probability under uncertain house-allocation preferences
- Econ-395 Threshold-constrained infinite-horizon equilibrium realizability
- Econ-396 Parameterized reachability of allocations by improving swaps
- Econ-405 Certified feedback Nash approximations for nonlinear or time-varying games
- Econ-421 Stability probability under compact indifference
- Econ-425 Structural enumeration of minimal balanced collections
- Econ-428 Efficient Birkhoff representation of two-sided robust stable matchings
- Econ-449 Convergence of model-free learning in dynamic population games
- Econ-468 Rank-maximality probability under uncertain preferences
- Econ-491 Trajectory-error certificates for constrained feedback Nash approximations
- Econ-492 Critical Bernoulli densities for expected-polynomial Nash computation
- Econ-493 Equilibrium selection in games
- Econ-496 Speed of learning in games
- Econ-500 Existence of unbeatable strategies in parallel repeated games
- Econ-515 The proposal-total spectrum of doubly prime instances
- Econ-536 Sharper approximation rates with stochastic action sets
- Econ-558 Realizability of every admissible input-block shape
- Econ-568 Learning-based equilibrium selection
- Econ-592 Strategic adaptation after regime changes
- Econ-593 Average-case analysis of specified search-and-mix algorithms
- Econ-601 Stable stochastic FTRL limit sets: boundary-containment agenda
- Econ-610 Learning to sustain cooperation
- Econ-623 A multiplayer extension of Weber-law bargaining