Selected Presentations in Seminars and Conferences

Atomic Congestion Games with Stochastic Demand, 20th ACM Conference on Economics and Computation (EC'19), Phoenix, AZ, Jun 2019.

Pacing Equilibria in Auction Markets, Plenary talk, NetEcon, Phoenix, AZ, Jun 2019.

Revenue-Maximizing Rankings for Online Platforms with Quality-Sensitive Consumers, INFORMS Annual Meeting, Houston, TX, Oct 2017.

Optimal Trading and Shipping of Agricultural Commodities, INFORMS Annual Meeting, Houston, TX, Oct 2017.

Asymptotically tight bounds for inefficiency in risk-averse selfish routing, Schloss Dagstuhl Workshop, Germany, Oct 2015.

Pricing with Markups under Horizontal and Vertical Competition, Utah Winter Operations Conference, UT, Jan 2010.

Network Games and the Efficiency of their Equilibria, Transportation and Logistics Dept., Universidad Catolica, Santiago, Chile, Jun 2009.

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, 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, INFORMS Annual Meeting, Atlanta, GA, Oct 2003.

Selfish Routing in Capacitated Networks, 18th International Symposium on Mathematical Programming (ISMP’03), Copenhagen, Denmark, Aug 2003.