default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoberto Cominetti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Roberto Cominetti
, Valerio Dose, Marco Scarsini:
Monotonicity of equilibria in nonatomic congestion games. Eur. J. Oper. Res. 316(2): 754-766 (2024)- [j33]Roberto Cominetti, Valerio Dose, Marco Scarsini:
The price of anarchy in routing games as a function of the demand. Math. Program. 203(1): 531-558 (2024) - [j32]Mario Bravo, Roberto Cominetti:
Stochastic Fixed-Point Iterations for Nonexpansive Maps: Convergence and Error Bounds. SIAM J. Control. Optim. 62(1): 191-219 (2024) - 2023
- [j31]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Approximation and Convergence of Large Atomic Congestion Games. Math. Oper. Res. 48(2): 784-811 (2023) - [j30]Juan Pablo Contreras, Roberto Cominetti:
Optimal error bounds for non-expansive fixed-point iterations in normed spaces. Math. Program. 199(1): 343-374 (2023) - [i11]Roberto Cominetti, Valerio Dose, Marco Scarsini:
Phase Transitions of the Price-of-Anarchy Function in Multi-Commodity Routing Games. CoRR abs/2305.03459 (2023) - [i10]Roberto Cominetti, Valerio Dose, Marco Scarsini:
Monotonicity of Equilibria in Nonatomic Congestion Games. CoRR abs/2308.00434 (2023) - 2022
- [j29]Roberto Cominetti, José Correa, Neil Olver:
Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. Oper. Res. 70(1): 516-526 (2022) - [j28]Roberto Cominetti, Matteo Quattropani, Marco Scarsini:
The Buck-Passing Game. Math. Oper. Res. 47(3): 1731-1756 (2022) - 2021
- [j27]Ignacio Rios, Tomás Larroucau, Giorgiogiulio Parra, Roberto Cominetti:
Improving the Chilean College Admissions System. Oper. Res. 69(4): 1186-1205 (2021) - [i9]Roberto Cominetti, José Correa, Neil Olver:
Long term behavior of dynamic equilibria in fluid queuing networks. CoRR abs/2112.10412 (2021) - 2020
- [j26]Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini:
When Is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic. Oper. Res. 68(2): 411-434 (2020) - [i8]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Convergence of Large Atomic Congestion Games. CoRR abs/2001.02797 (2020)
2010 – 2019
- 2019
- [j25]Mario Bravo, Roberto Cominetti, Matías Pavez-Signé:
Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces. Math. Program. 175(1-2): 241-262 (2019) - [j24]Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini:
Price of Anarchy for Highly Congested Routing Games in Parallel Networks. Theory Comput. Syst. 63(1): 90-113 (2019) - [c8]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs. EC 2019: 579-580 - [c7]Roberto Cominetti, Valerio Dose, Marco Scarsini:
The Price of Anarchy in Routing Games as a Function of the Demand. WINE 2019: 337 - [i7]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs. CoRR abs/1903.03309 (2019) - [i6]Roberto Cominetti, Valerio Dose, Marco Scarsini:
The Price of Anarchy in Routing Games as a Function of the Demand. CoRR abs/1907.10101 (2019) - 2018
- [i5]Roberto Cominetti, Matteo Quattropani, Marco Scarsini:
The Buck-Passing Game. CoRR abs/1808.03206 (2018) - [i4]Roberto Cominetti, Tobias Harks, Carolina Osorio, Britta Peis:
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102). Dagstuhl Reports 8(3): 21-38 (2018) - 2017
- [c6]Roberto Cominetti, José Correa, Neil Olver:
Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. IPCO 2017: 161-172 - [c5]Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini:
The Asymptotic Behavior of the Price of Anarchy. WINE 2017: 133-145 - [i3]Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini:
On the asymptotic behavior of the price of anarchy: Is selfish routing bad in highly congested networks? CoRR abs/1703.00927 (2017) - 2016
- [j23]Jean-Bernard Baillon, Roberto Cominetti, José Vaisman:
A Sharp Uniform Bound for the Distribution of Sums of Bernoulli Trials. Comb. Probab. Comput. 25(3): 352-361 (2016) - [j22]Roberto Cominetti, Alfredo Torrico:
Additive Consistency of Risk Measures and Its Application to Risk-Averse Routing in Networks. Math. Oper. Res. 41(4): 1510-1521 (2016) - [c4]Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini:
On the Price of Anarchy of Highly Congested Nonatomic Network Games. SAGT 2016: 117-128 - [i2]Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini:
On the Price of Anarchy of Highly Congested Nonatomic Network Games. CoRR abs/1605.03081 (2016) - 2015
- [j21]Roberto Cominetti, José R. Correa, Omar Larré:
Dynamic Equilibria in Fluid Queueing Networks. Oper. Res. 63(1): 21-34 (2015) - [j20]Roberto Cominetti:
Equilibrium routing under uncertainty. Math. Program. 151(1): 117-151 (2015) - 2014
- [j19]Roberto Cominetti, Cristóbal Guzmán:
Network congestion control with Markovian multipath routing. Math. Program. 147(1-2): 231-251 (2014) - [j18]Roberto Cominetti, Walter F. Mascarenhas, Paulo J. S. Silva:
A Newton's method for the continuous quadratic knapsack problem. Math. Program. Comput. 6(2): 151-169 (2014) - 2012
- [b1]Roberto Cominetti, Francisco Facchinei, Jean B. Lasserre:
Modern Optimization Modelling Techniques. Advanced courses in mathematics : CRM Barcelona, Birkhäuser 2012, ISBN 978-3-0348-0290-1, pp. I-IX, 1-269 - 2011
- [c3]Roberto Cominetti, José R. Correa, Omar Larré:
Existence and Uniqueness of Equilibria for Flows over Time. ICALP (2) 2011: 552-563 - [c2]Roberto Cominetti, Cristóbal Guzmán:
Network congestion control with Markovian multipath routing. NetGCoop 2011: 1-8 - [i1]Roberto Cominetti, Cristóbal Guzmán:
Network Congestion Control with Markovian Multipath Routing. CoRR abs/1107.2900 (2011) - 2010
- [j17]Roberto Cominetti, Emerson Melo, Sylvain Sorin:
A payoff-based learning procedure and its application to traffic games. Games Econ. Behav. 70(1): 71-83 (2010) - [j16]Roberto Cominetti, José R. Correa, Thomas Rothvoß, Jaime San Martín:
Optimal Selection of Customers for a Last-Minute Offer. Oper. Res. 58(4-Part-1): 878-888 (2010)
2000 – 2009
- 2009
- [j15]Roberto Cominetti, José R. Correa, Nicolás E. Stier Moses:
The Impact of Oligopolistic Competition in Networks. Oper. Res. 57(6): 1421-1437 (2009) - [j14]Roberto Cominetti, Adriana Piazza:
Asymptotic Convergence of Optimal Policies for Resource Management with Application to Harvesting of Multiple Species Forest. Math. Oper. Res. 34(3): 576-593 (2009) - [j13]Hédy Attouch, Roberto Cominetti, Marc Teboulle:
Foreword: Special issue on nonlinear convex optimization and variational inequalities. Math. Program. 116(1-2): 1-3 (2009) - [j12]Jean-Bernard Baillon, Roberto Cominetti:
Asymptotic Expansion of Penalty-Gradient Flows in Linear Programming. SIAM J. Optim. 20(2): 728-739 (2009) - 2008
- [j11]Jean-Bernard Baillon, Roberto Cominetti:
Markovian traffic equilibrium. Math. Program. 111(1-2): 33-56 (2008) - 2006
- [c1]Roberto Cominetti, José R. Correa, Nicolás E. Stier Moses:
Network Games with Atomic Players. ICALP (1) 2006: 525-536 - 2002
- [j10]Felipe Alvarez, Roberto Cominetti:
Primal and dual convergence of a proximal point exponential penalty method for linear programming. Math. Program. 93(1): 87-96 (2002) - [j9]Roberto Cominetti, Matias Courdurier:
Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm. SIAM J. Optim. 13(3): 745-765 (2002) - 2001
- [j8]Roberto Cominetti, José Correa:
Common-Lines and Passenger Assignment in Congested Transit Networks. Transp. Sci. 35(3): 250-267 (2001)
1990 – 1999
- 1999
- [j7]J. Frédéric Bonnans, Roberto Cominetti, Alexander Shapiro:
Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets. SIAM J. Optim. 9(2): 466-492 (1999) - 1998
- [j6]J. Frédéric Bonnans, Roberto Cominetti, Alexander Shapiro:
Sensitivity Analysis of Optimization Problems Under Second Order Regular Constraints. Math. Oper. Res. 23(4): 806-831 (1998) - 1997
- [j5]Alfred Auslender, Roberto Cominetti, Mounir Haddou:
Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming. Math. Oper. Res. 22(1): 43-62 (1997) - [j4]Roberto Cominetti, Christian Michelot:
Sufficient conditions for coincidence in ℓ1 multifacility location problems. Oper. Res. Lett. 20(4): 179-185 (1997) - 1994
- [j3]Roberto Cominetti, Jaime San Martín:
Asymptotic analysis of the exponential penalty trajectory in linear programming. Math. Program. 67: 169-187 (1994) - 1993
- [j2]Alfred Auslender, Roberto Cominetti, Jean-Pierre Crouzeix:
Convex Functions with Unbounded Level Sets and Applications to Duality Theory. SIAM J. Optim. 3(4): 669-687 (1993) - 1991
- [j1]Alfred Auslender, Roberto Cominetti:
A Comparative Study of Multifunction Differentiability with Applications in Mathematical Programming. Math. Oper. Res. 16(2): 240-258 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
