Nicolas Stier-Moses' Publications  

A. Allouah, C. Kroer, X. Zhang, V. Avadhanula, A. Dania, C. Gocmen, S. Pupyrev, P. Shah, N.E. Stier-Moses. Fair Allocation Over Time, with Applications to Content Moderation [PDF]. Conference on Knowledge Discovery and Data Mining (KDD’23), 2023.

R. Cominetti, M. Scarsini, M. Schröder, N.E. Stier-Moses. Convergence of Large Atomic Congestion Games [PDF], Mathematics of Operations Research, 48(2):784–811, 2023.

D. Sinha, B. Xu, C. Gocman, C. Palow, D. Haimovich, D. Hwang, D. Karamshuk, G. Macnamara, J. Mullett, J. Ma, K. Schaeffer, N.E. Stier-Moses, O. Abdul Baki, P. Shah, S. Park, T. Leeper, V. S. Rajagopal, H. Sridhar Bastani, O. Bastani, V. Avadhanula. Poster Bandits for Online Calibration: An Application to Content Moderation on Social Media Platforms [PDF]. Challenges in Deploying and Monitoring Machine Learning Systems @ NeurIPS, 2022.

C. Kroer, N.E. Stier-Moses, Market Equilibrium Models in Large-Scale Internet Markets [PDF], Innovative Technology at the Interface of Finance and Operations, Volume II, page 147–189, Edited by V. Babich, J.R. Birge, G. Hilary. Springer, 2022.

R. Makhijani, P. Shah, V. Avadhanula, C. Gocmen, N.E. Stier-Moses, J. Mestre. QUEST: Queue Simulation for Content Moderation at Scale [PDF]. Working Paper, arXiv, 2021.

J. Mestre, N.E. Stier-Moses. Tight approximation for the minimum bottleneck generalized matching problem [PDF], In Kim D., Uma R., Cai Z., Lee D. (eds), 26th International Computing and Combinatorics Conference (COCOON’20), Lecture Notes in Computer Science, vol. 12273, pp. 324–334, August 2020.

J. Marriott, B. Tezel, Z. Liu, N.E. Stier-Moses. Trajectory Optimization of Solar-Powered High-Altitude Long Endurance Aircraft [PDF], 6th International Conference on Control, Automation and Robotics (ICCAR’20), pp. 473–481, Singapore, April 2020.

R. Cominetti, M. Scarsini, M. Schröder, N.E. Stier-Moses. Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs [PDF], ACM Conference on Economics and Computation (EC’19), Phoenix, AZ, June 2019.

• • • Full version: Working paper, arXiv:1903.03309 [cs.GT], 2019.

    • Slides presentation at EC'19.

Preface to "Learning in Repeated Auctions with Budgets" by Balseiro and Gur, Blog post in Management Science, 2019.

C. Kroer, A. Peysakhovich, E. Sodomka, N.E. Stier-Moses. Computing large market equilibria using abstractions [PDF], Operations Research, 70(1), 329–351, 2022.

• • • Conference version: ACM Conference on Economics and Computation (EC’19), Phoenix, AZ, June 2019.

V. Conitzer, C. Kroer, D. Panigrahi, O. Schrijvers, E. Sodomka, N.E. Stier-Moses, C. Wilkens. Pacing Equilibrium in First-Price Auction Markets [PDF], Management Science, 68(12):8515–8535, 2022. 

• • • Conference version: ACM Conference on Economics and Computation (EC’19), Phoenix, AZ, June 2019.

T. Lianeas, E. Nikolova, N.E. Stier-Moses. Risk averse selfish routing [PDF]. Mathematics of Operations Research, 44:1, 38–57, 2019. 

• • • This paper is the combined and improved version of conference papers ‘The Burden of Risk Aversion in Mean-Risk Selfish Routing’ (EC’15) and ‘Asymptotically tight bounds for inefficiency in risk-averse selfish routing’ (IJCAI’16)

    • Slides presentation at Schloss Dagstuhl Workshop, Germany, Oct 2015.

V. Conitzer, C. Kroer, E. Sodomka,  N.E. Stier-Moses. Multiplicative Pacing Equilibria in Auction Markets [PDF]. Operations Research, 70(2):963–989, 2022.

