Argyrios Deligkas

Aris Filos-Ratsikas

Alexandros A. Voudouris

Auton. Agents Multi Agent Syst., December, 2024

Pure-Circuit: Tight Inapproximability for PPAD.

[BibT_eX]

[DOI]

J. ACM, October, 2024

Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle.

[BibT_eX]

[DOI]

Algorithmica, September, 2024

The parameterized complexity of welfare guarantees in Schelling segregation.

[BibT_eX]

[DOI]

Eduard Eiben

Tiger-Lily Goldsmith

Theor. Comput. Sci., 2024

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source.

[BibT_eX]

[DOI]

Inf. Comput., 2024

EF1 and EFX Orientations.

[BibT_eX]

[DOI]

CoRR, 2024

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Constant Inapproximability for Fisher Markets.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Agent-Constrained Truthful Facility Location Games.

[BibT_eX]

[DOI]

Mohammad Lotfi

Alexandros A. Voudouris

Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

Individual Rationality in Topological Distance Games Is Surprisingly Hard.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

The Complexity of Fair Division of Indivisible Items with Externalities.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Learning approximately optimal contracts.

[BibT_eX]

[DOI]

Alon Cohen

Moran Koren

Theor. Comput. Sci., November, 2023

A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games.

[BibT_eX]

[DOI]

Michail Fasoulakis

Evangelos Markakis

ACM Trans. Algorithms, October, 2023

A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games.

[BibT_eX]

[DOI]

Michail Fasoulakis

Evangelos Markakis

SIAM J. Comput., October, 2023

Heterogeneous facility location with limited resources.

[BibT_eX]

[DOI]

Aris Filos-Ratsikas

Alexandros A. Voudouris

Games Econ. Behav., May, 2023

Optimality guarantees for crystal structure prediction.

[BibT_eX]

[DOI]

Christopher M. Collins

Matthew J. Rosseinsky

Nat., 2023

Some coordination problems are harder than others.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems.

[BibT_eX]

[DOI]

CoRR, 2023

The k-Centre Problem for Classes of Cyclic Words.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Minimizing Reachability Times on Temporal Graphs via Shifting Labels.

[BibT_eX]

[DOI]

Eduard Eiben

George Skretas

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Tight Inapproximability for Graphical Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Approximating the existential theory of the reals.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Optimizing reachability sets in temporal graphs by delaying.

[BibT_eX]

[DOI]

Igor Potapov

Inf. Comput., 2022

Two's company, three's a crowd: Consensus-halving for a constant number of agents.

[BibT_eX]

[DOI]

Aris Filos-Ratsikas

Artif. Intell., 2022

Constant inapproximability for PPA.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

The Complexity of Periodic Energy Minimisation.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

The Complexity of Envy-Free Graph Cutting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Parameterized Complexity of Hotelling-Downs with Party Nominees.

[BibT_eX]

[DOI]

Eduard Eiben

Tiger-Lily Goldsmith

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Pure-Circuit: Strong Inapproximability for PPAD.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Pizza Sharing Is PPA-Hard.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Computing exact solutions of consensus halving and the Borsuk-Ulam theorem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

On the Hardness of Energy Minimisation for Crystal Structure Prediction.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

The k-Centre Selection Problem for Multidimensional Necklaces.

[BibT_eX]

[DOI]

CoRR, 2021

Connected Subgraph Defense Games.

[BibT_eX]

[DOI]

Eleni C. Akrida

Algorithmica, 2021

The Parameterized Complexity of Connected Fair Division.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Ranking Bracelets in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

Walrasian Equilibria in Markets with Small Demands.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Square-Cut Pizza Sharing is PPA-complete.

[BibT_eX]

[DOI]

CoRR, 2020

The K-Centre Problem for Necklaces.

[BibT_eX]

[DOI]

CoRR, 2020

Matching in Stochastically Evolving Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Lipschitz Continuity and Approximate Equilibria.

[BibT_eX]

[DOI]

Algorithmica, 2020

Crystal Structure Prediction via Oblivious Local Search.

[BibT_eX]

[DOI]

Dmytro Antypov

Vladimir V. Gusev

Matthew J. Rosseinsky

Michail Theofilatos

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Tree Polymatrix Games Are PPAD-Hard.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Binary Search in Graphs Revisited.

[BibT_eX]

[DOI]

George B. Mertzios

Algorithmica, 2019

Distributed Methods for Computing Approximate Equilibria.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Inapproximability results for constrained approximate Nash equilibria.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Incentivizing the Dynamic Workforce: Learning Contracts in the Gig-Economy.

[BibT_eX]

[DOI]

Alon Cohen

Moran Koren

CoRR, 2018

Directed Graph Minors and Serial-Parallel Width.

[BibT_eX]

[DOI]

Reshef Meir

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Traffic Light Scheduling, Value of Time, and Incentives.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Heterogeneous Facility Location Games.

[BibT_eX]

[DOI]

Eleftherios Anastasiadis

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Computing Approximate Nash Equilibria in Polymatrix Games.

[BibT_eX]

[DOI]

Algorithmica, 2017

Computing Constrained Approximate Equilibria in Polymatrix Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

The Computational Complexity of Weighted Greedy Matching.

[BibT_eX]

[DOI]

George B. Mertzios

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games.

[BibT_eX]

[DOI]

PhD thesis, 2016

On the Complexity of Weighted Greedy Matchings.

[BibT_eX]

[DOI]

George B. Mertzios

CoRR, 2016

Inapproximability Results for Approximate Nash Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

An Empirical Study on Computing Equilibria in Polymatrix Games.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

On Equilibrium Computation in Biased Games with Quadratic Penalties.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Increasing VCG Revenue by Decreasing the Quality of Items.

[BibT_eX]

[DOI]

Mingyu Guo

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Revenue Maximization via Hiding Item Attributes.

[BibT_eX]

[DOI]

Mingyu Guo