Computing approximate equilibria in weighted congestion games via best-responses

Y Giannakopoulos, G Noarov… - … of Operations Research, 2022 - pubsonline.informs.org
We present a deterministic polynomial-time algorithm for computing dd+ o (d)-approximate
(pure) Nash equilibria in (proportional sharing) weighted congestion games with polynomial …
被引用次数：10 相关文章

Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses

Y Giannakopoulos, G Noarov, AS Schulz - arXiv e-prints, 2018 - ui.adsabs.harvard.edu
We present a deterministic polynomial-time algorithm for computing $ d^{d+ o (d)} $-
approximate (pure) Nash equilibria in (proportional sharing) weighted congestion games …

Computing approximate equilibria in weighted congestion games via best-responses

Y Giannakopoulos, G Noarov… - Mathematics of Operations …, 2022 - eprints.gla.ac.uk
We present a deterministic polynomial-time algorithm for computing dd+ o (d)-approximate
(pure) Nash equilibria in (proportional sharing) weighted congestion games with polynomial …

Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses

Y Giannakopoulos, G Noarov, AS Schulz - Mathematics of Operations …, 2022 - dl.acm.org
We present a deterministic polynomial-time algorithm for computing dd+ o (d)-approximate
(pure) Nash equilibria in (proportional sharing) weighted congestion games with polynomial …

Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses

Y Giannakopoulos, G Noarov… - Mathematics of Operations …, 2022 - ideas.repec.org
We present a deterministic polynomial-time algorithm for computing dd+ o (d)-approximate
(pure) Nash equilibria in (proportional sharing) weighted congestion games with polynomial …

Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses

Y Giannakopoulos, G Noarov… - … of Operations Research, 2022 - econpapers.repec.org
We present a deterministic polynomial-time algorithm for computing dd+ o (d)-approximate
(pure) Nash equilibria in (proportional sharing) weighted congestion games with polynomial …

Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses

Y Giannakopoulos, G Noarov, AS Schulz - arXiv preprint arXiv:1810.12806, 2018 - arxiv.org
We present a deterministic polynomial-time algorithm for computing $ d^{d+ o (d)} $-
approximate (pure) Nash equilibria in (proportional sharing) weighted congestion games …

[引用][C] Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses

Y Giannakopoulos, G Noarov… - Proceedings of the 13th …, 2020 - mediatum.ub.tum.de
mediaTUM - Medien- und Publikationsserver mediaTUM Universitätsbibliothek Technische
Universität München Logo Benutzer: Gast Login de en mediaTUM Gesamtbestand …

[引用][C] Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses

Y Giannakopoulos, G Noarov… - … of Operations Research, 2022 - mediatum.ub.tum.de
mediaTUM - Medien- und Publikationsserver mediaTUM Universitätsbibliothek Technische
Universität München Logo Benutzer: Gast Login de en Erweiterte Suche mediaTUM …