• • • Conference version: Proceedings of the 14th Conference on Web and Internet Economics (WINE'18), Oxford, UK, December 2018.

G. Duran, M. Giormenti, M. Guajardo, P. Pinto, P. Rey, N.E. Stier-Moses. Improving Access to Voting with Optimized Matchings [PDF]. Electoral Studies, 51, 38–48, 2018.

Y. Gur, D. Sabán, N.E. Stier-Moses. The competitive facility location problem in a duopoly [PDF]. Operations Research, 66:4, 1058–1067 2018.

• • • Online Appendix

    • This paper is the combined and improved version of conference papers ‘A Facility Location Problem under Competition’ (NetEcon’11) and ‘The Competitive Facility Location Problem in a Duopoly: Relations to the 1-Median Problem’ (WINE’12)

T. Danford, O. Filiz, J. Huang, B. Karrer, M. Paluri, G. Pang, V. Ponnampalam, N.E. Stier-Moses, B. Tezel. End-to-end Planning of Fixed Millimeter-Wave Networks [PDF]. Working Paper arXiv:1705.07249 [cs.NI], 2017.

P. L’Ecuyer, P. Maillé, N.E. Stier-Moses, B. Tuffin. Non-Neutrality of Search Engines and its Impact on Innovation. Internet Technology Letters, 1–10, 2018.

• • • Conference version: Search (Non-)Neutrality and Impact on Innovation. ACM SIGMETRICS Performance Evaluation Review, 44:3, 31–31, 2016.

P. L’Ecuyer, P. Maillé, N.E. Stier-Moses, B. Tuffin. Revenue-Maximizing Rankings for Online Platforms with Quality-Sensitive Consumers [PDF]. Operations Research, 65:2, 408–423, 2017.

• • • Slides presentation at INFORMS Annual Meeting, Houston, TX, Oct 2017.

M. Hou, E. Sodomka,  N.E. Stier-Moses. Game Abstractions for Counterfactual Prediction in Online Markets, 12th Ad Auctions Workshop, ACM Conference on Economics and Computation (EC’16), Maastricht, Netherlands, July 2016.

T. Niella, N.E. Stier-Moses, M. Sigman. Nudging Cooperation in a Crowd Experiment [PDF]. PLoS ONE, 11:1, 2016.

A. Lodi, E. Malaguti, N.E. Stier-Moses, T. Bonino. Design and Control of a Public-Transportation Service Contract [PDF]. Management Science, 62:4, 1165–1187, 2016.

N. Merener, R. Moyano, N.E. Stier-Moses, P. Watfi. Optimal Trading and Shipping of Agricultural Commodities [PDF]. Journal of the Operational Research Society, 67:1, 114–126, 2016.

T. Lianeas, E. Nikolova, N.E. Stier-Moses. Asymptotically tight bounds for inefficiency in risk-averse selfish routing [PDF]. Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI’16), New York, NY, USA, 2016.

• • • For the full version, see ‘Risk averse selfish routing’ above.

F. Balmaceda, S.R. Balseiro, J.R. Correa, N.E. Stier-Moses. Bounds on the Welfare Loss from Moral Hazard with Limited Liability [PDF]. Games and Economic Behavior, 95, 137–155, 2016.

• • • Online Appendix

    • Conference Version: Cost of Moral Hazard and Limited Liability in the Principal-Agent Problem, Proceedings of the 6th Workshop on Internet & Network Economics (WINE’10), Stanford, CA, 2010.

E. Nikolova, N.E. Stier-Moses. The Burden of Risk Aversion in Mean-Risk Selfish Routing [PDF]. Proceedings of the 16th ACM Conference on Economics and Computation (EC’15), Portland, OR, USA, 2015.

• • • For the full version, see ‘Risk averse selfish routing’ above.

J.R. Correa, R. Lederman, N.E. Stier-Moses. Sensitivity analysis of markup equilibria in complementary markets [PDF]. Operations Research Letters, 42:2, 173–179, 2014.

J.R. Correa, R. Lederman, N. Figueroa, N.E. Stier-Moses. Pricing with markups in industries with increasing marginal costs [PDF]. Mathematical Programming A, 146:1, 143–184, 2014.

• • • Finalist in the 2009 INFORMS Junior Faculty Interest Group (JFIG) Paper Competition.

E. Nikolova, N.E. Stier-Moses. A Mean-Risk Model for the Stochastic Traffic Assignment Problem [PDF]. Operations Research, 62:2, 366–382, 2014.

