No article text was recorded for this version.
pure strategy restriction
Version 1 of 174 papers78 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Parameterized Complexity of Hotelling-Downs with Party Nominees
- Blog: Using Iterated Best-Response to Find Bayes-Nash Equilibria in Auctions
- Blog: Equilibrium convergence in large games
- Blog: C-Nash: A Novel Ferroelectric Computing-in-Memory Architecture for Solving Mixed Strategy Nash Equilibrium
- Blog: Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach
- Blog: Cross-Layer Coordinated Attacks on Cyber-Physical Systems: A LQG Game Framework with Controlled Observations
- Blog: Optimal Strategies for Gaussian Jamming in Block-Fading Channels under Delay and Power Constraints
- Blog: Bidding Graph Games with Partially-Observable Budgets
- Blog: Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions
- Blog: Can Buyers Reveal for a Better Deal?
- Blog: Learning Sparse Polymatrix Games in Polynomial Time and Sample Complexity
- Blog: Managing Conflicts Among Black-Box RAN Apps via Multi-Fidelity Game-Theoretic Optimization
- Blog: Equilibrium Computation For Knockout Tournaments Played By Groups
- Blog: Passivity and Evolutionary Game Dynamics
- Blog: Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits
- Blog: Learning Sparse Polymatrix Games in Polynomial Time and Sample Complexity
- Blog: Abstraction Using Analysis of Subgames
- Blog: The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game
- Blog: Repeated Game Analysis of a CSMA/CA Network under a Backoff Attack
- Blog: On the Convergence Time in Graphical Games: A Locality-Sensitive Approach
- Blog: Frequency-Based Hyperparameter Selection in Games
- Blog: A distributed, dynamical system view of finite, static games
- Blog: Computing Pure Nash Equilibria in Symmetric Action Graph Games
- Blog: Computational and Data Requirements for Learning Generic Properties of Simulation-Based Games
- Blog: Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
- Blog: Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Blog: Efficiency and complexity of price competition among single-product vendors
- Blog: Using tabu best-response search to find pure strategy nash equilibria in normal form games
- Blog: Game Theory with Translucent Players
- Blog: What is Local Optimality in Nonconvex-Nonconcave Minimax Optimization?
- Blog: A Bayesian optimization approach to find Nash equilibria.
- Blog: Sequential auctions and externalities
- Blog: Pure Nash Equilibria in Online Fair Division
- Blog: Constrained Pure Nash Equilibria in Polymatrix Games
- Blog: Local-Effect Games
- Blog: Nash equilibria in Voronoi games on graphs
- Blog: Nash Equilibria in Reverse Temporal Voronoi Games
- Blog: The empirical implications of rank in Bimatrix games
- Blog: Socially Optimal Non-discriminatory Restrictions for Continuous-Action Games
- Blog: Efficient Coordination Mechanisms for Unrelated Machine Scheduling
- Blog: Pessimistic Leader-Follower Equilibria with Multiple Followers
- Blog: Computing Best-Response Strategies in Infinite Games of Incomplete Information
- Blog: The Computational Intractability of Not Worst Responding
- Blog: Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case
- Blog: Bottleneck Routing Games with Low Price of Anarchy
- Blog: Reasoning about Human-Friendly Strategies in Repeated Keyword Auctions
- Blog: Networked Anti-Coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence
- Blog: Learning Sparse Potential Games in Polynomial Time and Sample Complexity
- Blog: Nash Equilibria in Concurrent Games with Lexicographic Preferences
- Blog: Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory
- Blog: Computing Equilibria in Binary Networked Public Goods Games
- Blog: On the Implications of Lookahead Search in Game Playing
- Blog: FM3Q: Factorized Multi-Agent MiniMax Q-Learning for Two-Team Zero-Sum Markov Game
- Blog: Equilibria of Plurality Voting: Lazy and Truth-biased Voters
- Blog: ∃GUARANTEENASH for Boolean games is NEXP-Hard
- Blog: Cost Minimization for Equilibrium Transition
- Blog: Constraint Games revisited
- Blog: Equilibrium Convergence in Large Games
- Blog: The Empirical Implications of Rank in Bimatrix Games
- Blog: Computing Perfect Bayesian Equilibria in Sequential Auctions
Showing 60 of 74 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_pure_strategy_restriction_1c88acb9,
title = {pure strategy restriction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/pure-strategy-restriction/rdr_1c88acb9eb70438e9d626c86c9021c10},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_pure_strategy_restriction_1c88acb9_v1,
title = {pure strategy restriction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/pure-strategy-restriction/rdr_1c88acb9eb70438e9d626c86c9021c10/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}