Research outputs
2026
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., & Reiffenhäuser, R. (2025). Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. Mathematics of Operations Research, 50(4), 2717-2737. 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., & Reiffenhäuser, 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
Algorithmically Fair Maximization of Multiple Submodular Objective Functions
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 Unknown Conference (pp. 72-88). Springer Nature Switzerland. 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, 103965. 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 Proceedings of the 24th ACM Conference on Economics and Computation (pp. 67-87). ACM. 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 4th ACM Conference on Advances in Financial Technologies (pp. 268-280). ACM. doi:10.1145/3558535.3559776
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria
2022
Fair Division of Indivisible Goods: Recent Progress and Open Questions
Decentralised Update Selection with Semi-Strategic Experts
Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond
Cost Sharing over Combinatorial Domains
Birmpas, G., Markakis, E., & Schäfer, G. (2022). Cost Sharing over Combinatorial Domains. ACM Transactions on Economics and Computation, 10(1), 1-26. doi:10.1145/3505586
Fair Division of Indivisible Goods: A Survey
Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria
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. doi:10.1613/jair.1.12690
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2022). Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. In Unknown Conference (pp. 149-166). Springer International Publishing. doi:10.1007/978-3-030-94676-0_9
Decentralized Update Selection with Semi-strategic Experts
Amanatidis, G., Birmpas, G., Lazos, P., & Marmolejo-Cossío, F. (2022). Decentralized Update Selection with Semi-strategic Experts. In Unknown Conference (pp. 403-420). Springer International Publishing. 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 (pp. 5385-5393). International Joint Conferences on Artificial Intelligence Organization. doi:10.24963/ijcai.2022/756
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 (pp. 95-101). International Joint Conferences on Artificial Intelligence Organization. doi:10.24963/ijcai.2022/14
2021
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective
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. (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
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 Proceedings of the AAAI Conference on Artificial Intelligence Vol. 35 (pp. 5078-5085). Association for the Advancement of Artificial Intelligence (AAAI). doi:10.1609/aaai.v35i6.16642
Optimally Deceiving a Learning Leader in Stackelberg Games
Birmpas, G., Gan, J., Hollender, A., Marmolejo-Cossío, F. J., Rajgopal, N., & Voudouris, A. A. (2021). Optimally Deceiving a Learning Leader in Stackelberg Games. Journal of Artificial Intelligence Research, 72, 507-531. doi:10.1613/jair.1.12542
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, 106010. doi:10.1016/j.ipl.2020.106010
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
Optimally Deceiving a Learning Leader in Stackelberg Games
Maximum Nash Welfare and Other Stories About EFX
Fairness and Efficiency in DAG-Based Cryptocurrencies
Birmpas, G., Koutsoupias, E., Lazos, P., & Marmolejo-Cossío, F. J. (2020). Fairness and Efficiency in DAG-Based Cryptocurrencies. In Unknown Conference (pp. 79-96). Springer International Publishing. 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). International Joint Conferences on Artificial Intelligence Organization. doi:10.24963/ijcai.2020/4
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. (2020). Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries. In Proceedings of the AAAI Conference on Artificial Intelligence Vol. 34 (pp. 1782-1789). Association for the Advancement of Artificial Intelligence (AAAI). doi:10.1609/aaai.v34i02.5544
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
Fairness and Efficiency in DAG-based Cryptocurrencies
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
Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries
2018
Comparing Approximate Relaxations of Envy-Freeness
Comparing Approximate Relaxations of Envy-Freeness
Amanatidis, G., Birmpas, G., & Markakis, V. (2018). Comparing Approximate Relaxations of Envy-Freeness. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (pp. 42-48). International Joint Conferences on Artificial Intelligence Organization. doi:10.24963/ijcai.2018/6
2017
Truthful Allocation Mechanisms Without Payments
Amanatidis, G., Birmpas, G., Christodoulou, G., & Markakis, E. (2017). Truthful Allocation Mechanisms Without Payments. In Proceedings of the 2017 ACM Conference on Economics and Computation (pp. 545-562). ACM. doi:10.1145/3033274.3085147
Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness
On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives
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 Unknown Conference (pp. 1-15). Springer International Publishing. 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 Unknown Conference (pp. 16-28). Springer International Publishing. doi:10.1007/978-3-319-66700-3_2
2016
Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design
On Truthful Mechanisms for Maximin Share Allocations
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 Unknown Conference (pp. 414-428). Springer Berlin Heidelberg. 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 Unknown Conference (pp. 43-56). Springer Berlin Heidelberg. doi:10.1007/978-3-662-48433-3_4