Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Lianeas, Thanasis"'
We consider a natural model of online preference aggregation, where sets of preferred items $R_1, R_2, \ldots, R_t$ along with a demand for $k_t$ items in each $R_t$, appear online. Without prior knowledge of $(R_t, k_t)$, the learner maintains a ran
Externí odkaz:
http://arxiv.org/abs/2011.02817
Autor:
Flokas, Lampros, Vlatakis-Gkaragkounis, Emmanouil-Vasileios, Lianeas, Thanasis, Mertikopoulos, Panayotis, Piliouras, Georgios
Understanding the behavior of no-regret dynamics in general $N$-player games is a fundamental question in online learning and game theory. A folk result in the field states that, in finite games, the empirical frequency of play under no-regret learni
Externí odkaz:
http://arxiv.org/abs/2010.09514
Autor:
Fotakis, Dimitris, Kandiros, Vardis, Lianeas, Thanasis, Mouzakis, Nikos, Patsilinakos, Panagiotis, Skoulakis, Stratis
In this work, we seek a more refined understanding of the complexity of local optimum computation for Max-Cut and pure Nash equilibrium (PNE) computation for congestion games with weighted players and linear latency functions. We show that computing
Externí odkaz:
http://arxiv.org/abs/1911.08704
Autor:
Khodabakhsh, Ali, Yang, Ger, Basu, Soumya, Nikolova, Evdokia, Caramanis, Michael C., Lianeas, Thanasis, Pountourakis, Emmanouil
Publikováno v:
HICSS 51 (2018) 2717-2726
Distribution network reconfiguration (DNR) is a tool used by operators to balance line load flows and mitigate losses. As distributed generation and flexible load adoption increases, the impact of DNR on the security, efficiency, and reliability of t
Externí odkaz:
http://arxiv.org/abs/1711.03517
Selfish routing is a central problem in algorithmic game theory, with one of the principal applications being that of routing in road networks. Inspired by the emergence of routing technologies and autonomous driving, we revisit selfish routing and c
Externí odkaz:
http://arxiv.org/abs/1707.00208
We seek to understand when heterogeneity in user preferences yields improved outcomes in terms of overall cost. That this might be hoped for is based on the common belief that diversity is advantageous in many settings. We investigate this in the con
Externí odkaz:
http://arxiv.org/abs/1702.07806
Publikováno v:
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI'16). AAAI Press, 338-344, 2016
We consider a nonatomic selfish routing model with independent stochastic travel times, represented by mean and variance latency functions for each edge that depend on their flows. In an effort to decouple the effect of risk-averse player preferences
Externí odkaz:
http://arxiv.org/abs/1510.02067
The inefficiency of the Wardrop equilibrium of nonatomic routing games can be eliminated by placing tolls on the edges of a network so that the socially optimal flow is induced as an equilibrium flow. A solution where the minimum number of edges are
Externí odkaz:
http://arxiv.org/abs/1509.07260
In routing games, the network performance at equilibrium can be significantly improved if we remove some edges from the network. This counterintuitive fact, widely known as Braess's paradox, gives rise to the (selfish) network design problem, where w
Externí odkaz:
http://arxiv.org/abs/1207.5212
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.