Research
Working papers
[W10] Fair and Efficient Online Allocations. (pdf)
Gerdus Benadè, Aleksandr M. Kazachkov, Ariel D. Procaccia, Alexandros Psomas, David Zeng.
Minor revision in Operations Research (OR), Feb. 2023.
[W9] Dynamic Fair Division with Partial Information.
Gerdus Benadè, Daniel Halpern, Alexandros Psomas.
Under submission in Management Science (MS), Sept. 2023.
[W8] Algorithmic Persuasion with Evidence.
Martin Hoefer, Pasin Manurangsi, Alexandros Psomas.
Under submission in ACM Transactions on Economics and Computation (TEAC), Nov. 2022.
[W7] On the Existence of Envy-Free Allocations Beyond Additive Valuations. (arxiv)
Gerdus Benadè, Daniel Halpern, Alexandros Psomas, Paritosh Verma.
[W6] Reward Selection with Noisy Observations. (arxiv)
Kamyar Azizzadenesheli, Trung Dang, Aranyak Mehta, Alexandros Psomas, Qian Zhang.
[W5] Fairly Allocating Goods in Parallel. (arxiv)
Rohan Garg, Alexandros Psomas.
[W4] Getting More by Knowing Less: Bayesian Incentive Compatible Mechanisms for Fair Division. (arxiv)
Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan, Paritosh Verma.
[W3] Refined Mechanism Design for Approximately Structured Priors via Active Regression.
Christos Boutsikas, Petros Drineas, Marios Mertzanidis, Alexandros Psomas, Paritosh Verma.
[W2] On the Robustness of Mechanism Design under Total Variation Distance.
Anuran Makur, Marios Mertzanidis, Alexandros Psomas, Athina Terzoglou.
[W1] More is Merrier in Collusion Mitigation.
Tiantian Gong, Ryan Henry, Alexandros Psomas, Aniket Kate.
publications
[J6] On Hiring Secretaries with Stochastic Departures.
Thomas Kesselheim , Alexandros Psomas, Shai Vardi.
In Operations Research, OR 2023.
( Supersedes WINE 2019 paper )
[C34] Smoothed Analysis of Social Choice, Revisited. (arxiv)
Bailey Flanigan, Daniel Halpern, Alexandros Psomas.
In the 19th Conference on Web and Internet Economics, WINE 2023.
[C33] Collusion-Deterrent Threshold Information Escrow.
Easwar Mangipudi, Donghang Lu, Alexandros Psomas, Aniket Kate.
In the 36th IEEE Computer Security Foundations Symposium, CSF 2023.
[J5] On the Complexity of Dynamic Mechanism Design.
Christos Papadimitriou, George Pierrakos, Alexandros Psomas, Aviad Rubinstein.
In Games and Economic Behavior, GEB 2022.
Invited to the special issue devoted to the best algorithmic game theory papers from STOC/FOCS/SODA 2016-2017.
( Supersedes SODA 2016 paper )
[J4] Dynamic Fair Resource Division.
Shai Vardi, Alexandros Psomas, Eric Friedman.
In Mathematics of Operations Research, MOR 2022.
( Supersedes EC 2015 and EC 2017 papers )
[J3] Risk Robust Mechanism Design for a Prospect Theoretic Buyer.
Siqi Liu, J. Benjamin Miller, Alexandros Psomas.
In Theory of Computing Systems, TOCS 2022.
Invited to the special issue devoted to selected papers of SAGT 2019.
( Supersedes SAGT 2019 paper )
[C32] On Infinite Separations Between Simple and Optimal Mechanisms. (arxiv)
Alexandros Psomas, Ariel Schvartzman, S. Matthew Weinberg.
In the 36th Conference on Neural Information Processing Systems, NeurIPS 2022.
[C31] Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions. (arxiv)
Gagan Aggarwal, Kshipra Bhawalkar, Aranyak Mehta, Divyarthi Mohan, Alexandros Psomas.
In the 36th Conference on Neural Information Processing Systems, NeurIPS 2022.
[C30] Fair and Efficient Allocations Without Obvious Manipulations. (arxiv)
Alexandros Psomas, Paritosh Verma.
In the 36th Conference on Neural Information Processing Systems, NeurIPS 2022.
[C29] Dynamic Fair Division with Partial Information. (pdf)
Gerdus Benadè, Daniel Halpern, Alexandros Psomas.
In the 36th Conference on Neural Information Processing Systems, NeurIPS 2022.
[C28] Leakage Inversion: Towards Quantifying Privacy in Searchable Encryption.
Evgenios M. Kornaropoulos, Nathaniel Moyer, Charalampos Papamanthou, Alexandros Psomas.
In the 29th ACM Conference on Computer and Communications Security, CCS 2022.
[C27] Beyond Cake Cutting: Allocating Homogeneous Divisible Resources. (arxiv)
Ioannis Caragiannis, Vasilis Gkatzelis, Alexandros Psomas, Daniel Schoepflin.
In the International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022.
[C26] Fair and Efficient Online Allocations with Normalized Valuations. (arxiv)
Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan.
In the 35th AAAI Conference on Artificial Intelligence, AAAI 2021.
[C25] Algorithmic Persuasion with Evidence. (arxiv)
Martin Hoefer, Pasin Manurangsi, Alexandros Psomas.
In the 12th Innovations in Theoretical Computer Science, ITCS 2021.
[J2] Optimal Multi-Unit Mechanisms with Private Demands. (arXiv)
Nikhil Devanur, Nima Haghpanah, Christos Alexandros Psomas.
In Games and Economic Behavior, GEB 2020.
( Supersedes EC 2017 paper )
[C24] Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics. (arxiv)
Aranyak Mehta, Uri Nadav, Alexandros Psomas, Aviad Rubinstein.
In the 34th Conference on Neural Information Processing Systems, NeurIPS 2020 Spotlight.
[C23] Explainable Voting. (pdf)
Dominik Peters, Ariel D. Procaccia, Alexandros Psomas, Zixin Zhou.
In the 34th Conference on Neural Information Processing Systems, NeurIPS 2020.
[C22] Fair Division with Binary Valuations: One Rule to Rule Them All. (arxiv)
Daniel Halpern, Ariel D. Procaccia, Alexandros Psomas, Nisarg Shah.
In the 16th Conference on Web and Internet Economics, WINE 2020.
[C21] Fairness-Efficiency Tradeoffs in Dynamic Fair Division. (arxiv)
David Zeng, Alexandros Psomas.
In the 21st ACM Conference on Economics and Computation, EC 2020.
[J1] Reductions in PPP. (pdf)
Frank Ban, Kamal Jain, Christos Papadimitriou, Christos Alexandros Psomas, Aviad Rubinstein.
In Information Processing Letters, IPL 2019.
[C20] How to Hire Secretaries with Stochastic Departures. (arxiv)
Thomas Kesselheim, Alexandros Psomas, Shai Vardi.
In the 15th Conference on Web and Internet Economics, WINE 2019.
[C19] Persuasion and Incentives Through the Lens of Duality. (arxiv)
Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas, S. Matthew Weinberg.
In the 15th Conference on Web and Internet Economics, WINE 2019.
[C18] WeBuildAI: Participatory Framework for Fair and Efficient Algorithmic Governance. (pdf)
Min Kyung Lee, Daniel Kusbit, Anson Kahng, Ji Tae Kim, Xinran Yuan, Allissa Chan, Ritesh Noothigattu, Daniel See, Siheon Lee, Christos Alexandros Psomas, Ariel D. Procaccia.
In the 22nd ACM Conference on Computer-Supported Cooperative Work and Social Computing, CSCW 2019.
[C17] Risk Robust Mechanism Design for a Prospect Theoretic Buyer. (pdf)
J. Benjamin Miller, Siqi Liu, Alexandros Psomas.
In the 12th International Symposium on Algorithmic Game Theory, SAGT 2019.
[C16] Achieving a Fairer Future by Changing the Past. (pdf)
Jiafan He, Ariel D. Procaccia, Alexandros Psomas, David Zeng.
In the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019.
[C15] Smoothed Analysis of Multi-Item Auctions with Correlated Values. (arXiv)
Alexandros Psomas, Ariel Schvartzman, S. Matthew Weinberg.
In the 20th ACM Conference on Economics and Computation, EC 2019.
[C14] Formal Barriers to Proof-of-Stake Protocols. (arXiv)
Jonah Brown-Cohen, Arvind Narayanan, Alexandros Psomas, S. Matthew Weinberg.
In the 20th ACM Conference on Economics and Computation, EC 2019.
[C13] Statistical Foundations of Virtual Democracy. (pdf)
Anson Kahng, Min Kyung Lee, Ritesh Noothigattu, Ariel D. Procaccia, Alexandros Psomas.
In the 36th International Conference on Machine Learning, ICML 2019.
[C12] Fair and Efficient Memory Sharing: Confronting Free Riders. (pdf)
Eric Friedman, Vasilis Gkatzelis, Christos Alexandros Psomas, Scott Shenker.
In the 33rd AAAI Conference on Artificial Intelligence, AAAI 2019.
[C11] An Improved Envy-Free Cake Cutting Protocol for Four Agents. (arXiv)
Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos Alexandros Psomas, Eftychia Vakaliou.
In the 11th International Symposium on Algorithmic Game Theory, SAGT 2018.
[C10] How to Make Envy Vanish Over Time. (pdf)
Gerdus Benadè, Aleksandr M. Kazachkov, Ariel D. Procaccia, Christos Alexandros Psomas.
In the 19th ACM Conference on Economics and Computation, EC 2018.
[C9] On the Competition Complexity of Dynamic Mechanism Design. (arXiv)
Siqi Liu, Christos Alexandros Psomas.
In the 29th ACM-SIAM Symposium on Discrete Algorithms, SODA 2018.
[C8] Controlled Dynamic Fair Division. (pdf)
Eric Friedman, Christos Alexandros Psomas, Shai Vardi.
In the 18th ACM Conference on Economics and Computation, EC 2017.
[C7] Optimal Multi-Unit Mechanisms with Private Demands. (arXiv)
Nikhil Devanur, Nima Haghpanah, Christos Alexandros Psomas.
In the 18th ACM Conference on Economics and Computation, EC 2017.
[C6] Sample Complexity of Auctions with Side Information. (arXiv)
Nikhil Devanur, Zhiyi Huang, Christos Alexandros Psomas.
In the 48th ACM Symposium on Theory of Computing, STOC 2016.
[C5] On the Complexity of Dynamic Mechanism Design. (arXiv)
Christos Papadimitriou, George Pierrakos, Christos Alexandros Psomas, Aviad Rubinstein.
In the 27th ACM-SIAM Symposium on Discrete Algorithms, SODA 2016.
[C4] Dynamic Fair Division with Minimal Disruptions.
Eric Friedman, Christos Alexandros Psomas, Shai Vardi.
In the 16th ACM Conference on Economics and Computation, EC 2015.
[C3] Strategyproof Allocation of Discrete Jobs on Multiple Machines.
Eric Friedman, Ali Ghodsi, Christos Alexandros Psomas.
In the 15th ACM Conference on Economics and Computation, EC 2014.
[C2] Probabilistic Extension of Allen's Relations Using the Hourglass Model.
Sergios Petridis, Christos Alexandros Psomas.
In the 24th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2012.
[C1] On Worst-Case Allocations in the Presence of Indivisible Goods.
Vangelis Markakis, Christos Alexandros Psomas.
In the 7th Workshop of Internet Network Economics, WINE 2011.