• • • Conference Version: Stochastic Wardrop Equilibrium. Proceedings of the Fourth Symposium on Algorithmic Game Theory (SAGT’11), Lecture Notes in Computer Science, vol. 6982, pp. 314–325, Springer, 2011.

    • Summary:  Stochastic Selfish Routing [PDF]. ACM SIGecom Exchanges, 11:1, 21–25, 2012.

P. Njoroge, A. Ozdaglar, and G. Weintraub, N.E. Stier-Moses. Investment in two sided markets and the net neutrality debate [PDF]. Review of Network Economics, 12:4, 355–402, 2014.

• • • Related article in Columbia’s Ideas at Work: Shifting Out of Neutral, Aug 24, 2010.

J.R. Correa, A.S. Schulz, and N.E. Stier-Moses. The Price of Anarchy of the Proportional Allocation Mechanism Revisited [PDF]. Proceedings of the 9th Workshop on Internet & Network Economics (WINE’13), Cambridge, MA, USA, 2013.

D. Sabán, N.E. Stier-Moses. The Competitive Facility Location Problem in a Duopoly: Relations to the 1-Median Problem. Proceedings of the 8th Workshop on Internet & Network Economics (WINE’12), Liverpool, UK, 2012.

• • • For the full version, see ‘The competitive facility location problem in a duopoly’ above.

F. Bonomo, J. Marenco, D. Sabán, N.E. Stier-Moses. A polyhedral study of the maximum edge subgraph problem [PDF]. Discrete Applied Mathematics, 160:18, 2573–2590, 2012.

• • • Conference version: Proceedings of the V Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS’09), Gramado, Brazil, Electronic Notes in Discrete Mathematics, pp. 197–202, Elsevier, 2009.

Y. Gur, N.E. Stier-Moses. A Facility Location Problem under Competition. Proceedings of the Workshop on The Economics of Networks, Systems, and Computation (NetEcon’11), San Jose, CA, 2011.

• • • For the full version, see ‘The competitive facility location problem in a duopoly' above.

J.R. Correa, N.E. Stier-Moses. Wardrop Equilibria [PDF]. Wiley Encyclopedia of Operations Research and Management Science. Edited by J. J. Cochran. Wiley. 2011.

J.R. Correa, R. Lederman, N.E. Stier-Moses. Pricing with Markups under Horizontal and Vertical Competition. Proceedings of the Behavioral and Quantitative Game Theory Conference, Newport Beach, CA, May 2010.

• • • This material appears in part in 'Pricing with markups in industries with increasing marginal costs' and in 'Sensitivity analysis of markup equilibria in complementary markets'.

F. Bonomo, D. Sabán, N.E. Stier-Moses. Analysis and Models of Bilateral Investment Treaties using a Social Networks Approach [PDF]. Physica A, 389, 3661–3673, 2010.

F. Ordoñez, N.E. Stier-Moses. Wardrop Equilibria with Risk-Averse Users [PDF]. Transportation Science, 44:1, 63–86, 2010.

• • • Online Supplement: figures corresponding to other runs that couldn’t be included in paper for lack of space.

    • Instances used in paper: files and documentation (see readme file).

    • Conference Version: Robust Wardrop Equilibrium. Proceedings of the 1st International Conference on Network Control and Optimization (NET-COOP’07), Lecture Notes in Computer Science, vol. 4465, pp. 247–256, Springer, 2007.

P. Njoroge, A. Ozdaglar, and G. Weintraub, N.E. Stier-Moses. Competition, Market Coverage, and Quality Choice in Interconnected Platforms [PDF]. Proceedings of the Workshop on The Economics of Networks, Systems, and Computation (NetEcon’09), Stanford CA, 2009.

A. Lodi, E. Malaguti, N.E. Stier-Moses. Efficient and Fair Routing for Mesh Networks [PDF]. Mathematical Programming B, 124:1–2, 285–316, 2010.

• • • Full Version at Optimization Online. Revision: Jun 2009.

    • Conference Version: Proceedings of the 6th ALIO/EURO Conference on Applied Combinatorial Optimization, Dec 2008.

Eliciting Coordination With Rebates (Coauthor: P. Maillé). [PDF]. Transportation Science, 43:4, 473–492, 2009.

