Research outputs
2026
Fair division with interdependent values
Birmpas, G., Ezra, T., Leonardi, S., & Russo, M. (2026). Fair division with interdependent values. Theoretical Computer Science, 1076. doi:10.1016/j.tcs.2026.115969
Reward Schemes and Committee Sizes in Proof of Stake Governance
Birmpas, G., Lazos, P., Markakis, E., & Penna, P. (2026). Reward Schemes and Committee Sizes in Proof of Stake Governance. In Unknown Conference (pp. 191-207). Springer Nature Switzerland. doi:10.1007/978-3-032-07035-7_12
2025
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria
Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S., & Reiffenhauser, R. (2025). Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. MATHEMATICS OF OPERATIONS RESEARCH, 50(4). doi:10.1287/moor.2023.0244
Algorithmically Fair Maximization of Multiple Submodular Objective Functions
Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2025). Algorithmically Fair Maximization of Multiple Submodular Objective Functions. In International Joint Conference on Autonomous Agents and Multiagent Systems (pp. 115-123). IEEE Computer Society. doi:10.65109/sjjc6055
2024
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S., & Reiffenhauser, R. (2024). Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. MATHEMATICS OF OPERATIONS RESEARCH, 49(4), 2425-2445. doi:10.1287/moor.2022.0058
Reward Schemes and Committee Sizes in Proof of Stake Governance
DON'T ROLL THE DICE, ASK TWICE: THE TWO-QUERY DISTORTION OF MATCHING PROBLEMS AND BEYOND
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2024). DON'T ROLL THE DICE, ASK TWICE: THE TWO-QUERY DISTORTION OF MATCHING PROBLEMS AND BEYOND. SIAM JOURNAL ON DISCRETE MATHEMATICS, 38(1), 1007-1029. doi:10.1137/23M1545677
Fair Division with Interdependent Values
Birmpas, G., Ezra, T., Leonardi, S., & Russo, M. (2024). Fair Division with Interdependent Values. In ALGORITHMIC GAME THEORY, SAGT 2024 Vol. 15156 (pp. 72-88). doi:10.1007/978-3-031-71033-9_5
2023
Fair division of indivisible goods: Recent progress and open questions
Amanatidis, G., Aziz, H., Birmpas, G., Filos-Ratsikas, A., Li, B., Moulin, H., . . . Wu, X. (2023). Fair division of indivisible goods: Recent progress and open questions. ARTIFICIAL INTELLIGENCE, 322. doi:10.1016/j.artint.2023.103965
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria
Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2023). Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. In EC 2023 Proceedings of the 24th ACM Conference on Economics and Computation (pp. 67-87). doi:10.1145/3580507.3597796
Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria
Birmpas, G., Kovalchuk, L., Lazos, P., & Oliynykov, R. (2022). Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria. In PROCEEDINGS OF THE 2022 4TH ACM CONFERENCE ON ADVANCES IN FINANCIAL TECHNOLOGIES, AFT 2022 (pp. 268-280). doi:10.1145/3558535.3559776
2022
Cost Sharing over Combinatorial Domains
Birmpas, G., Markakis, E., & Schaefer, G. (2022). Cost Sharing over Combinatorial Domains. ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION, 10(1). doi:10.1145/3505586
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2022). A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 74, 227-261. Retrieved from https://www.webofscience.com/
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S., & Reiffenhauser, R. (2022). Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. In WEB AND INTERNET ECONOMICS, WINE 2021 Vol. 13112 (pp. 149-166). doi:10.1007/978-3-030-94676-0_9
Decentralized Update Selection with Semi-strategic Experts
Amanatidis, G., Birmpas, G., Lazos, P., & Marmolejo-Cossio, F. (2022). Decentralized Update Selection with Semi-strategic Experts. In ALGORITHMIC GAME THEORY, SAGT 2022 Vol. 13584 (pp. 403-420). doi:10.1007/978-3-031-15714-1_23
Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. (2022). Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond. In Advances in Neural Information Processing Systems 35 (pp. 30665-30677). Neural Information Processing Systems Foundation, Inc. (NeurIPS). doi:10.52202/068431-2223
Fair Division of Indivisible Goods: A Survey
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2022). Fair Division of Indivisible Goods: A Survey. In PROCEEDINGS OF THE THIRTY-FIRST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2022 (pp. 5385-5393). Retrieved from https://www.webofscience.com/
Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective
Birmpas, G., Celli, A., Colini-Baldeschi, R., & Leonardi, S. (2022). Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective. In PROCEEDINGS OF THE THIRTY-FIRST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2022 (pp. 95-101). Retrieved from https://www.webofscience.com/
2021
Peeking behind the ordinal curtain: Improving distortion via cardinal queries.
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2021). Peeking behind the ordinal curtain: Improving distortion via cardinal queries.. In Artif. Intell. Vol. 296 (pp. 103488).
Peeking behind the ordinal curtain: Improving distortion via cardinal queries.
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2021). Peeking behind the ordinal curtain: Improving distortion via cardinal queries.. Artif. Intell., 296, 103488.
Maximum Nash welfare and other stories about EFX
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., & Voudouris, A. A. (2021). Maximum Nash welfare and other stories about EFX. Theoretical Computer Science, 863, 69-85. doi:10.1016/j.tcs.2021.02.020
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2021). A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. In THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE Vol. 35 (pp. 5078-5085). Retrieved from https://www.webofscience.com/
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2022). A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. In Journal of Artificial Intelligence Research Vol. 74. AI Access Foundation. doi:10.1613/jair.1.12690
Optimally Deceiving a Learning Leader in Stackelberg Games
Birmpas, G., Gan, J., Hollender, A., Marmolejo-Cossio, F. J., Rajgopal, N., & Voudouris, A. A. (2021). Optimally Deceiving a Learning Leader in Stackelberg Games. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 72, 507-531. Retrieved from https://www.webofscience.com/
2020
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
Amanatidis, G., Birmpas, G., & Markakis, E. (2020). A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint. INFORMATION PROCESSING LETTERS, 163. doi:10.1016/j.ipl.2020.106010
Fairness and Efficiency in DAG-Based Cryptocurrencies
Birmpas, G., Koutsoupias, E., Lazos, P., & Marmolejo-Cossio, F. J. (2020). Fairness and Efficiency in DAG-Based Cryptocurrencies. In FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2020 Vol. 12059 (pp. 79-96). doi:10.1007/978-3-030-51280-4_6
Maximum Nash Welfare and Other Stories About EFX
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., & Voudouris, A. A. (2020). Maximum Nash Welfare and Other Stories About EFX. In PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (pp. 24-30). Retrieved from https://www.webofscience.com/
Maximum Nash Welfare and Other Stories About EFX.
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., & Voudouris, A. A. (2020). Maximum Nash Welfare and Other Stories About EFX.. In C. Bessiere (Ed.), IJCAI (pp. 24-30). ijcai.org. Retrieved from https://www.ijcai.org/Proceedings/2020/
Optimally deceiving a learning leader in stackelberg games
Birmpas, G., Gan, J., Hollender, A., Marmolejo-Cossío, F. J., Rajgopal, N., & Voudouris, A. A. (2020). Optimally deceiving a learning leader in stackelberg games. In Advances in Neural Information Processing Systems Vol. 2020-December.
Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2020). Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries. In THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE Vol. 34 (pp. 1782-1789). Retrieved from https://www.webofscience.com/
2019
Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction
Birmpas, G., Markakis, E., Telelis, O., & Tsikiridis, A. (2019). Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction. THEORY OF COMPUTING SYSTEMS, 63(7), 1451-1469. doi:10.1007/s00224-018-9889-7
Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond
Birmpas, G., Markakis, E., & Schafer, G. (2019). Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond. In 27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019) Vol. 144. doi:10.4230/LIPIcs.ESA.2019.20
2018
Comparing Approximate Relaxations of Envy-Freeness
Amanatidis, G., Birmpas, G., & Markakis, E. (2018). Comparing Approximate Relaxations of Envy-Freeness. In PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (pp. 42-48). Retrieved from https://www.webofscience.com/
2017
Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness
Amanatidis, G., Birmpas, G., Christodoulou, G., & Markakis, E. (2017). Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness. In EC'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON ECONOMICS AND COMPUTATION (pp. 545-562). doi:10.1145/3033274.3085147
On budget-feasible mechanism design for symmetric submodular objectives
Amanatidis, G., Birmpas, G., & Markakis, E. (2017). On budget-feasible mechanism design for symmetric submodular objectives. In Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics Vol. 10660 LNCS (pp. 1-15). doi:10.1007/978-3-319-71924-5_1
Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction
Birmpas, G., Markakis, E., Telelis, O., & Tsikiridis, A. (2017). Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction. In ALGORITHMIC GAME THEORY (SAGT 2017) Vol. 10504 (pp. 16-28). doi:10.1007/978-3-319-66700-3_2
2016
Coverage, matching, and beyond: New results on budgeted mechanism design
Amanatidis, G., Birmpas, G., & Markakis, E. (2016). Coverage, matching, and beyond: New results on budgeted mechanism design. In Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics Vol. 10123 LNCS (pp. 414-428). doi:10.1007/978-3-662-54110-4_29
On truthful mechanisms for maximin share allocations
Amanatidis, G., Birmpas, G., & Markakis, E. (2016). On truthful mechanisms for maximin share allocations. In Ijcai International Joint Conference on Artificial Intelligence Vol. 2016-January (pp. 31-37).
2015
Cost-Sharing Models in Participatory Sensing
Birmpas, G., Courcoubetis, C., Giotis, I., & Markakis, E. (2015). Cost-Sharing Models in Participatory Sensing. In ALGORITHMIC GAME THEORY, SAGT 2015 Vol. 9347 (pp. 43-56). doi:10.1007/978-3-662-48433-3_4