Publications

Preprints

1. Phase transitions of the price-of-anarchy function in multi-commodity routing games, arXiv:2305.03459, 2023 (with V. Dose and M. Scarsini).

2. The interdependence between hospital choice and waiting time —with a case study in urban China. arXiv:2306.16256, 2023 (with J. van de Klundert, Q. Kong and Y. Liu).

3. Ordinary and prophet planning under uncertainty in Bernoulli congestion games. arXiv:1903.03309, 2019 (with M. Scarsini, M. Schroeder and N. Stier-Moses).

Journals (reprints available here)

1. Monotonicity of equilibria in nonatomic congestion games. In press, European Journal of Operations Reserach 2024. (with V. Dose and M. Scarsini).

2. Stochastic fixed-point iterations for nonexpansive maps: Convergence and error bounds. SIAM J. Control and Optimization 62(1):191-219, 2024.  arXiv:2208.04193 (with M. Bravo).

3. Optimal error bounds for nonexpansive fixed-point iterations in normed spaces. Mathematical Programming 199:343-374, 2023.  arXiv:2108.10969 (with J.P. Contreras).

4. Approximation and convergence of large atomic congestion games. Mathematics of Operations Research 48(2):784-811, 2023. arXiv:2001.02797v6 (with M. Scarsini, M. Schroeder and N. Stier-Moses).

5. Universal bounds for fixed-point iterations via optimal transport metrics. Applied Set-Valued Analysis and Optimization 4(3):293-310, 2022.  arXiv:2108.10969 (with M. Bravo and Th. Champion).

6. Long term behavior of dynamic equilibria in fluid queuing networks. Operations Research 70(1):516-526, 2022. (with J. Correa and N. Olver).

7. The buck-passing game. Mathematics of Operations Research 47(3):1731-1756, 2021. arXiv:1808.03206v2 (with M. Quattropani and M. Scarsini).

8. The price-of-anarchy in routing games as a function of the demand. Mathematical Programming 203:431-558, 2024. Published on-line 08 September 2021. arXiv:1907.10101v3. (with V. Dose and M. Scarsini).

9. Improving the Chilean college admissions system. Operations Research 26(4):1186-1205, 2021.  (with I. Ríos, T. Larroucau and G. Parra).

10. When is selfish routing bad? The price of anarchy in light and heavy trafic.  Operations Research 68(2):411-434, 2020. arXiv:1703.00927v1.  (with R. Colini-Baldeschi, P. Mertikopoulos and M. Scarsini).

11. Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces. Mathematical Programming, 175(1-2):241-262, 2019. (with M. Bravo and M. Pavez-Signé). 

12. Price of Anarchy for Highly Congested Routing Games in Parallel Networks. Theory of Computing Systems 63(1):90-113, 2019. (with R. Colini-Baldeschi and M. Scarsini).

13. On the stability of an adaptive learning dynamics in traffic games. Journal of Dynamics and Games 5(4):265-282, 2018. arXiv:1807.01256. (with M. Dumett). 

14. A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections. Optimization 68:3-12, 2019. (with V. Roshchina and A. Williamson). 

15. Sharp convergence rates for averaged nonexpansive maps,  Israel Journal of Mathematics, 17(1):163-188, 2018. arXiv:1606.05300v2. (with M. Bravo) .

16. Additive consistency of risk measures and its application to risk-averse routing in networks. Mathematics of Operations Research 41(4):1510-1521, 2016. (with A. Torrico).

17. A sharp uniform bound for the distribution of sums of Bernoulli trials. Combinatorics, Probability and Computing 25(3):352-361, 2016. (with J-B. Baillon and J. Vaisman).

18. Equilibrium routing under uncertainty.  Mathematical Programming Ser. B 151(1):117-151, 2015.

19. Dynamic equilibria in fluid queueing networks.  Operations Research 63(1):21-34, 2015.  (with J. Correa and O. Larré).

20. A Newton's method for the continuous quadratic knapsack problem.  Mathematical Programming Computation 6:151-169, 2014. (with P. da Silva P. and W. Mascarenhas).

21. Asymptotic behavior of compositions of under-relaxed non expansive operators. Journal of Dynamics and Games 1(3):331-346, 2014. (with J-B. Baillon J.B. and P.L. Combettes).

22. On the rate of convergence of Krasnosel'skii-Mann iterations and their connection with sums of Bernoullis. Israel Journal of Mathematics 199(2):757-772, 2014. (with J. Soto and J. Vaisman).

23. Network congestion control with Markovian multipath routing. Mathematical Programming 147:231-251, 2014. (with C. Guzmán).

