R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
ACM Transactions on Economics and Computation
21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
Sadra Yazdanbod
Ruta Mehta
Jugal Garg
Silvio Micali
A near-linear time ?-approximation algorithm for geometric bipartite matching