Ioannis Caragiannis
Zitiert von
Zitiert von
The unreasonable fairness of maximum Nash welfare
I Caragiannis, D Kurokawa, H Moulin, AD Procaccia, N Shah, J Wang
ACM Transactions on Economics and Computation (TEAC) 7 (3), 1-32, 2019
Tight bounds for selfish and greedy load balancing
I Caragiannis, M Flammini, C Kaklamanis, P Kanellopoulos, L Moscardelli
Algorithmica 61 (3), 606-637, 2011
Optimal social choice functions: A utilitarian view
C Boutilier, I Caragiannis, S Haber, T Lu, AD Procaccia, O Sheffet
Artificial Intelligence 227, 190-213, 2015
Bounding the inefficiency of outcomes in generalized second price auctions
I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou, B Lucier, ...
Journal of Economic Theory 156, 343-388, 2015
When do noisy votes reveal the truth?
I Caragiannis, AD Procaccia, N Shah
ACM Transactions on Economics and Computation (TEAC) 4 (3), 1-30, 2016
The efficiency of fair division
I Caragiannis, C Kaklamanis, P Kanellopoulos, M Kyropoulou
Theory of Computing Systems 50 (4), 589-610, 2012
Voting almost maximizes social welfare despite limited communication
I Caragiannis, AD Procaccia
Artificial Intelligence 175 (9-10), 1655-1671, 2011
Geometric clustering to minimize the sum of cluster sizes
V Bilo, I Caragiannis, C Kaklamanis, P Kanellopoulos
European Symposium on Algorithms, 460-471, 2005
How bad is selfish voting?
S Brânzei, I Caragiannis, J Morgenstern, A Procaccia
Proceedings of the AAAI conference on artificial intelligence 27 (1), 2013
Efficient coordination mechanisms for unrelated machine scheduling
I Caragiannis
Algorithmica 66 (3), 512-540, 2013
On the approximability of Dodgson and Young elections
I Caragiannis, JA Covey, M Feldman, CM Homan, C Kaklamanis, ...
Artificial Intelligence 187, 31-51, 2012
Subset selection via implicit utilitarian voting
I Caragiannis, S Nath, AD Procaccia, N Shah
Journal of Artificial Intelligence Research 58, 123-152, 2017
Communication in wireless networks with directional antennas
I Caragiannis, C Kaklamanis, E Kranakis, D Krizanc, A Wiese
Proceedings of the twentieth annual symposium on Parallelism in algorithms …, 2008
Taxes for linear atomic congestion games
I Caragiannis, C Kaklamanis, P Kanellopoulos
ACM Transactions on Algorithms (TALG) 7 (1), 13, 2010
Energy-efficient wireless network design
I Caragiannis, C Kaklamanis, P Kanellopoulos
Theory of Computing Systems 39 (5), 593-617, 2006
Socially desirable approximations for Dodgson’s voting rule
I Caragiannis, C Kaklamanis, N Karanikolas, AD Procaccia
ACM Transactions on Algorithms (TALG) 10 (2), 1-28, 2014
Efficient computation of approximate pure Nash equilibria in congestion games
I Caragiannis, A Fanelli, N Gravin, A Skopalik
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 532-541, 2011
New bounds on the size of the minimum feedback vertex set in meshes and butterflies
I Caragiannis, C Kaklamanis, P Kanellopoulos
Information Processing Letters 83 (5), 275-280, 2002
Towards more expressive cake cutting
I Caragiannis, JK Lai, AD Procaccia
IJCAI proceedings-international joint conference on artificial intelligence …, 2011
Better bounds for online load balancing on unrelated machines
I Caragiannis
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20