24. There is no variational characterization of the cycles in the method of periodic projections. Journal of Functional Analysis 262(1):400-408, 2012. (with J-B. Baillon and P.L. Combettes).

25. An integrated behavioral model of the land-use and transport systems with network congestion and location externalities. Transportation Research Part B: Methodological 44(10):584-596, 2010. (with M. Bravo, L. Briceño, C. Cortés and F. Martínez). 

26. A payoff-based learning procedure and its application to traffic games. Games and Economic Behavior 70:71-83, 2010. (with E. Melo and S. Sorin).

27. Optimal selection of customers for a last-minute offer. Operations Research 58(4):878-888, 2010. (with J. Correa, J. San Martín and T. Rothvoss).

28. Asymptotic expansion of penalty-gradient flows in linear programming. SIAM J. on Optimization 20(2):728-739, 2009. (with J-B. Baillon).

29. Asymptotic convergence of optimal policies for resource management with application to harvesting of multiple species forest. Mathematics of Operations Research 34(3):576-593, 2009. (with A. Piazza).

30. The impact of oligopolistic competition in networks. Operations Research 57(6):1421-1437, 2009. (with J. Correa and N. Stier-Moses). 

31. An integrated behavioral model of land use and transport system: a hyper-network equilibrium approach. Networks and Spatial Economics 8:201-224, 2008. (with L. Briceño, C. Cortés and F. Martínez).

32. Markovian traffic equilibrium. Mathematical Programming Ser. B 111(1-2):33-56, 2008. (with J-B. Baillon).

33. Strong asymptotic convergence of evolution equations governed by maximal monotone operators with Tikhonov regularization. Journal of Differential Equations  245(12):3753--3763, 2008. (with J. Peypouquet and S. Sorin). 

34. A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria. Transportation Research B  40(6):437-459, 2006. (with M. Cepeda and M. Florian).

35. Coupling general penalty schemes for convex programming with the steepest descent and the proximal point algorithm. SIAM Journal on Optimization 13(3):745-765, 2003. (with M. Courdurier).

36. Primal and dual convergence of a proximal point exponential penalty method for linear programming. Mathematical Programming 93(1):87-96, 2002. (with F. Alvarez).

37. A convergence result for non-autonomous subgradient evolution equations and its application to the steepest descent exponential penalty trajectory in linear programming. Journal of Functional Analysis 187(2):263-273, 2001. (with J-B. Baillon).

38. Common-lines and passenger assignment in congested transit networks. Transportation Science 35(3):250-267, 2001. (with J. Correa).

39. Lp approximation of variational problems in L1 and Linfty. Nonlinear Analysis Ser. A , Theory Methods & Applications 36(3):373-399, 1999. (with H. Attouch).

40. Second order optimality conditions based on parabolic second order tangent sets. SIAM Journal on Optimization 9(2):466-492, 1999. (with J-F. Bonnans and A. Shapiro).

41. Steepest descent evolution equations: asymptotic behavior of solutions and rate of convergence. Transactions of the AMS 351(12):4847-4860, 1999. (with O. Alemany).

42. Sensitivity analysis of optimization problems under second order regular constraints. Mathematics of Operations Research 23(4):806-831, 1998. (with J-F. Bonnans and A. Shapiro).

43. Asymptotic analysis for penalty and barrier methods in convex and linear programming. Mathematics of Operations Research 22(1):43-62, 1997. (with A. Auslender and M. Haddou).

44. Coupling the proximal point algorithm with approximation methods. Journal of Optimization Theory and Applications 95(3):581-600, 1997.

45. Quadratic rate of convergence for a primal-dual exponential penalty algorithm. Optimization 39(1):13-32, 1997. (with J.M. Pérez).

46. Sufficient conditions for coincidence in l1-multifacility location problems. Operations Research Letters 20(4):179-185, 1997. (with C. Michelot).

47. Tangent sets of order one and two to the positive cones of some functional spaces. Applied Mathematics & Optimization 36(3):291-312, 1997. (with J-P. Penot).

48. A dynamical approach to convex minimization coupling approximation with the steepest descent method. Journal of Differential Equations 128(2):519-540, 1996. (with H. Attouch).  

49. Perturbed optimization in Banach spaces III. Semi-infinite optimization. SIAM Journal Control and Optimization 34(5):1555-1567, 1996. (with J-F. Bonnans).

50. Perturbed optimization in Banach spaces II. A theory based on a strong directional constraint qualification. SIAM Journal on Control and Optimization 34(4):1172-1189, 1996. (with J-F. Bonnans).

51. Perturbed optimization in Banach spaces I. A general theory based on a weak directional constraint qualification. SIAM Journal on Control and Optimization 34(4):1151-1171, 1996. (with J-F. Bonnans).

