default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArgyrios Deligkas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j25]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris:
Special issue on Economics and Computation. Inf. Process. Lett. 190: 106578 (2025)- [j24]Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris:
Agent-constrained truthful facility location games. J. Comb. Optim. 49(2): 24 (2025) - [j23]Argyrios Deligkas
, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Constant Inapproximability for PPA. SIAM J. Comput. 54(2): 163-192 (2025) - [j22]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos:
Pizza Sharing is PPA-hard. ACM Trans. Comput. Theory 17(3): 19:1-19:43 (2025) - [c54]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis:
The Complexity of Extending Fair Allocations of Indivisible Goods. AAAI 2025: 13745-13753 - [c53]Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich:
Balanced and Fair Partitioning of Friends. AAAI 2025: 13754-13762 - [c52]Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit:
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. AAAI 2025: 26498-26506 - [c51]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Multiagent Pathfinding on Trees. AAMAS 2025: 584-592 - [c50]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna:
EF1 and EFX Orientations. IJCAI 2025: 56-63 - [c49]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan:
Routing Few Robots in a Crowded Network. WADS 2025: 20:1-20:15 - [i49]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis:
The Complexity of Extending Fair Allocations of Indivisible Goods. CoRR abs/2503.01368 (2025) - [i48]Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich:
Balanced and Fair Partitioning of Friends. CoRR abs/2503.10830 (2025) - [i47]Argyrios Deligkas, Eduard Eiben, Sophie Klumper, Guido Schäfer, Artem Tsikiridis:
Mechanism Design with Outliers and Predictions. CoRR abs/2509.09561 (2025) - 2024
- [j21]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris:
Truthful interval covering. Auton. Agents Multi Agent Syst. 38(2): 41 (2024) - [j20]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. Algorithmica 86(9): 2766-2785 (2024) - [j19]Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas:
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. Inf. Comput. 299: 105171 (2024) - [j18]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Pure-Circuit: Tight Inapproximability for PPAD. J. ACM 71(5): 31:1-31:48 (2024) - [j17]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
The parameterized complexity of welfare guarantees in Schelling segregation. Theor. Comput. Sci. 1017: 114783 (2024) - [c48]Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich:
The Complexity of Fair Division of Indivisible Items with Externalities. AAAI 2024: 9653-9661 - [c47]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS 2024: 425-433 - [c46]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP 2024: 53:1-53:18 - [c45]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris:
Truthful Interval Covering. IJCAI 2024: 2774-2781 - [c44]Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich:
Individual Rationality in Topological Distance Games Is Surprisingly Hard. IJCAI 2024: 2782-2790 - [c43]Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris:
Agent-Constrained Truthful Facility Location Games. SAGT 2024: 129-146 - [c42]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Constant Inapproximability for Fisher Markets. EC 2024: 13-39 - [i46]Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich:
Individual Rationality in Topological Distance Games is Surprisingly Hard. CoRR abs/2404.14128 (2024) - [i45]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR abs/2404.15950 (2024) - [i44]Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris:
Agent-Constrained Truthful Facility Location Games. CoRR abs/2405.05197 (2024) - [i43]Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit:
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. CoRR abs/2408.17107 (2024) - [i42]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna:
EF1 and EFX Orientations. CoRR abs/2409.13616 (2024) - 2023
- [j16]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris:
Heterogeneous facility location with limited resources. Games Econ. Behav. 139: 200-215 (2023) - [j15]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:
Optimality guarantees for crystal structure prediction. Nat. 619(7968): 68-72 (2023) - [j14]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. SIAM J. Comput. 52(5): 1083-1096 (2023) - [j13]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. ACM Trans. Algorithms 19(4): 31:1-31:17 (2023) - [j12]Alon Cohen, Argyrios Deligkas, Moran Koren:
Learning approximately optimal contracts. Theor. Comput. Sci. 980: 114219 (2023) - [c41]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Tight Inapproximability for Graphical Games. AAAI 2023: 5600-5607 - [c40]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas:
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. AAMAS 2023: 2222-2230 - [c39]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS 2023: 2860-2862 - [c38]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI 2023: 2642-2650 - [c37]Argyrios Deligkas, Eduard Eiben, George Skretas:
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. IJCAI 2023: 5333-5340 - [c36]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. SODA 2023: 3777-3787 - [c35]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The k-Centre Problem for Classes of Cyclic Words. SOFSEM 2023: 385-400 - [e1]Argyrios Deligkas, Aris Filos-Ratsikas:
Algorithmic Game Theory - 16th International Symposium, SAGT 2023, Egham, UK, September 4-7, 2023, Proceedings. Lecture Notes in Computer Science 14238, Springer 2023, ISBN 978-3-031-43253-8 [contents] - [i41]Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas:
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. CoRR abs/2303.11703 (2023) - [i40]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR abs/2305.07124 (2023) - [i39]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR abs/2307.01109 (2023) - [i38]Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich:
The Complexity of Fair Division of Indivisible Items with Externalities. CoRR abs/2308.08869 (2023) - [i37]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris:
Truthful Interval Covering. CoRR abs/2309.05377 (2023) - [i36]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Some coordination problems are harder than others. CoRR abs/2311.03195 (2023) - [i35]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Envy-Free Graph Cutting. CoRR abs/2312.07043 (2023) - 2022
- [j11]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender:
Two's company, three's a crowd: Consensus-halving for a constant number of agents. Artif. Intell. 313: 103784 (2022) - [j10]Argyrios Deligkas, Igor Potapov:
Optimizing reachability sets in temporal graphs by delaying. Inf. Comput. 285(Part): 104890 (2022) - [j9]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the existential theory of the reals. J. Comput. Syst. Sci. 125: 106-128 (2022) - [c34]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos:
Pizza Sharing Is PPA-Hard. AAAI 2022: 4957-4965 - [c33]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris:
Heterogeneous Facility Location with Limited Resources. AAAI 2022: 4966-4974 - [c32]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. ESA 2022: 41:1-41:14 - [c31]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Pure-Circuit: Strong Inapproximability for PPAD. FOCS 2022: 159-170 - [c30]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Envy-Free Graph Cutting. IJCAI 2022: 237-243 - [c29]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
Parameterized Complexity of Hotelling-Downs with Party Nominees. IJCAI 2022: 244-250 - [c28]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The Complexity of Periodic Energy Minimisation. MFCS 2022: 8:1-8:15 - [c27]Alon Cohen, Argyrios Deligkas, Moran Koren:
Learning Approximately Optimal Contracts. SAGT 2022: 331-346 - [c26]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Constant inapproximability for PPA. STOC 2022: 1010-1023 - [i34]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. CoRR abs/2201.06904 (2022) - [i33]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Constant Inapproximability for PPA. CoRR abs/2201.10011 (2022) - [i32]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. CoRR abs/2204.11525 (2022) - [i31]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. CoRR abs/2207.07007 (2022) - [i30]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Pure-Circuit: Strong Inapproximability for PPAD. CoRR abs/2209.15149 (2022) - [i29]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Tight Inapproximability for Graphical Games. CoRR abs/2209.15151 (2022) - 2021
- [j8]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. Algorithmica 83(11): 3403-3431 (2021) - [j7]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
On the Hardness of Energy Minimisation for Crystal Structure Prediction. Fundam. Informaticae 184(3): 181-203 (2021) - [j6]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. J. Comput. Syst. Sci. 117: 75-98 (2021) - [c25]Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Walrasian Equilibria in Markets with Small Demands. AAMAS 2021: 413-419 - [c24]Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas:
Ranking Bracelets in Polynomial Time. CPM 2021: 4:1-4:17 - [c23]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Parameterized Complexity of Connected Fair Division. IJCAI 2021: 139-145 - [c22]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender:
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. EC 2021: 347-368 - [i28]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
Ranking Bracelets in Polynomial Time. CoRR abs/2104.04324 (2021) - [i27]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros A. Voudouris:
Heterogeneous Facility Location with Limited Resources. CoRR abs/2105.02712 (2021) - [i26]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The k-Centre Selection Problem for Multidimensional Necklaces. CoRR abs/2108.01990 (2021) - [i25]Argyrios Deligkas, Eduard Eiben, George Skretas:
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. CoRR abs/2112.08797 (2021) - 2020
- [j5]Argyrios Deligkas, John Fearnley, Paul G. Spirakis:
Lipschitz Continuity and Approximate Equilibria. Algorithmica 82(10): 2927-2954 (2020) - [c21]Argyrios Deligkas, Igor Potapov:
Optimizing Reachability Sets in Temporal Graphs by Delaying. AAAI 2020: 9810-9817 - [c20]Argyrios Deligkas, John Fearnley, Rahul Savani:
Tree Polymatrix Games Are PPAD-Hard. ICALP 2020: 38:1-38:14 - [c19]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. MFCS 2020: 27:1-27:13 - [c18]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
On the Hardness of Energy Minimisation for Crystal Structure Prediction. SOFSEM 2020: 587-596 - [c17]Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos:
Crystal Structure Prediction via Oblivious Local Search. SEA 2020: 21:1-21:14 - [i24]Argyrios Deligkas, John Fearnley, Rahul Savani:
Tree Polymatrix Games are PPAD-hard. CoRR abs/2002.12119 (2020) - [i23]Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos:
Crystal Structure Prediction via Oblivious Local Search. CoRR abs/2003.12442 (2020) - [i22]Argyrios Deligkas, Igor Potapov:
Optimizing Reachability Sets in Temporal Graphs by Delaying. CoRR abs/2004.05875 (2020) - [i21]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. CoRR abs/2004.06036 (2020) - [i20]Eleftherios Anastasiadis, Argyrios Deligkas:
Heterogeneous Facility Location Games. CoRR abs/2005.03095 (2020) - [i19]Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Matching in Stochastically Evolving Graphs. CoRR abs/2005.08263 (2020) - [i18]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The K-Centre Problem for Necklaces. CoRR abs/2005.10095 (2020) - [i17]Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Walrasian Equilibria in Markets with Small Demands. CoRR abs/2005.11796 (2020) - [i16]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender:
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. CoRR abs/2007.15125 (2020) - [i15]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos:
Square-Cut Pizza Sharing is PPA-complete. CoRR abs/2012.14236 (2020)
2010 – 2019
- 2019
- [j4]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. Algorithmica 81(3): 1205-1231 (2019) - [j3]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. Algorithmica 81(5): 1757-1780 (2019) - [c16]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. ICALP 2019: 138:1-138:14 - [c15]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. SAGT 2019: 216-236 - [i14]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. CoRR abs/1903.03101 (2019) - [i13]Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. CoRR abs/1906.02774 (2019) - [i12]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
On the Hardness of Energy Minimisation for Crystal Structure Prediction. CoRR abs/1910.12026 (2019) - 2018
- [j2]Argyrios Deligkas, John Fearnley, Rahul Savani:
Inapproximability results for constrained approximate Nash equilibria. Inf. Comput. 262: 40-56 (2018) - [c14]Eleftherios Anastasiadis, Argyrios Deligkas:
Heterogeneous Facility Location Games. AAMAS 2018: 623-631 - [c13]Argyrios Deligkas, Erez Karpas, Ron Lavi, Rann Smorodinsky:
Traffic Light Scheduling, Value of Time, and Incentives. IJCAI 2018: 4743-4749 - [c12]Argyrios Deligkas, Reshef Meir:
Directed Graph Minors and Serial-Parallel Width. MFCS 2018: 44:1-44:14 - [c11]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the Existential Theory of the Reals. WINE 2018: 126-139 - [i11]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the Existential Theory of the Reals. CoRR abs/1810.01393 (2018) - [i10]Alon Cohen, Moran Koren, Argyrios Deligkas:
Incentivizing the Dynamic Workforce: Learning Contracts in the Gig-Economy. CoRR abs/1811.06736 (2018) - 2017
- [j1]Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. Algorithmica 77(2): 487-514 (2017) - [c10]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
The Computational Complexity of Weighted Greedy Matching. AAAI 2017: 466-474 - [c9]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. MFCS 2017: 20:1-20:14 - [c8]Argyrios Deligkas, John Fearnley, Rahul Savani:
Computing Constrained Approximate Equilibria in Polymatrix Games. SAGT 2017: 93-105 - [i9]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. CoRR abs/1702.08899 (2017) - [i8]Argyrios Deligkas, John Fearnley, Rahul Savani:
Computing Constrained Approximate Equilibria in Polymatrix Games. CoRR abs/1705.02266 (2017) - 2016
- [b1]Argyrios Deligkas:
Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games. University of Liverpool, UK, 2016 - [c7]Argyrios Deligkas, John Fearnley, Tobenna Peter Igwe, Rahul Savani:
An Empirical Study on Computing Equilibria in Polymatrix Games. AAMAS 2016: 186-195 - [c6]Argyrios Deligkas, John Fearnley, Paul G. Spirakis:
Lipschitz Continuity and Approximate Equilibria. SAGT 2016: 15-26 - [c5]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. WINE 2016: 15-28 - [c4]Argyrios Deligkas, John Fearnley, Rahul Savani:
Inapproximability Results for Approximate Nash Equilibria. WINE 2016: 29-43 - [i7]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
On the Complexity of Weighted Greedy Matchings. CoRR abs/1602.05909 (2016) - [i6]Argyrios Deligkas, John Fearnley, Tobenna Peter Igwe, Rahul Savani:
An Empirical Study on Computing Equilibria in Polymatrix Games. CoRR abs/1602.06865 (2016) - [i5]Argyrios Deligkas, John Fearnley, Rahul Savani:
Inapproximability Results for Approximate Nash Equilibria. CoRR abs/1608.03574 (2016) - 2015
- [i4]Argyrios Deligkas, Paul G. Spirakis:
On Equilibrium Computation in Biased Games with Quadratic Penalties. CoRR abs/1509.02023 (2015) - [i3]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. CoRR abs/1512.03315 (2015) - 2014
- [c3]Mingyu Guo, Argyrios Deligkas, Rahul Savani:
Increasing VCG Revenue by Decreasing the Quality of Items. AAAI 2014: 705-711 - [c2]Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. WINE 2014: 58-71 - [i2]Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. CoRR abs/1409.3741 (2014) - 2013
- [c1]Mingyu Guo, Argyrios Deligkas:
Revenue Maximization via Hiding Item Attributes. IJCAI 2013: 157-163 - [i1]Mingyu Guo, Argyrios Deligkas:
Revenue Maximization via Hiding Item Attributes. CoRR abs/1302.5332 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-28 22:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
