Zobrazeno 1 - 10
of 109
pro vyhledávání: '"Roberto Cominetti"'
Publikováno v:
Mathematics of Operations Research, 48(2), 784-811. Institute for Operations Research and the Management Sciences
We consider the question of whether, and in what sense, Wardrop equilibria provide a good approximation for Nash equilibria in atomic unsplittable congestion games with a large number of small players. We examine two different definitions of small pl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aceff7353aa1236ca0fcfb8cea6b53f0
https://cris.maastrichtuniversity.nl/en/publications/5c1f2805-f624-47be-8ac1-930f93f05d96
https://cris.maastrichtuniversity.nl/en/publications/5c1f2805-f624-47be-8ac1-930f93f05d96
Publikováno v:
Mathematical Programming. 199:343-374
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0fca8c979ceefe6c143e6609a42c0c21
https://doi.org/10.1007/s10107-022-01830-7
https://doi.org/10.1007/s10107-022-01830-7
Publikováno v:
Operations Research. 69:1186-1205
In “Improving the Chilean College Admissions System,” Rios, Larroucau, Parra, and Cominetti describe the design and implementation of a new system to solve the Chilean college admissions problem. The authors develop an algorithm that (i) obtains
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f920da682779e2ee2b7f36257f6c27bc
https://doi.org/10.1287/opre.2021.2116
https://doi.org/10.1287/opre.2021.2116
Autor:
Mario Bravo, Roberto Cominetti
Publikováno v:
Israel Journal of Mathematics. 227:163-188
We establish sharp estimates for the convergence rate of the Kranosel'ski\v{\i}-Mann fixed point iteration in general normed spaces, and we use them to show that the asymptotic regularity bound recently proved in [11] (Israel Journal of Mathematics 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da415eda65371727b489e54e8536b2c9
https://doi.org/10.1007/s11856-018-1723-z
https://doi.org/10.1007/s11856-018-1723-z
Publikováno v:
Optimization. 68:3-12
The convex feasibility problem consists in finding a point in the intersection of a finite family of closed convex sets. When the intersection is empty, a best compromise is to search for a point t...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a31ee8978dee34f08b863a1e51b7575
https://doi.org/10.1080/02331934.2018.1474471
https://doi.org/10.1080/02331934.2018.1474471
Publikováno v:
Mathematical Programming. 175:241-262
We study the convergence of an inexact version of the classical Krasnosel’skii–Mann iteration for computing fixed points of nonexpansive maps. Our main result establishes a new metric bound for the fixed-point residuals, from which we derive thei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::793320a011a27519d3c801416cfdb485
https://doi.org/10.1007/s10107-018-1240-1
https://doi.org/10.1007/s10107-018-1240-1
Publikováno v:
Theory of Computing Systems. 63:90-113
We consider nonatomic routing games with one source and one destination connected by multiple parallel edges. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some empirical observations, we prove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a724c8891eb4cd2b39332a8423bcc3e
https://doi.org/10.1007/s00224-017-9834-1
https://doi.org/10.1007/s00224-017-9834-1
Publikováno v:
EC '19: Proceedings of the 2019 ACM Conference on Economics and Computation, 579-580
STARTPAGE=579;ENDPAGE=580;TITLE=EC '19: Proceedings of the 2019 ACM Conference on Economics and Computation
STARTPAGE=579;ENDPAGE=580;TITLE=EC '19: Proceedings of the 2019 ACM Conference on Economics and Computation
We consider an atomic congestion game in which each player participates in the game with an exogenous and known probability $p_{i}\in[0,1]$, independently of everybody else, or stays out and incurs no cost. We first prove that the resulting game is p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb49ef806723a14705229ceb711e44ea
https://doi.org/10.1145/3328526.3329579
https://doi.org/10.1145/3328526.3329579
Autor:
Alfredo Torrico, Roberto Cominetti
Publikováno v:
Mathematics of Operations Research. 41:1510-1521
This paper investigates the use of risk measures and theories of choice for modeling risk-averse route choice and traffic network equilibrium with random travel times. We interpret the postulates of these theories in the context of routing, and we id
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0b0dcd3e06a8433a54f1bbaa4906d01
https://doi.org/10.1287/moor.2016.0787
https://doi.org/10.1287/moor.2016.0787
We consider a game in which players are the vertices of a directed graph. Initially, Nature chooses one player according to some fixed distribution and gives her a buck, which represents the request to perform a chore. After completing the task, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da597eb421bd7175b71fde5d2959510a
http://arxiv.org/abs/1808.03206
http://arxiv.org/abs/1808.03206