Nicolás Stier Moses' homepage

Nicolás E. Stier Moses

Associate Professor
Decision, Risk, and Operations Division
Columbia Business School
Uris Hall, Room 418
3022 Broadway
New York, NY 10027-6902
Phone: 212-854-8254
Fax: 212-316-9180

Index: Teaching -- Publications -- Presentations

Teaching

Columbia Business School, B6014 Managerial Statistics. Core MBA course. Spring 2008, Fall 2007, Fall 2006, Fall 2005, Fall 2004.
Business School, Universidad Di Tella, Managerial Decisions I. Core Executive MBA course. Fall 2007, Fall 2006.
Columbia Business School, Seminar on Game Theoretic Models in Operations. Ph.D. course. Spring 2006.

Publications and Working Papers

Efficient and Fair Routing for Ad Hoc Wireless Telecommunication Networks (Coauthors: Andrea Lodi, Enrico Malaguti).
Technical Report OR/08/1, DEIS . University of Bologna, Italy, Jan 2008.
Eliciting Coordination With Rebates (Coauthor: P. Maillé).
Columbia Working Paper # DRO-2007-04, May 2007.
- The paper was a 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.
Stackelberg Routing in Atomic Network Games (Coauthor: J.R. Correa).
Columbia Working Paper # DRO-2007-03, Feb 2007.
A Note on the Precedence-Constrained Class Sequencing Problem (Coauthors: J.R. Correa and S. Fiorini).
Discrete Applied Mathematics, 155:3, 257-259, Feb 2007.
Robust Wardrop Equilibrium (Coauthor: F. Ordoñez).
Columbia Working Paper # DRO-2006-04, Mar 2006, revised Apr 2007.
- Conference Version: Proceedings of the 1st International Conference on Network Control and Optimization (NET-COOP'07), Volume 4465 of Lecture Notes in Computer Science, Springer, pp. 247-256, 2007.
Impact of Oligopolistic Competition in Networks (Coauthors: R. Cominetti and J.R. Correa).
Operations Research, forthcoming.
- Conference Version: Network Games with Atomic Players.
  Proceedings of the 33rd International Colloquium of Automata, Languages and Programming (ICALP'06), Volume 4051 of Lecture Notes in Computer Science, Springer, Part I, pp. 525-536, 2006.
A Geometric Approach to the Price of Anarchy in Nonatomic Congestion Games (Coauthors: J.R. Correa and A.S. Schulz).
Games and Economic Behavior, forthcoming.
- Conference Version: On the Inefficiency of Equilibria in Nonatomic Congestion Games.
  Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO'05), Volume 3509 of Lecture Notes in Computer Science, Springer, 2005, pp. 167-181.
Fast, Fair, and Efficient Flows in Networks (Coauthors: J.R. Correa and A.S. Schulz).
Operations Research, 55:2, 215-225, Mar/Apr 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), Volume 3064 of Lecture Notes in Computer Science, Springer, 2004, pp. 59-73.
Efficiency and Fairness of System-Optimal Routing with User Constraints (Coauthor: A.S. Schulz).
Networks, 48:4, 223-234, 2006.
- The paper received the 2006 Glover-Klingman Prize (best paper published in Networks during 2006)
- 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, 2003, pp 86-87.
  (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).
Operations Research, 53:4, 600-616, Jul/Aug 2005.
- 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).
Mathematics of Operations Research, 29:4, 961-976, Nov 2004.
Selfish versus Coordinated Routing in Network Games [ps.gz].
Ph.D. Thesis, Sloan School of Management, MIT, May 2004. Advisor: A.S. Schulz.
Models, Complexity and Algorithms for the Design of Multifiber WDM Networks (Coauthors: A. Ferreira, S. Perennes, A. Richa and H. Rivano).
Telecommunication Systems, 24:2-4, 123-138, Oct 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.
Importance Splitting Methods for Simulation.
Master's Thesis, Mathematics and Computer Science Departments, Universidad de Buenos Aires, Argentina, Aug 1998. Advisor: G. Rubino.
GIS representation of buses in Buenos Aires (Coauthor: G. Deferrari).
Proceedings of the VII Transit and Transport Conference, Santiago, Chile, Oct 1995.

Selected Presentations in Conferences

Stackelberg Routing in Atomic Network Games
INFORMS Annual Meeting, Seattle, WA, Nov 2007.
Robust Wardrop Equilibrium and How to Price to Get It
First International Conference on Network Control and Optimization (NET-COOP'07), Avignon, France, June 2007.
Eliciting Coordination with Rebates
INFORMS Annual Meeting, Pittsburgh, PA, Nov 2006.
Network Games with Atomic Players
Bell Labs, Lucent Technologies, June 2006.
On the Inefficiency of Equilibria in Congestion Games
DIMACS Workshop on Large Scale Games, Northwestern University, Evanston, IL, April 2005.
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem [ps.gz]
10th Integer Programming and Combinatorial Optimization Conference (IPCO'04), New York, Jun 2004.
Selfish versus Coordinated Routing in Network Games
Ph.D. defense, Operations Research Center, MIT, May 2004.
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion [ps.gz]
INFORMS Annual Meeting, Atlanta, GA, Oct 2003.
Selfish Routing in Capacitated Networks [ps.gz]
18th International Symposium on Mathematical Programming (ISMP'03), Copenhagen, Denmark, Aug 2003.

© Copyright Notice: The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder

last updated: Thu Jan 24 14:59:22 EST 2008 counter: