Expand icon Search icon File icon file Download

Items where Author is "Hollender, Alexandros"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 10.

Article

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2024) Pure-Circuit: Tight Inapproximability for PPAD. Journal of the ACM, 71 (5). pp. 1-48. DOI https://doi.org/10.1145/3678166 (In Press)

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2024) Constant Inapproximability for PPA. SIAM Journal on Computing. (In Press)

Birmpas, Georgios and Gan, Jiarui and Hollender, Alexandros and Marmolejo-Cossío, Francisco J and Rajgopal, Ninad and Voudouris, Alexandros A (2021) Optimally Deceiving a Learning Leader in Stackelberg Games. Journal of Artificial Intelligence Research, 72. pp. 507-531. DOI https://doi.org/10.1613/jair.1.12542

Amanatidis, Georgios and Birmpas, Georgios and Filos-Ratsikas, Aris and Hollender, Alexandros and Voudouris, Alexandros A (2021) Maximum Nash welfare and other stories about EFX. Theoretical Computer Science, 863. pp. 69-85. DOI https://doi.org/10.1016/j.tcs.2021.02.020

Monograph

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2022) Pure-Circuit: Strong Inapproximability for PPAD. Working Paper. arXiv. (Unpublished)

Conference or Workshop Item

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2024) Constant Inapproximability for Fisher Markets. In: Twenty-Fifth ACM Conference on Economics and Computation (EC'24), 2024-07-08 - 2024-07-11, Yale University, New Haven, CT, USA. (In Press)

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2023) Tight Inapproximability for Graphical Games. In: 37th AAAI Conference on Artificial Intelligence, 2023-02-07 - 2023-02-14, Washington DC, USA.

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2022) Pure-Circuit: Strong Inapproximability for PPAD. In: FOCS 2022: 63rd IEEE Symposium on Foundations of Computer Science, 2022-10-31 - 2022-11-03, Denver, Colorado.

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2022) Constant Inapproximability for PPA. In: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022-06-20 - 2022-06-24, Rome, Italy.

Amanatidis, Georgios and Birmpas, Georgios and Filos-Ratsikas, Aris and Hollender, Alexandros and Voudouris, Alexandros A (2021) Maximum Nash Welfare and Other Stories About EFX. In: 29th International Joint Conference on Artificial Intelligence, IJCAI 2020, 2020-07-11 - 2020-07-17. (In Press)

This list was generated on Thu Dec 12 00:35:07 2024 GMT.