default search action
Yiannis Giannakopoulos
Person information
- affiliation: University of Glasgow, UK
- affiliation (former): Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos:
On the Smoothed Complexity of Combinatorial Local Search. ICALP 2024: 72:1-72:19 - [c15]Yiannis Giannakopoulos, Johannes Hahn:
Discrete Single-Parameter Optimal Auction Design. SAGT 2024: 165-183 - [i20]Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Charalampos Kokkalis:
On the Computation of Equilibria in Discrete First-Price Auctions. CoRR abs/2402.12068 (2024) - [i19]Yiannis Giannakopoulos, Johannes Hahn:
Discrete Single-Parameter Optimal Auction Design. CoRR abs/2406.08125 (2024) - 2023
- [j16]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann:
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. Math. Oper. Res. 48(1): 583-602 (2023) - [j15]Yiannis Giannakopoulos, Diogo Poças:
A Unifying Approximate Potential for Weighted Congestion Games. Theory Comput. Syst. 67(4): 855-876 (2023) - [j14]Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças:
On the Complexity of Equilibrium Computation in First-Price Auctions. SIAM J. Comput. 52(1): 80-131 (2023) - [i18]Yiannis Giannakopoulos:
A Smoothed FPTAS for Equilibria in Congestion Games. CoRR abs/2306.10600 (2023) - 2022
- [j13]Yiannis Giannakopoulos, Georgy Noarov, Andreas S. Schulz:
Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses. Math. Oper. Res. 47(1): 643-664 (2022) - [j12]Aris Filos-Ratsikas, Yiannis Giannakopoulos, Philip Lazos:
The Pareto Frontier of Inefficiency in Mechanism Design. Math. Oper. Res. 47(2): 923-944 (2022) - [j11]Yiannis Giannakopoulos, Diogo Poças, Alexandros Tsigonias-Dimitriadis:
Robust Revenue Maximization Under Minimal Statistical Information. ACM Trans. Economics and Comput. 10(3): 11:1-11:34 (2022) - [i17]Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos:
On the Smoothed Complexity of Combinatorial Local Search. CoRR abs/2211.07547 (2022) - 2021
- [j10]Yiannis Giannakopoulos, Alexander Hammerl, Diogo Poças:
A New Lower Bound for Deterministic Truthful Scheduling. Algorithmica 83(9): 2895-2913 (2021) - [j9]Yiannis Giannakopoulos, Diogo Poças, Keyu Zhu:
Optimal Pricing for MHR and λ-regular Distributions. ACM Trans. Economics and Comput. 9(1): 2:1-2:28 (2021) - [c14]Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças:
On the Complexity of Equilibrium Computation in First-Price Auctions. EC 2021: 454-476 - [i16]Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças:
On the Complexity of Equilibrium Computation in First-Price Auctions. CoRR abs/2103.03238 (2021) - 2020
- [c13]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann:
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. ICALP 2020: 32:1-32:18 - [c12]Yiannis Giannakopoulos, Diogo Poças:
A Unifying Approximate Potential for Weighted Congestion Games. SAGT 2020: 99-113 - [c11]Yiannis Giannakopoulos, Alexander Hammerl, Diogo Poças:
A New Lower Bound for Deterministic Truthful Scheduling. SAGT 2020: 226-240 - [c10]Yiannis Giannakopoulos, Diogo Poças, Alexandros Tsigonias-Dimitriadis:
Robust Revenue Maximization Under Minimal Statistical Information. WINE 2020: 177-190 - [i15]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann:
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. CoRR abs/2002.07466 (2020) - [i14]Yiannis Giannakopoulos, Alexander Hammerl, Diogo Poças:
A New Lower Bound for Deterministic Truthful Scheduling. CoRR abs/2005.10054 (2020) - [i13]Yiannis Giannakopoulos, Diogo Poças:
A Unifying Approximate Potential for Weighted Congestion Games. CoRR abs/2005.10101 (2020)
2010 – 2019
- 2019
- [j8]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. SIAM J. Comput. 48(5): 1544-1582 (2019) - [j7]Yiannis Giannakopoulos, Elias Koutsoupias, Maria Kyropoulou:
The anarchy of scheduling without money. Theor. Comput. Sci. 778: 19-32 (2019) - [c9]Aris Filos-Ratsikas, Yiannis Giannakopoulos, Philip Lazos:
The Pareto Frontier of Inefficiency in Mechanism Design. WINE 2019: 186-199 - [i12]Yiannis Giannakopoulos, Diogo Poças, Alexandros Tsigonias-Dimitriadis:
Robust Revenue Maximization Under Minimal Statistical Information. CoRR abs/1907.04220 (2019) - 2018
- [j6]Yiannis Giannakopoulos, Elias Koutsoupias:
Selling two goods optimally. Inf. Comput. 261: 432-445 (2018) - [j5]Yiannis Giannakopoulos, Elias Koutsoupias:
Duality and Optimality of Auctions for Uniform Distributions. SIAM J. Comput. 47(1): 121-165 (2018) - [c8]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. ICALP 2018: 150:1-150:16 - [c7]Yiannis Giannakopoulos, Keyu Zhu:
Optimal Pricing for MHR Distributions. WINE 2018: 154-167 - [i11]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. CoRR abs/1802.09952 (2018) - [i10]Aris Filos-Ratsikas, Yiannis Giannakopoulos, Philip Lazos:
The Pareto Frontier of Inefficiency in Mechanism Design. CoRR abs/1809.03454 (2018) - [i9]Yiannis Giannakopoulos, Keyu Zhu:
Optimal Pricing For MHR Distributions. CoRR abs/1810.00800 (2018) - [i8]Yiannis Giannakopoulos, Georgy Noarov, Andreas S. Schulz:
An Improved Algorithm for Computing Approximate Equilibria in Weighted Congestion Games. CoRR abs/1810.12806 (2018) - 2017
- [j4]Yiannis Giannakopoulos, Maria Kyropoulou:
The VCG Mechanism for Bayesian Scheduling. ACM Trans. Economics and Comput. 5(4): 19:1-19:16 (2017) - [c6]Yiannis Giannakopoulos, Elias Koutsoupias, Philip Lazos:
Online Market Intermediation. ICALP 2017: 47:1-47:14 - [i7]Yiannis Giannakopoulos, Elias Koutsoupias, Philip Lazos:
Online Market Intermediation. CoRR abs/1703.09279 (2017) - 2016
- [c5]Yiannis Giannakopoulos, Elias Koutsoupias, Maria Kyropoulou:
The Anarchy of Scheduling Without Money. SAGT 2016: 302-314 - [i6]Yiannis Giannakopoulos, Elias Koutsoupias, Maria Kyropoulou:
The Anarchy of Scheduling Without Money. CoRR abs/1607.03688 (2016) - 2015
- [b1]Yiannis Giannakopoulos:
Duality theory for optimal mechanism design. University of Oxford, UK, 2015 - [j3]Yiannis Giannakopoulos, Elias Koutsoupias:
Competitive analysis of maintaining frequent items of a stream. Theor. Comput. Sci. 562: 23-32 (2015) - [j2]Yiannis Giannakopoulos:
Bounding the optimal revenue of selling multiple goods. Theor. Comput. Sci. 581: 83-96 (2015) - [c4]Yiannis Giannakopoulos, Elias Koutsoupias:
Selling Two Goods Optimally. ICALP (2) 2015: 650-662 - [c3]Yiannis Giannakopoulos, Maria Kyropoulou:
The VCG Mechanism for Bayesian Scheduling. WINE 2015: 343-356 - [i5]Yiannis Giannakopoulos, Maria Kyropoulou:
The VCG Mechanism for Bayesian Scheduling. CoRR abs/1509.07455 (2015) - [i4]Yiannis Giannakopoulos, Elias Koutsoupias:
Selling Two Goods Optimally. CoRR abs/1510.03399 (2015) - 2014
- [c2]Yiannis Giannakopoulos, Elias Koutsoupias:
Duality and optimality of auctions for uniform distributions. EC 2014: 259-276 - [i3]Yiannis Giannakopoulos, Elias Koutsoupias:
Duality and Optimality of Auctions for Uniform Distributions. CoRR abs/1404.2329 (2014) - [i2]Yiannis Giannakopoulos:
Bounding Optimal Revenue in Multiple-Items Auctions. CoRR abs/1404.2832 (2014) - [i1]Yiannis Giannakopoulos:
A Note on Optimal Auctions for Two Uniformly Distributed Items. CoRR abs/1409.6925 (2014) - 2012
- [c1]Yiannis Giannakopoulos, Elias Koutsoupias:
Competitive Analysis of Maintaining Frequent Items of a Stream. SWAT 2012: 340-351 - 2011
- [j1]Luca Becchetti, Ioannis Chatzigiannakis, Yiannis Giannakopoulos:
Streaming techniques and data aggregation in networks of tiny artefacts. Comput. Sci. Rev. 5(1): 27-46 (2011)
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 2024-09-22 00:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint