Argyrios Deligkas

139 papers A* 31A 8B 15Journal 80Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Distributed Agent-Constrained Truthful Facility Location. CoRR Argyrios Deligkas, Panagiotis Kanellopoulos, Alexandros A. Voudouris
2026	A*	`conf`	Dividing Indivisible Items for the Benefit of All: It Is Hard to Be Fair Without Social Awareness. AAAI Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich
2026	A*	`conf`	Network Restoration Games with Quotas (Student Abstract). AAAI Philip Bogaars, Argyrios Deligkas, Eduard Eiben, Michail Fasoulakis
2026	A*	`conf`	Public Goods Games in Directed Networks with Constraints on Sharing. AAAI Argyrios Deligkas, Gregory Z. Gutin, Mark Jones, Philip R. Neary, Anders Yeo
2026	J	`jnl`	Routing few robots in a crowded network. J. Comput. Syst. Sci. Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan
2026	J	`jnl`	Stability in Distance Preservation Games on Graphs. CoRR Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich
2025	J	`jnl`	Agent-constrained truthful facility location games. J. Comb. Optim. Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris
2025	A*	`conf`	Balanced and Fair Partitioning of Friends. AAAI Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich
2025	J	`jnl`	Balanced and Fair Partitioning of Friends. CoRR Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich
2025	J	`jnl`	Constant Inapproximability for PPA. SIAM J. Comput. Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2025	J	`jnl`	Dividing Indivisible Items for the Benefit of All: It is Hard to Be Fair Without Social Awareness. CoRR Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich
2025	A*	`conf`	EF1 and EFX Orientations. IJCAI Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna
2025	A*	`conf`	How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. AAAI Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2025	J	`jnl`	Mechanism Design with Outliers and Predictions. CoRR Argyrios Deligkas, Eduard Eiben, Sophie Klumper, Guido Schäfer, Artem Tsikiridis
2025	A	`conf`	Parameterized Algorithms for Multiagent Pathfinding on Trees. AAMAS Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2025	J	`jnl`	Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs. CoRR Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2025	J	`jnl`	Pizza Sharing is PPA-hard. ACM Trans. Comput. Theory Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
2025	J	`jnl`	Public Goods Games in Directed Networks with Constraints on Sharing. CoRR Argyrios Deligkas, Gregory Z. Gutin, Mark Jones, Philip R. Neary, Anders Yeo
2025	B	`conf`	Routing Few Robots in a Crowded Network. WADS Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan
2025	J	`jnl`	Special issue on Economics and Computation. Inf. Process. Lett. Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2025	A*	`conf`	The Complexity of Extending Fair Allocations of Indivisible Goods. AAAI Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis
2025	J	`jnl`	The Complexity of Extending Fair Allocations of Indivisible Goods. CoRR Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis
2024	B	`conf`	Agent-Constrained Truthful Facility Location Games. SAGT Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris
2024	J	`jnl`	Agent-Constrained Truthful Facility Location Games. CoRR Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris
2024	J	`jnl`	Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. Algorithmica Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2024	J	`jnl`	Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. Inf. Comput. Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2024	A*	`conf`	Constant Inapproximability for Fisher Markets. EC Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2024	J	`jnl`	EF1 and EFX Orientations. CoRR Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna
2024	J	`jnl`	How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. CoRR Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2024	A*	`conf`	Individual Rationality in Topological Distance Games Is Surprisingly Hard. IJCAI Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich
2024	J	`jnl`	Individual Rationality in Topological Distance Games is Surprisingly Hard. CoRR Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich
2024	A*	`conf`	Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2024	J	`jnl`	Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
2024	J	`jnl`	Pure-Circuit: Tight Inapproximability for PPAD. J. ACM Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2024	A*	`conf`	The Complexity of Fair Division of Indivisible Items with Externalities. AAAI Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
2024	A	`conf`	The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
2024	J	`jnl`	The parameterized complexity of welfare guarantees in Schelling segregation. Theor. Comput. Sci. Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
2024	A*	`conf`	Truthful Interval Covering. IJCAI Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2024	J	`jnl`	Truthful interval covering. Auton. Agents Multi Agent Syst. Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2023	A*	`conf`	A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. SODA Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
2023	J	`jnl`	A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. SIAM J. Comput. Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
2023	J	`jnl`	A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. ACM Trans. Algorithms Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
2023	B	`ed.`	Algorithmic Game Theory - 16th International Symposium, SAGT 2023, Egham, UK, September 4-7, 2023, Proceedings SAGT Argyrios Deligkas, Aris Filos-Ratsikas
2023	A	`conf`	Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. AAMAS Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2023	J	`jnl`	Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. CoRR Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2023	J	`jnl`	Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	A*	`conf`	Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Heterogeneous facility location with limited resources. Games Econ. Behav. Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2023	J	`jnl`	Learning approximately optimal contracts. Theor. Comput. Sci. Alon Cohen, Argyrios Deligkas, Moran Koren
2023	A*	`conf`	Minimizing Reachability Times on Temporal Graphs via Shifting Labels. IJCAI Argyrios Deligkas, Eduard Eiben, George Skretas
2023	J	`jnl`	Optimality guarantees for crystal structure prediction. Nat. Vladimir V. Gusev, Duncan Adamson, Argyrios Deligkas, Dmytro Antypov, Christopher M. Collins, Piotr Krysta, Igor Potapov, George R. Darling, Matthew S. Dyer, Paul G. Spirakis, Matthew J. Rosseinsky
2023	J	`jnl`	Some coordination problems are harder than others. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	The Complexity of Envy-Free Graph Cutting. CoRR Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2023	J	`jnl`	The Complexity of Fair Division of Indivisible Items with Externalities. CoRR Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
2023	A	`conf`	The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
2023	B	`conf`	The k-Centre Problem for Classes of Cyclic Words. SOFSEM Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
2023	A*	`conf`	Tight Inapproximability for Graphical Games. AAAI Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2023	J	`jnl`	Truthful Interval Covering. CoRR Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2022	J	`jnl`	A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. CoRR Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
2022	A	`conf`	A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. ESA Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
2022	J	`jnl`	A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. CoRR Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
2022	J	`jnl`	Approximating the existential theory of the reals. J. Comput. Syst. Sci. Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2022	J	`jnl`	Constant Inapproximability for PPA. CoRR Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022	A*	`conf`	Constant inapproximability for PPA. STOC Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022	A*	`conf`	Heterogeneous Facility Location with Limited Resources. AAAI Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2022	B	`conf`	Learning Approximately Optimal Contracts. SAGT Alon Cohen, Argyrios Deligkas, Moran Koren
2022	J	`jnl`	Optimizing reachability sets in temporal graphs by delaying. Inf. Comput. Argyrios Deligkas, Igor Potapov
2022	A*	`conf`	Parameterized Complexity of Hotelling-Downs with Party Nominees. IJCAI Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
2022	A*	`conf`	Pizza Sharing Is PPA-Hard. AAAI Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
2022	A*	`conf`	Pure-Circuit: Strong Inapproximability for PPAD. FOCS Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022	J	`jnl`	Pure-Circuit: Strong Inapproximability for PPAD. CoRR Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022	A*	`conf`	The Complexity of Envy-Free Graph Cutting. IJCAI Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2022	B	`conf`	The Complexity of Periodic Energy Minimisation. MFCS Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
2022	J	`jnl`	The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. CoRR Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith
2022	J	`jnl`	Tight Inapproximability for Graphical Games. CoRR Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022	J	`jnl`	Two's company, three's a crowd: Consensus-halving for a constant number of agents. Artif. Intell. Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
2021	J	`jnl`	Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. J. Comput. Syst. Sci. Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2021	J	`jnl`	Connected Subgraph Defense Games. Algorithmica Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
2021	J	`jnl`	Heterogeneous Facility Location with Limited Resources. CoRR Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris
2021	J	`jnl`	Minimizing Reachability Times on Temporal Graphs via Shifting Labels. CoRR Argyrios Deligkas, Eduard Eiben, George Skretas
2021	J	`jnl`	On the Hardness of Energy Minimisation for Crystal Structure Prediction. Fundam. Informaticae Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
2021	B	`conf`	Ranking Bracelets in Polynomial Time. CPM Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas
2021	J	`jnl`	Ranking Bracelets in Polynomial Time. CoRR Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
2021	A*	`conf`	The Parameterized Complexity of Connected Fair Division. IJCAI Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2021	J	`jnl`	The k-Centre Selection Problem for Multidimensional Necklaces. CoRR Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
2021	A*	`conf`	Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. EC Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
2021	A	`conf`	Walrasian Equilibria in Markets with Small Demands. AAMAS Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
2020	B	`conf`	Crystal Structure Prediction via Oblivious Local Search. SEA Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos
2020	J	`jnl`	Crystal Structure Prediction via Oblivious Local Search. CoRR Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos
2020	B	`conf`	Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. MFCS Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2020	J	`jnl`	Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. CoRR Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2020	J	`jnl`	Heterogeneous Facility Location Games. CoRR Eleftherios Anastasiadis, Argyrios Deligkas
2020	J	`jnl`	Lipschitz Continuity and Approximate Equilibria. Algorithmica Argyrios Deligkas, John Fearnley, Paul G. Spirakis
2020	J	`jnl`	Matching in Stochastically Evolving Graphs. CoRR Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2020	B	`conf`	On the Hardness of Energy Minimisation for Crystal Structure Prediction. SOFSEM Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
2020	A*	`conf`	Optimizing Reachability Sets in Temporal Graphs by Delaying. AAAI Argyrios Deligkas, Igor Potapov
2020	J	`jnl`	Optimizing Reachability Sets in Temporal Graphs by Delaying. CoRR Argyrios Deligkas, Igor Potapov
2020	J	`jnl`	Square-Cut Pizza Sharing is PPA-complete. CoRR Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
2020	J	`jnl`	The K-Centre Problem for Necklaces. CoRR Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
2020	A*	`conf`	Tree Polymatrix Games Are PPAD-Hard. ICALP Argyrios Deligkas, John Fearnley, Rahul Savani
2020	J	`jnl`	Tree Polymatrix Games are PPAD-hard. CoRR Argyrios Deligkas, John Fearnley, Rahul Savani
2020	J	`jnl`	Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. CoRR Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
2020	J	`jnl`	Walrasian Equilibria in Markets with Small Demands. CoRR Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
2019	J	`jnl`	Binary Search in Graphs Revisited. Algorithmica Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
2019	A*	`conf`	Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. ICALP Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2019	J	`jnl`	Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. CoRR Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2019	B	`conf`	Connected Subgraph Defense Games. SAGT Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
2019	J	`jnl`	Connected Subgraph Defense Games. CoRR Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis
2019	J	`jnl`	Distributed Methods for Computing Approximate Equilibria. Algorithmica Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
2019	J	`jnl`	On the Hardness of Energy Minimisation for Crystal Structure Prediction. CoRR Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov
2018	—	`conf`	Approximating the Existential Theory of the Reals. WINE Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2018	J	`jnl`	Approximating the Existential Theory of the Reals. CoRR Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2018	B	`conf`	Directed Graph Minors and Serial-Parallel Width. MFCS Argyrios Deligkas, Reshef Meir
2018	A	`conf`	Heterogeneous Facility Location Games. AAMAS Eleftherios Anastasiadis, Argyrios Deligkas
2018	J	`jnl`	Inapproximability results for constrained approximate Nash equilibria. Inf. Comput. Argyrios Deligkas, John Fearnley, Rahul Savani
2018	J	`jnl`	Incentivizing the Dynamic Workforce: Learning Contracts in the Gig-Economy. CoRR Alon Cohen, Moran Koren, Argyrios Deligkas
2018	A*	`conf`	Traffic Light Scheduling, Value of Time, and Incentives. IJCAI Argyrios Deligkas, Erez Karpas, Ron Lavi, Rann Smorodinsky
2017	B	`conf`	Binary Search in Graphs Revisited. MFCS Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
2017	J	`jnl`	Binary Search in Graphs Revisited. CoRR Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
2017	J	`jnl`	Computing Approximate Nash Equilibria in Polymatrix Games. Algorithmica Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis
2017	B	`conf`	Computing Constrained Approximate Equilibria in Polymatrix Games. SAGT Argyrios Deligkas, John Fearnley, Rahul Savani
2017	J	`jnl`	Computing Constrained Approximate Equilibria in Polymatrix Games. CoRR Argyrios Deligkas, John Fearnley, Rahul Savani
2017	A*	`conf`	The Computational Complexity of Weighted Greedy Matching. AAAI Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
2016	A	`conf`	An Empirical Study on Computing Equilibria in Polymatrix Games. AAMAS Argyrios Deligkas, John Fearnley, Tobenna Peter Igwe, Rahul Savani
2016	J	`jnl`	An Empirical Study on Computing Equilibria in Polymatrix Games. CoRR Argyrios Deligkas, John Fearnley, Tobenna Peter Igwe, Rahul Savani
2016	—	`conf`	Distributed Methods for Computing Approximate Equilibria. WINE Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
2016	—	`—`	Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games. Argyrios Deligkas
2016	—	`conf`	Inapproximability Results for Approximate Nash Equilibria. WINE Argyrios Deligkas, John Fearnley, Rahul Savani
2016	J	`jnl`	Inapproximability Results for Approximate Nash Equilibria. CoRR Argyrios Deligkas, John Fearnley, Rahul Savani
2016	B	`conf`	Lipschitz Continuity and Approximate Equilibria. SAGT Argyrios Deligkas, John Fearnley, Paul G. Spirakis
2016	J	`jnl`	On the Complexity of Weighted Greedy Matchings. CoRR Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
2015	J	`jnl`	Distributed Methods for Computing Approximate Equilibria. CoRR Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
2015	J	`jnl`	On Equilibrium Computation in Biased Games with Quadratic Penalties. CoRR Argyrios Deligkas, Paul G. Spirakis
2014	—	`conf`	Computing Approximate Nash Equilibria in Polymatrix Games. WINE Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis
2014	J	`jnl`	Computing Approximate Nash Equilibria in Polymatrix Games. CoRR Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis
2014	A*	`conf`	Increasing VCG Revenue by Decreasing the Quality of Items. AAAI Mingyu Guo, Argyrios Deligkas, Rahul Savani
2013	J	`jnl`	Revenue Maximization via Hiding Item Attributes CoRR Mingyu Guo, Argyrios Deligkas
2013	A*	`conf`	Revenue Maximization via Hiding Item Attributes. IJCAI Mingyu Guo, Argyrios Deligkas