52. Asymptotic convergence of the steepest descent method for the exponential penalty in linear programming. Journal of Convex Analysis 2(1-2):145-152, 1995.

53. Tangent sets to unilateral convex sets. CRAS Paris 321(12):1631-1636, 1995. (with J-P. Penot).  

54. Asymptotic analysis of the exponential penalty trajectory in linear programming. Mathematical Programming 67(2):169-187, 1994. (with J. San Martín).

55. A stable exponential-penalty algorithm with superlinear convergence. Journal of Optimization Theory & Applications 83(2):285-309, 1994. (with J-P. Dussault).

56. Some remarks on convex duality in normed spaces with and without compactness. Control & Cybernetics 23(1-2):123-138.

57. Convex functions with unbounded level sets and applications to duality theory. SIAM Journal on Optimization 3(4):669-687, 1993. (with A. Auslender and J-P. Crouzeix).

58. A comparative study of multifunction differentiability with applications in mathematical programming. Mathematics of Operations Research 16(2):240-258, 1991. (with A. Auslender).

59. On Pseudo-differentiability. Transactions of the AMS  324(2):843-865.

60. A generalized second order derivative in nonsmooth optimization. SIAM Journal on Control & Optimization 28(4):789-809, 1990. (with R. Correa).

61. First and second order sensitivity analysis of nonlinear programs under directional constraint qualification conditions. Optimization 21(3):351-363, 1990. (with A. Auslender).

62. Metric regularity, tangent sets and second order optimality conditions. Applied Mathematics & Optimization 21(3):265-287, 1990.

63. A useful characterization of Clarke derivatives. Differential and Integral Equations 1(4):381-390, 1988. (with R. Correa).

64. Sur une dérivée seconde en analyse non différentiable. C.R.A.S. Paris Série I 303(17): 861-864, 1986. (with R. Correa).

Proceedings (reprints available here)

1. The asymptotic behavior of the price of anarchy. In Proceedings of the 13th Conference on Web and Internet Economics, WINE 2017 (Bangalore, India, December 17-20, 2017), N. R. Devanur and P. Lu (Eds.), Lecture Notes in Computer Science Vol. 10674, pp. 133-145,  (with R. Colini-Baldeschi, P. Mertikopoulos and M. Scarsini).

2. Long term behavior of dynamic equilibria in fluid queuing networks. In Proceedings of the 19th Conference on Integer Programming and Combinatorial Optimization (IPCO'2017), F. Eisenbrand and J. Koenemann (Eds.), Lecture Notes in Computer Science Vol. 10328, pp. 161-172, 2017 (with J. Correa and N. Olver). 

3. On the Price of Anarchy of Highly Congested Nonatomic Network Games. In Proceedings of the 9th International Symposium on Algorithmic Game Theory (SAGT'2016) (Liverpool, UK, September 19–21, 2016), Lecture Notes in Computer Science Vol. 9928, pp. 117-128, 2016 (with R. Colini-Baldeschi and M. Scarsini).

4. Network congestion control with Markovian multipath routing. In Proceedings of the 5th International Conference on Network Games, Control and Optimization (NetGCOOP'2011), IEEE CFP1186R-PRT, pp. 93-100, 2011 (with C. Guzmán).

5. Existence and uniqueness of equilibria for flows over time. 38th International Colloquium on Automata, Languages and Programming (ICALP'2011), Lecture Notes in Computer Science 6756, pp. 552-563, 2011 (with J. Correa J. and O. Larré). 

6. Network games with atomic players. 33rd International Colloquium on Automata, Languages and Programming (ICALP'2006), Lecture Notes in Computer Science 4051, pp. 525-536, 2006 (with J. Correa and N. Stier-Moses). 

7. Nonlinear averages and convergence of penalty trajectories in convex programming. Workshop on Ill--posed Variational Problems and Regularization Techniques, Trier, 1998, Lecture Notes in Economics and Mathematical Systems 477, Springer-Verlag, pp. 65-78.

Book Chapters

1. A model for the space-time spread of pine shoot moth. Handbook of Operations Research in Natural Resources, A. Weintraub et al. Eds., International Series in Operations Research & Management Science, Vol. 99,  Springer-Verlag, pp. 511-524, 2007 (with J. San Martín).

Book

1. Cominetti R.,  Facchinei F., Lasserre J.B.,  Modern Optimization Modelling Techniques, Series Advanced Courses in Mathematics CRM Barcelona, A. Daniilidis, J.E. Martinez-Legaz (Eds), Birkhauser, Springer Basel (2012).