• • • Finalist in the 2007 INFORMS Junior Faculty Interest Group (JFIG) Paper Competition.

    • Related article in Columbia’s Ideas at Work: Rewarding efficient commuters, easing traffic congestion, July 12, 2007.

The Impact of Oligopolistic Competition in Networks (Coauthors: R. Cominetti and J.R. Correa). [PDF]. Operations Research, 57:6, 1421–1437, 2009.

• • • Conference Version: Network Games with Atomic Players. Proceedings of the 33rd International Colloquium of Automata, Languages and Programming (ICALP’06), Lecture Notes in Computer Science, vol. 4051, Part I, pp. 525–536, Springer, 2006.

A Geometric Approach to the Price of Anarchy in Nonatomic Congestion Games (Coauthors: J.R. Correa and A.S. Schulz). [PDF]. Games and Economic Behavior, 64, 457-469, 2008.

• • • Conference Version: On the Inefficiency of Equilibria in Nonatomic Congestion Games. Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO’05), Lecture Notes in Computer Science, vol. 3509, pp. 167–181, Springer, 2005.

Stackelberg Routing in Atomic Network Games (Coauthor: J.R. Correa). Columbia Working Paper # DRO-2007-03, 2007.

A Note on the Precedence-Constrained Class Sequencing Problem (Coauthors: J.R. Correa and S. Fiorini). [PDF]. Discrete Applied Mathematics, 155:3, 257–259, 2007.

Fast, Fair, and Efficient Flows in Networks (Coauthors: J.R. Correa and A.S. Schulz). [PDF]. Operations Research, 55:2, 215–225, 2007.

• • • Conference Version: Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem. Proceedings of the 10th Integer Programming and Combinatorial Optimization Conference (IPCO’04), Lecture Notes in Computer Science, vol. 3064, pp. 59–73, Springer, 2004.

Efficiency and Fairness of System-Optimal Routing with User Constraints (Coauthor: A.S. Schulz). [PDF]. Networks, 48:4, 223–234, 2006.

• • • Received the 2006 Glover-Klingman Prize (best paper published in Networks during 2006) (citation)

    • Conference Version: On the Performance of User Equilibria in Traffic Networks. Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’03), Society of Industrial and Applied Mathematics, Philadelphia, PA, pp. 86–87, 2003. (This conference paper also contains the preliminary results of ‘Selfish Routing in Capacitated Networks’.)

System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion (Coauthors: O. Jahn, R.H. Möhring and A.S. Schulz). [PDF]. Operations Research, 53:4, 600–616, 2005.

• • • 2008 INFORMS Transportation Science and Logistics Society Best Paper Award.

    • Online Appendix with the rest of the simulations’ output.

    • The network instances that we used can be found in Transportation Network Test Problems‘s website.

Selfish Routing in Capacitated Networks (Coauthors: J.R. Correa and A.S. Schulz). [PDF]. Mathematics of Operations Research, 29:4, 961–976, 2004.

• • • Honorable Mention in the 2006 INFORMS Transportation Science and Logistics Section Best Paper Award.

    • Research brief in Columbia’s Ideas at Work.

Models, Complexity and Algorithms for the Design of Multifiber WDM Networks (Coauthors: A. Ferreira, S. Perennes, A. Richa and H. Rivano). [PDF]. Telecommunication Systems, 24:2–4, 123–138, 2003.

On the Application of Accelerating Simulation Methods in Network Analysis (Coauthors: J. Incera and G. Rubino). Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’2000), Las Vegas, NV, Jun 2000.

GIS representation of buses in Buenos Aires (Coauthor: G. Deferrari). Proceedings of the VII Transit and Transport Conference, Santiago, Chile, Oct 1995.

Theses

Selfish versus Coordinated Routing in Network Games. Ph.D. Thesis, Sloan School of Management, MIT, May 2004. Advisor: A.S. Schulz.

• • • Received an Honorable Mention in the 2006 INFORMS Telecommunications Section Ph.D. Dissertation Award.

    • Finalist in the 2004 INFORMS Transportation Science and Logistics Dissertation Prize.

Importance Splitting Methods for Simulation. Master’s Thesis, Mathematics and Computer Science Departments, Universidad de Buenos Aires, Argentina, Aug 1998. Advisor: G. Rubino.

• • • Received the 3rd Prize in the VI Master’s Thesis Contest organized by CLEI-UNESCO (Computer Science Latin American Research Center).