Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Lolakapuri, Phani Raj"'
Autor:
Lolakapuri, Phani Raj, Bhaskar, Umang, Narayanam, Ramasuri, Parija, Gyana R, Dayama, Pankaj S
We study the complexity of equilibrium computation in discrete preference games. These games were introduced by Chierichetti, Kleinberg, and Oren (EC '13, JCSS '18) to model decision-making by agents in a social network that choose a strategy from a
Externí odkaz:
http://arxiv.org/abs/1905.11680
Autor:
Bhaskar, Umang, Lolakapuri, Phani Raj
We present polynomial-time algorithms as well as hardness results for equilibrium computation in atomic splittable routing games, for the case of general convex cost functions. These games model traffic in freight transportation, market oligopolies,
Externí odkaz:
http://arxiv.org/abs/1804.10044
Autor:
Bhaskar, Umang, Lolakapuri, Phani Raj
We present polynomial-time algorithms as well as hardness results for equilibrium computation in atomic splittable routing games, for the case of general convex cost functions. These games model traffic in freight transportation, market oligopolies,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c08e0be93f079f1469ba7ab7f30863f4