default search action
Philip Lazos
Person information
- affiliation: Input Output
- affiliation (former): Sapienza Università di Roma, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Aggelos Kiayias, Elias Koutsoupias, Philip Lazos, Giorgos Panagiotakos:
Blockchain Space Tokenization. AFT 2024: 9:1-9:20 - [c22]Georgios Amanatidis, Aris Filos-Ratsikas, Philip Lazos, Evangelos Markakis, Georgios Papasotiropoulos:
On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes. AAMAS 2024: 49-57 - [i29]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Algorithmically Fair Maximization of Multiple Submodular Objective Functions. CoRR abs/2402.15155 (2024) - [i28]Aggelos Kiayias, Philip Lazos, Paolo Penna:
Single-token vs Two-token Blockchain Tokenomics. CoRR abs/2403.15429 (2024) - [i27]Georgios Birmpas, Philip Lazos, Evangelos Markakis, Paolo Penna:
Reward Schemes and Committee Sizes in Proof of Stake Governance. CoRR abs/2406.10525 (2024) - [i26]Aggelos Kiayias, Elias Koutsoupias, Philip Lazos, Giorgos Panagiotakos:
Blockchain Space Tokenization. IACR Cryptol. ePrint Arch. 2024: 1154 (2024) - 2023
- [j6]Shant Boodaghians
, Federico Fusco
Pandora's Box Problem with Order Constraints. Math. Oper. Res. 48(1): 498-519 (2023) - [j5]Aris Filos-Ratsikas
On the Complexity of Equilibrium Computation in First-Price Auctions. SIAM J. Comput. 52(1): 80-131 (2023) - [c21]Georgios Amanatidis
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. EC 2023: 67-87 - [i25]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. CoRR abs/2301.13652 (2023) - [i24]Aggelos Kiayias, Elias Koutsoupias, Philip Lazos, Giorgos Panagiotakos:
Tiered Mechanisms for Blockchain Transaction Fees. CoRR abs/2304.06014 (2023) - [i23]Aggelos Kiayias, Philip Lazos, Jan Christoph Schlegel:
Would Friedman Burn your Tokens? CoRR abs/2306.17025 (2023) - [i22]Luis Alejandro Benavides-Vázquez, Héctor Alonso Guzmán-Gutiérrez, Jakob Jonnerby, Philip Lazos, Edwin Lock, Francisco J. Marmolejo Cossío, Ninad Rajgopal, José Roberto Tello-Ayala:
Optimal Testing and Containment Strategies for Universities in Mexico amid COVID-19. CoRR abs/2306.17191 (2023) - [i21]Georgios Amanatidis, Aris Filos-Ratsikas, Philip Lazos, Evangelos Markakis, Georgios Papasotiropoulos:
On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes. CoRR abs/2309.05642 (2023) - 2022
- [j4]Georgios Amanatidis, Federico Fusco
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. J. Artif. Intell. Res. 74: 661-690 (2022) - [j3]Aris Filos-Ratsikas
The Pareto Frontier of Inefficiency in Mechanism Design. Math. Oper. Res. 47(2): 923-944 (2022) - [c20]Aggelos Kiayias
SoK: Blockchain Governance. AFT 2022: 61-73 - [c19]Georgios Birmpas
Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria. AFT 2022: 268-280 - [c18]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco J. Marmolejo Cossío:
Decentralized Update Selection with Semi-strategic Experts. SAGT 2022: 403-420 - [c17]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. SODA 2022: 1298-1325 - [i20]Aggelos Kiayias, Philip Lazos:
SoK: Blockchain Governance. CoRR abs/2201.07188 (2022) - [i19]Georgios Birmpas, Lyudmila Kovalchuk, Philip Lazos, Roman Oliynykov:
Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria. CoRR abs/2202.04064 (2022) - [i18]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco J. Marmolejo Cossío:
Decentralised Update Selection with Semi-Strategic Experts. CoRR abs/2205.08407 (2022) - 2021
- [j2]Christian Coester
The Infinite Server Problem. ACM Trans. Algorithms 17(3): 20:1-20:23 (2021) - [j1]Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis, Philip Lazos, Stratis Skoulakis, Nikos Zarifis:
Reallocating multiple facilities on the line. Theor. Comput. Sci. 858: 13-34 (2021) - [c16]Philip Lazos, Francisco J. Marmolejo Cossío, Xinyu Zhou, Jonathan Katz:
RPPLNS: Pay-per-last-N-shares with a Randomised Twist. AAMAS 2021: 1569-1571 - [c15]Edwin Lock, Francisco Javier Marmolejo Cossío, Jakob Jonnerby, Ninad Rajgopal, Héctor Alonso Guzmán-Gutiérrez, Luis Alejandro Benavides-Vázquez, José Roberto Tello-Ayala, Philip Lazos:
Optimal Testing and Containment Strategies for Universities in Mexico amid COVID-19✱. EAAMO 2021: 12:1-12:9 - [c14]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. ICML 2021: 231-242 - [c13]Aris Filos-Ratsikas
On the Complexity of Equilibrium Computation in First-Price Auctions. EC 2021: 454-476 - [c12]Paul Dütting, Federico Fusco
Efficient two-sided markets with limited information. STOC 2021: 1452-1465 - [c11]Georgios Amanatidis, Georgios Birmpas, Federico Fusco
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. WINE 2021: 149-166 - [i17]Philip Lazos, Francisco J. Marmolejo Cossío, Xinyu Zhou, Jonathan Katz:
RPPLNS: Pay-per-last-N-shares with a Randomised Twist. CoRR abs/2102.07681 (2021) - [i16]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser:
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. CoRR abs/2102.08327 (2021) - [i15]Aris Filos-Ratsikas, Yiannis Giannakopoulos
On the Complexity of Equilibrium Computation in First-Price Auctions. CoRR abs/2103.03238 (2021) - [i14]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Prophet Inequalities for Matching with a Single Sample. CoRR abs/2104.02050 (2021) - [i13]Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. CoRR abs/2109.08644 (2021) - [i12]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. CoRR abs/2111.03174 (2021) - 2020
- [c10]Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J. Marmolejo Cossío
Fairness and Efficiency in DAG-Based Cryptocurrencies. Financial Cryptography 2020: 79-96 - [c9]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. NeurIPS 2020 - [c8]Shant Boodaghians, Federico Fusco
Pandora's Box Problem with Order Constraints. EC 2020: 439-458 - [i11]Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. CoRR abs/2002.06968 (2020) - [i10]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Efficient Two-Sided Markets with Limited Information. CoRR abs/2003.07503 (2020) - [i9]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. CoRR abs/2007.05014 (2020)
2010 – 2019
- 2019
- [c7]Matthias Gerstgrasser, Paul W. Goldberg
Multi-Unit Bilateral Trade. AAAI 2019: 1973-1980 - [c6]Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis, Philip Lazos, Stratis Skoulakis
Reallocating Multiple Facilities on the Line. IJCAI 2019: 273-279 - [c5]Aris Filos-Ratsikas
The Pareto Frontier of Inefficiency in Mechanism Design. WINE 2019: 186-199 - [c4]Elias Koutsoupias, Philip Lazos, Foluso Ogunlana, Paolo Serafino:
Blockchain Mining Games with Pay Forward. WWW 2019: 917-927 - [i8]Elias Koutsoupias, Philip Lazos, Paolo Serafino, Foluso Ogunlana:
Blockchain Mining Games with Pay Forward. CoRR abs/1905.07397 (2019) - [i7]Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis, Philip Lazos, Stratis Skoulakis, Nikos Zarifis:
Reallocating Multiple Facilities on the Line. CoRR abs/1905.12379 (2019) - [i6]Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J. Marmolejo Cossío:
Fairness and Efficiency in DAG-based Cryptocurrencies. CoRR abs/1910.02059 (2019) - 2018
- [c3]Elias Koutsoupias, Philip Lazos:
Online Trading as a Secretary Problem. SAGT 2018: 201-212 - [i5]Aris Filos-Ratsikas, Yiannis Giannakopoulos
The Pareto Frontier of Inefficiency in Mechanism Design. CoRR abs/1809.03454 (2018) - [i4]Matthias Gerstgrasser, Paul W. Goldberg, Bart de Keijzer, Philip Lazos, Alexander Skopalik:
Multi-unit Bilateral Trade. CoRR abs/1811.05130 (2018) - [i3]Elias Koutsoupias, Philip Lazos:
Online Trading as a Secretary Problem. CoRR abs/1812.11149 (2018) - 2017
- [c2]Christian Coester
The Infinite Server Problem. ICALP 2017: 14:1-14:14 - [c1]Yiannis Giannakopoulos
Online Market Intermediation. ICALP 2017: 47:1-47:14 - [i2]Christian Coester, Elias Koutsoupias, Philip Lazos:
The Infinite Server Problem. CoRR abs/1702.08474 (2017) - [i1]Yiannis Giannakopoulos, Elias Koutsoupias, Philip Lazos:
Online Market Intermediation. CoRR abs/1703.09279 (2017)
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-18 00:17 CEST 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: