Philip Lazos

Orcid: 0000-0001-9684-7609

Affiliations:
  • Input Output
  • Sapienza Università di Roma, Italy (former)


According to our database1, Philip Lazos authored at least 28 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Single-token vs Two-token Blockchain Tokenomics.
CoRR, 2024

Algorithmically Fair Maximization of Multiple Submodular Objective Functions.
CoRR, 2024

2023
On the Complexity of Equilibrium Computation in First-Price Auctions.
SIAM J. Comput., February, 2023

Pandora's Box Problem with Order Constraints.
Math. Oper. Res., February, 2023

On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes.
CoRR, 2023

Would Friedman Burn your Tokens?
CoRR, 2023

Tiered Mechanisms for Blockchain Transaction Fees.
CoRR, 2023

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
The Pareto Frontier of Inefficiency in Mechanism Design.
Math. Oper. Res., 2022

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint.
J. Artif. Intell. Res., 2022

Decentralised Update Selection with Semi-Strategic Experts.
CoRR, 2022

Single-Sample Prophet Inequalities via Greedy-Ordered Selection.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Decentralized Update Selection with Semi-strategic Experts.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

SoK: Blockchain Governance.
Proceedings of the 4th ACM Conference on Advances in Financial Technologies, 2022

Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria.
Proceedings of the 4th ACM Conference on Advances in Financial Technologies, 2022

2021
Reallocating multiple facilities on the line.
Theor. Comput. Sci., 2021

The Infinite Server Problem.
ACM Trans. Algorithms, 2021

Prophet Inequalities for Matching with a Single Sample.
CoRR, 2021

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Efficient two-sided markets with limited information.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.
Proceedings of the 38th International Conference on Machine Learning, 2021

Optimal Testing and Containment Strategies for Universities in Mexico amid COVID-19✱.
Proceedings of the EAAMO 2021: ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization, Virtual Event, USA, October 5, 2021

RPPLNS: Pay-per-last-N-shares with a Randomised Twist.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Fairness and Efficiency in DAG-Based Cryptocurrencies.
Proceedings of the Financial Cryptography and Data Security, 2020

2019
Blockchain Mining Games with Pay Forward.
Proceedings of the World Wide Web Conference, 2019

Multi-Unit Bilateral Trade.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Online Trading as a Secretary Problem.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017
Online Market Intermediation.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017


  Loading...