Georgios Birmpas
Georgios Birmpas
Sapienza University of Rome
Verified email at aueb.gr - Homepage
Title
Cited by
Cited by
Year
Comparing approximate relaxations of envy-freeness
G Amanatidis, G Birmpas, E Markakis
arXiv preprint arXiv:1806.03114, 2018
382018
Truthful allocation mechanisms without payments: Characterization and implications on fairness
G Amanatidis, G Birmpas, G Christodoulou, E Markakis
Proceedings of the 2017 ACM Conference on Economics and Computation, 545-562, 2017
372017
On truthful mechanisms for maximin share allocations
G Amanatidis, G Birmpas, E Markakis
arXiv preprint arXiv:1605.04026, 2016
362016
Maximum Nash welfare and other stories about EFX
G Amanatidis, G Birmpas, A Filos-Ratsikas, A Hollender, AA Voudouris
Theoretical Computer Science 863, 69-85, 2021
302021
Peeking behind the ordinal curtain: Improving distortion via cardinal queries
G Amanatidis, G Birmpas, A Filos-Ratsikas, AA Voudouris
Artificial Intelligence 296, 103488, 2021
192021
Coverage, matching, and beyond: New results on budgeted mechanism design
G Amanatidis, G Birmpas, E Markakis
International Conference on Web and Internet Economics, 414-428, 2016
162016
On budget-feasible mechanism design for symmetric submodular objectives
G Amanatidis, G Birmpas, E Markakis
International Conference on Web and Internet Economics, 1-15, 2017
102017
Fairness and efficiency in dag-based cryptocurrencies
G Birmpas, E Koutsoupias, P Lazos, FJ Marmolejo-Cossío
International Conference on Financial Cryptography and Data Security, 79-96, 2020
82020
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
G Amanatidis, G Birmpas, A Filos-Ratsikas, AA Voudouris
Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI …, 2021
42021
Tight welfare guarantees for pure nash equilibria of the uniform price auction
G Birmpas, E Markakis, O Telelis, A Tsikiridis
Theory of Computing Systems 63 (7), 1451-1469, 2019
32019
Cost-sharing models in participatory sensing
G Birmpas, C Courcoubetis, I Giotis, E Markakis
International Symposium on Algorithmic Game Theory, 43-56, 2015
22015
Optimally Deceiving a Learning Leader in Stackelberg Games
G Birmpas, J Gan, A Hollender, FJ Marmolejo-Cossío, N Rajgopal, ...
arXiv preprint arXiv:2006.06566, 2020
12020
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
G Amanatidis, G Birmpas, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser
arXiv preprint arXiv:2109.08644, 2021
2021
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
G Amanatidis, G Birmpas, E Markakis
Information Processing Letters 163, 106010, 2020
2020
Cost sharing over combinatorial domains: Complement-free cost functions and beyond
G Birmpas, E Markakis, G Schäfer
arXiv preprint arXiv:1910.06384, 2019
2019
Generalized Second-Price Auctions under Advertisement Settings
GD Birbas
2013
Χώρος Urysohn
GD Birbas
2011
The system can't perform the operation now. Try again later.
Articles 1–17