( en | de | ru )

 

Disambiguation of "Hollender, Alexandros"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Inapproximability for Graphical Games.

, , , and . CoRR, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Juliane Hollender

Elisabeth Hollender

Martin Hollender

Nina Hollender

Martin Hollender

 

Other publications of authors with the same name

Two's company, three's a crowd: Consensus-halving for a constant number of agents., , and . Artif. Intell., (2022)PPAD-membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization., , , and . CoRR, (2023)The Complexity of Gradient Descent: CLS = PPAD $\cap$ PLS, , , and . (2020)cite arxiv:2011.01929Comment: Updated based on reviewer comments, including a non-computer-assisted proof.A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting., , , and . SODA, page 2615-2634. SIAM, (2021)The classes PPA-k: Existence from arguments modulo k.. Theor. Comput. Sci., (2021)The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard., and . Electron. Colloquium Comput. Complex., (2018)Tight Inapproximability for Graphical Games., , , and . CoRR, (2022)On the Computation of Equilibria in Discrete First-Price Auctions., , , and . CoRR, (2024)Consensus Halving for Sets of Items., , , , and . Math. Oper. Res., 47 (4): 3357-3379 (November 2022)FIXP-membership via Convex Optimization: Games, Cakes, and Markets., , , and . FOCS, page 827-838. IEEE, (2021)