受强制性开放获取政策约束的文章 - Thanasis Lianeas了解详情
可在其他位置公开访问的文章：8 篇
No-regret learning and mixed nash equilibria: They do not mix
EV Vlatakis-Gkaragkounis, L Flokas, T Lianeas, P Mertikopoulos, ...
Advances in Neural Information Processing Systems 33, 1380-1391, 2020
强制性开放获取政策： US National Science Foundation, European Commission, Agence Nationale de la …
No-regret learning and mixed Nash equilibria: They do not mix
L Flokas, EV Vlatakis-Gkaragkounis, T Lianeas, P Mertikopoulos, ...
arXiv preprint arXiv:2010.09514, 10, 2020
强制性开放获取政策： US National Science Foundation, European Commission, Agence Nationale de la …
Network pricing: How to induce optimal flows under strategic link operators
J Correa, C Guzmán, T Lianeas, E Nikolova, M Schröder
Proceedings of the 2018 ACM Conference on Economics and Computation, 375-392, 2018
强制性开放获取政策： US National Science Foundation
Efficient online learning of optimal rankings: Dimensionality reduction via gradient descent
D Fotakis, T Lianeas, G Piliouras, S Skoulakis
Advances in Neural Information Processing Systems 33, 7816-7827, 2020
强制性开放获取政策： National Research Foundation, Singapore
Risk-averse selfish routing
T Lianeas, E Nikolova, NE Stier-Moses
Mathematics of Operations Research 44 (1), 38-57, 2019
强制性开放获取政策： US National Science Foundation, Government of Argentina
When does diversity of agent preferences improve outcomes in selfish routing?
R Cole, T Lianeas, E Nikolova
Proceedings of the 27th International Joint Conference on Artificial …, 2018
强制性开放获取政策： US National Science Foundation
Resolving braess’s paradox in random networks
D Fotakis, AC Kaporis, T Lianeas, PG Spirakis
Algorithmica 78, 788-818, 2017
强制性开放获取政策： European Commission
Reconciling selfish routing with social good
S Basu, G Yang, T Lianeas, E Nikolova, Y Chen
International Symposium on Algorithmic Game Theory, 147-159, 2017
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定