Georgios Birmpas

Orcid: 0000-0003-4733-7885

According to our database1, Georgios Birmpas authored at least 29 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond.
SIAM J. Discret. Math., March, 2024

Reward Schemes and Committee Sizes in Proof of Stake Governance.
CoRR, 2024

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

Fair Division with Interdependent Values.
Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

2023
Fair division of indivisible goods: Recent progress and open questions.
Artif. Intell., September, 2023

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

2022
Cost Sharing over Combinatorial Domains.
ACM Trans. Economics and Comput., 2022

A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching.
J. Artif. Intell. Res., 2022

Fair Division of Indivisible Goods: A Survey.
CoRR, 2022

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

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

Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Fair Division of Indivisible Goods: A Survey.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

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

2021
Maximum Nash welfare and other stories about EFX.
Theor. Comput. Sci., 2021

Optimally Deceiving a Learning Leader in Stackelberg Games.
J. Artif. Intell. Res., 2021

Peeking behind the ordinal curtain: Improving distortion via cardinal queries.
Artif. Intell., 2021

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

2020
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint.
Inf. Process. Lett., 2020

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

2019
Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction.
Theory Comput. Syst., 2019

Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Mechanism design for resource allocation problems: algorithms and impossibility results
PhD thesis, 2018

Comparing Approximate Relaxations of Envy-Freeness.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

On Truthful Mechanisms for Maximin Share Allocations.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Cost-Sharing Models in Participatory Sensing.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015


  Loading...