Nicolás E. Stier Moses
According to our database^{1},
Nicolás E. Stier Moses
authored at least 41 papers
between 2000 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org

at columbia.edu
On csauthors.net:
Bibliography
2018
Technical Note  The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees.
Operations Research, 2018
2017
RevenueMaximizing Rankings for Online Platforms with QualitySensitive Consumers.
Operations Research, 2017
Endtoend Planning of Fixed MillimeterWave Networks.
CoRR, 2017
Multiplicative Pacing Equilibria in Auction Markets.
CoRR, 2017
2016
Search (Non)Neutrality and Impact on Innovation: Short talk.
SIGMETRICS Performance Evaluation Review, 2016
Design and Control of PublicService Contracts and an Application to Public Transportation Systems.
Management Science, 2016
Optimal trading and shipping of agricultural commodities.
JORS, 2016
Bounds on the welfare loss from moral hazard with limited liability.
Games and Economic Behavior, 2016
Asymptotically Tight Bounds for Inefficiency in RiskAverse Selfish Routing.
Proceedings of the TwentyFifth International Joint Conference on Artificial Intelligence, 2016
2015
Asymptotically tight bounds for inefficiency in riskaverse selfish routing.
CoRR, 2015
The Burden of Risk Aversion in MeanRisk Selfish Routing.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
2014
Sensitivity analysis of markup equilibria in complementary markets.
Oper. Res. Lett., 2014
Pricing with markups in industries with increasing marginal costs.
Math. Program., 2014
A MeanRisk Model for the Traffic Assignment Problem with Stochastic Travel Times.
Operations Research, 2014
The Burden of Risk Aversion in MeanRisk Selfish Routing.
CoRR, 2014
2013
The Price of Anarchy of the Proportional Allocation Mechanism Revisited.
Proceedings of the Web and Internet Economics  9th International Conference, 2013
2012
Stochastic selfish routing.
SIGecom Exchanges, 2012
A polyhedral study of the maximum edge subgraph problem.
Discrete Applied Mathematics, 2012
The Competitive Facility Location Problem in a Duopoly: Connections to the 1Median Problem.
Proceedings of the Internet and Network Economics  8th International Workshop, 2012
2011
Stochastic Selfish Routing.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011
2010
Wardrop Equilibria with RiskAverse Users.
Transportation Science, 2010
Efficient and fair routing for mesh networks.
Math. Program., 2010
The Cost of Moral Hazard and Limited Liability in the PrincipalAgent Problem.
Proceedings of the Internet and Network Economics  6th International Workshop, 2010
Pricing with markups under horizontal and vertical competition.
Proceedings of the Behavioral and Quantitative Game Theory, 2010
2009
Eliciting Coordination with Rebates.
Transportation Science, 2009
The Impact of Oligopolistic Competition in Networks.
Operations Research, 2009
A polyhedral study of the maximum edge subgraph problem.
Electronic Notes in Discrete Mathematics, 2009
2008
A geometric approach to the price of anarchy in nonatomic congestion games.
Games and Economic Behavior, 2008
2007
Fast, Fair, and Efficient Flows in Networks.
Operations Research, 2007
A note on the precedenceconstrained class sequencing problem.
Discrete Applied Mathematics, 2007
Robust Wardrop Equilibrium.
Proceedings of the Network Control and Optimization, 2007
2006
Efficiency and fairness of systemoptimal routing with user constraints.
Networks, 2006
Network Games with Atomic Players.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
2005
TSL Dissertation Abstracts: 2004 Transportation Science and Logistics Section Dissertation Prize Competition.
Transportation Science, 2005
SystemOptimal Routing of Traffic Flows with User Constraints in Networks with Congestion.
Operations Research, 2005
On the Inefficiency of Equilibria in Congestion Games.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
2004
Selfish Routing in Capacitated Networks.
Math. Oper. Res., 2004
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
2003
Models, Complexity and Algorithms for the Design of Multifiber WDM Networks.
Telecommunication Systems, 2003
On the performance of user equilibria in traffic networks.
Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2003
2000
On the application of accelerating simulation methods in network analysis.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000