ASCEND
BY NTHRYS

NTHRYSPhD AssistanceDiscrete Mathematics

Discrete Mathematics

Field
Category

Discrete Mathematics

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Algorithmic Game Theory and Strategic Interaction

Analysis of computational complexity in game-theoretic equilibria, mechanism design, and strategic behavior in discrete systems.

Equilibrium Computation in Structured Multi-Agent Systems
Strategic Complexity and Information Asymmetry Games
Dynamics of Learning in Repeated Strategic Encounters
Mechanism Design Without Common Knowledge Assumptions
Coalition Formation in Algorithmic Environments
Emergent Behavior in Non-Cooperative Network Games
Approximation Hardness of Strategic Equilibria
Incentive-Compatible Computation at Scale
Strategic Manipulation in Distributed Decision Protocols
Convergence and Stability in Algorithmic Competition

All Discrete Mathematics PhD categories