Mohammad T. Irfan
4 papers · 2019–2026 · 2 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
๐
Conference Polyglot ยท Bronze
๐
Academic Marathon ยท Sprint
๐
Interdisciplinary Bridge ยท Silver
Top co-authors
Research topics
Keywords
computational complexity
(3)
congestion game
(2)
social network
(1)
learning dynamics
(1)
polynomial time algorithm
(1)
ideal point model
(1)
pure nash equilibrium
(1)
constraint satisfaction problem
(1)
voting behavior
(1)
multi-agent system
(1)
polymatrix game
(1)
graphical game
(1)
pure-strategy nash equilibrium
(1)
strong nash equilibrium
(1)
additive aggregate game
(1)
game theory
(1)
mixed-strategy nash equilibrium
(1)
approximation algorithm
(1)
Papers
Computing Exact Nash Equilibria in Graphical Games: A Geometric Approach to Paths, Stars, and Caterpillars
UAI 2026
Pure and Strong Nash Equilibrium Computation in Compactly Representable Aggregate Games
UAI 2025
Equilibrium Computation in Multidimensional Congestion Games: CSP and Learning Dynamics Approaches
UAI 2024
The Power of Context in Networks: Ideal Point Models with Social Interactions
IJCAI 2019