| 2020 | COCOON | Tight Approximation for the Minimum Bottleneck Generalized Matching Problem. | Julin Mestre, Nicols E. Stier Moses |
| 2019 | EC | Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs. | Roberto Cominetti, Marco Scarsini, Marc Schrder, Nicols E. Stier Moses |
| 2019 | EC | Pacing Equilibrium in First-Price Auction Markets. | Vincent Conitzer, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Eric Sodomka, Nicols E. Stier Moses, Chris Wilkens |
| 2019 | EC | Computing Large Market Equilibria using Abstractions. | Christian Kroer, Alexander Peysakhovich, Eric Sodomka, Nicols E. Stier Moses |
| 2016 | IJCAI | Asymptotically Tight Bounds for Inefficiency in Risk-Averse Selfish Routing. | Thanasis Lianeas, Evdokia Nikolova, Nicols E. Stier Moses |
| 2011 | SAGT | Stochastic Selfish Routing. | Evdokia Nikolova, Nicols E. Stier Moses |
| 2006 | ICALP | Network Games with Atomic Players. | Roberto Cominetti, Jos R. Correa, Nicols E. Stier Moses |
| 2005 | IPCO | On the Inefficiency of Equilibria in Congestion Games. | Jos R. Correa, Andreas S. Schulz, Nicols E. Stier Moses |
| 2004 | IPCO | Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract. | Jos R. Correa, Andreas S. Schulz, Nicols E. Stier Moses |
| 2003 | SODA | On the performance of user equilibria in traffic networks. | Andreas S. Schulz, Nicols E. Stier Moses |
| 2000 | PDPTA | On the application of accelerating simulation methods in network analysis. | Jos Incera, Gerardo Rubino, Nicols E. Stier Moses |