Edith Elkind

Edith Elkind, James B. Orlin: On the hardness of finding subsets with equal average. Inf. Process. Lett. 113(13): 477-480 (2013)

Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind: Manipulating the quota in weighted voting games. Artif. Intell. 180-181: 1-19 (2012)

Georgios Chalkiadakis, Edith Elkind, Michael Wooldridge: Cooperative Game Theory: Basic Concepts and Computational Challenges. IEEE Intelligent Systems 27(3): 86-90 (2012)

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Rationalizations of Condorcet-consistent rules via distances of hamming type. Social Choice and Welfare 39(4): 891-905 (2012)

Svetlana Obraztsova, Edith Elkind: Optimal Manipulation of Voting Rules. AAAI 2012

Yair Zick, Evangelos Markakis, Edith Elkind: Stability Via Convexity and LP Duality in OCF Games. AAAI 2012

Svetlana Obraztsova, Edith Elkind: Optimal manipulation of voting rules. AAMAS 2012: 619-626

Edith Elkind, Gábor Erdélyi: Manipulation under voting rule uncertainty. AAMAS 2012: 627-634

Yair Zick, Georgios Chalkiadakis, Edith Elkind: Overlapping coalition formation games: charting the tractability frontier. AAMAS 2012: 787-794

Ioannis Caragiannis, Edith Elkind, Mario Szegedy, Lan Yu: Mechanism design: from partial to probabilistic verification. ACM Conference on Electronic Commerce 2012: 266-283

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Clone structures in voters' preferences. ACM Conference on Electronic Commerce 2012: 496-513

Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger: Group Activity Selection Problem. WINE 2012: 156-169

Edith Elkind, Christian Klamler, Jeffrey S. Rosenschein, M. Remzi Sanver: Computation and Incentives in Social Choice (Dagstuhl Seminar 12101). Dagstuhl Reports 2(3): 1-22 (2012)

Georgios Chalkiadakis, Edith Elkind, Michael Wooldridge: Computational Aspects of Cooperative Game Theory. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2011

Edith Elkind, Jérôme Lang: Guest editorial: special issue on computational social choice. Autonomous Agents and Multi-Agent Systems 22(1): 1-3 (2011)

Haris Aziz, Yoram Bachrach, Edith Elkind, Mike Paterson: False-Name Manipulations in Weighted Voting Games. J. Artif. Intell. Res. (JAIR) 40: 57-93 (2011)

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Cloning in Elections: Finding the Possible Winners. J. Artif. Intell. Res. (JAIR) 42: 529-573 (2011)

Talal Rahwan, Tomasz P. Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael Wooldridge, Nicholas R. Jennings: Constrained Coalition Formation. AAAI 2011

Ildikó Schlotter, Piotr Faliszewski, Edith Elkind: Campaign Management under Approval-Driven Voting Rules. AAAI 2011

Yair Zick, Edith Elkind: Arbitrators in overlapping coalition formation games. AAMAS 2011: 55-62

Svetlana Obraztsova, Edith Elkind, Noam Hazon: Ties matter: complexity of voting manipulation revisited. AAMAS 2011: 71-78

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Homogeneity and monotonicity of distance-rationalizable voting rules. AAMAS 2011: 821-828

John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev: Dynamics of Profit-Sharing Games. IJCAI 2011: 37-42

Yoram Bachrach, Edith Elkind, Piotr Faliszewski: Coalitional Voting Manipulation: A Game-Theoretic Perspective. IJCAI 2011: 49-54

Edith Elkind, Jérôme Lang, Abdallah Saffidine: Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion. IJCAI 2011: 186-191

Egor Ianovski, Lan Yu, Edith Elkind, Mark C. Wilson: The Complexity of Safe Manipulation under Scoring Rules. IJCAI 2011: 246-251

Svetlana Obraztsova, Edith Elkind: On the Complexity of Voting Manipulation under Randomized Tie-Breaking. IJCAI 2011: 319-324

Yair Zick, Alexander Skopalik, Edith Elkind: The Shapley Value as a Function of the Quota in Weighted Voting Games. IJCAI 2011: 490-496

Svetlana Obraztsova, Edith Elkind, Noam Hazon: Ties Matter: Complexity of Voting Manipulation Revisited. IJCAI 2011: 2698-2703

Ning Chen, Edith Elkind, Elias Koutsoupias (Eds.): Internet and Network Economics - 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011. Proceedings. Lecture Notes in Computer Science 7090, Springer 2011, isbn 978-3-642-25509-0

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Clone Structures in Voters' Preferences. CoRR abs/1110.3939 (2011)

Edith Elkind, Kevin Leyton-Brown: Algorithmic Game Theory and Artificial Intelligence. AI Magazine 31(4): 9-12 (2010)

Edith Elkind, Blaise Genest, Doron Peled, Paola Spoletini: Quantifying the Discord: Order Discrepancies in Message Sequence Charts. Int. J. Found. Comput. Sci. 21(2): 211-233 (2010)

Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis, Maria Polukarov, Nick R. Jennings: Cooperative Games with Overlapping Coalitions. J. Artif. Intell. Res. (JAIR) 39: 179-216 (2010)

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Cloning in Elections. AAAI 2010

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Good Rationalizations of Voting Rules. AAAI 2010

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: On the role of distances in defining voting rules. AAMAS 2010: 375-382

Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov: Frugal Mechanism Design via Spectral Techniques. FOCS 2010: 755-764

Noam Hazon, Edith Elkind: Complexity of Safe Strategic Voting. SAGT 2010: 210-221

Yvo Desmedt, Edith Elkind: Equilibria of plurality voting with abstentions. ACM Conference on Electronic Commerce 2010: 347-356

Edith Elkind, Piotr Faliszewski: Approximation Algorithms for Campaign Management. WINE 2010: 473-482

Yvo Desmedt, Edith Elkind: Equilibria of Plurality Voting with Abstentions. CoRR abs/1001.4939 (2010)

Edith Elkind, Piotr Faliszewski: Approximation Algorithms for Campaign Management. CoRR abs/1004.0334 (2010)

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type. CoRR abs/1009.0300 (2010)

John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev: Dynamics of Profit-Sharing Games. CoRR abs/1010.5081 (2010)

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: On the computational complexity of weighted voting games. Ann. Math. Artif. Intell. 56(2): 109-131 (2009)

Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled: On commutativity based Edge Lean search. Ann. Math. Artif. Intell. 56(2): 187-210 (2009)

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications. Math. Log. Q. 55(4): 362-376 (2009)

Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis, Maria Polukarov, Nicholas R. Jennings: Stability of overlapping coalitions. SIGecom Exchanges 8(1) (2009)

Piotr Faliszewski, Edith Elkind, Michael Wooldridge: Boolean combinations of weighted voting games. AAMAS (1) 2009: 185-192

Georgios Chalkiadakis, Edith Elkind, Maria Polukarov, Nicholas R. Jennings: The price of democracy in coalition formation. AAMAS (1) 2009: 401-408

Edith Elkind, Michael Wooldridge: Hedonic coalition nets. AAMAS (1) 2009: 417-424

Edith Elkind: Voting: A View through the Algorithmic Lens. EC-Web 2009: 1

Georgios Chalkiadakis, Edith Elkind, Nicholas R. Jennings: Simple Coalitional Games with Beliefs. IJCAI 2009: 85-90

Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein: The Cost of Stability in Coalitional Games. SAGT 2009: 122-134

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Swap Bribery. SAGT 2009: 299-310

Edith Elkind, Dmitrii V. Pasechnik: Computing the nucleolus of weighted voting games. SODA 2009: 327-335

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: On distance rationalizability of some voting rules. TARK 2009: 108-117

Ning Chen, Edith Elkind, Nick Gravin: Refining the Cost of Cheap Labor in Set System Auctions. WINE 2009: 447-454

Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Swap Bribery. CoRR abs/0905.3885 (2009)

Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein: The Cost of Stability in Coalitional Games. CoRR abs/0907.4385 (2009)

Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov: Frugal Mechanism Design via Spectral Techniques. CoRR abs/0912.3403 (2009)

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: On the Dimensionality of Voting Games. AAAI 2008: 69-74

Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind: Manipulating the Quota in Weighted Voting Games. AAAI 2008: 215-220

Yoram Bachrach, Edith Elkind: Divide and conquer: false-name manipulations in weighted voting games. AAMAS (2) 2008: 975-982

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: A tractable and expressive class of marginal contribution nets and its applications. AAMAS (2) 2008: 1007-1014

Enrico H. Gerding, Zinovi Rabinovich, Andrew Byde, Edith Elkind, Nicholas R. Jennings: Approximating mixed Nash equilibria using smooth fictitious play in simultaneous auctions. AAMAS (3) 2008: 1577-1580

Edith Elkind, Georgios Chalkiadakis, Nicholas R. Jennings: Coalition Structures in Weighted Voting Games. ECAI 2008: 393-397

Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis, Nicholas R. Jennings: Overlapping Coalition Formation. WINE 2008: 307-321

Edith Elkind, Dmitrii V. Pasechnik: Computing the nucleolus of weighted voting games. CoRR abs/0808.0298 (2008)

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: Computational Complexity of Weighted Threshold Games. AAAI 2007: 718-723

Edith Elkind, Blaise Genest, Doron Peled, Paola Spoletini: Quantifying the Discord: Order Discrepancies in Message Sequence Charts. ATVA 2007: 378-393

Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled: On Commutativity Based Edge Lean Search. ICALP 2007: 158-170

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing good nash equilibria in graphical games. ACM Conference on Electronic Commerce 2007: 162-171

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Frugality ratios and improved truthful mechanisms for vertex cover. ACM Conference on Electronic Commerce 2007: 336-345

Edith Elkind: Designing and learning optimal finite support auctions. SODA 2007: 736-745

Edith Elkind, Blaise Genest, Doron Peled: Detecting Races in Ensembles of Message Sequence Charts. TACAS 2007: 420-434

Edith Elkind, S. Shaheen Fatima: Maximizing Revenue in Sequential Auctions. WINE 2007: 491-502

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing Good Nash Equilibria in Graphical Games. CoRR abs/cs/0703133 (2007)

Edith Elkind, Blaise Genest, Doron Peled, Hongyang Qu: Grey-Box Checking. FORTE 2006: 420-435

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash equilibria in graphical games on trees revisited. ACM Conference on Electronic Commerce 2006: 100-109

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Frugality ratios and improved truthful mechanisms for vertex cover. CoRR abs/cs/0606044 (2006)

Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash Equilibria in Graphical Games on Trees Revisited. Electronic Colloquium on Computational Complexity (ECCC)(005) (2006)

Edith Elkind, Helger Lipmaa: Small Coalitions Cannot Manipulate Voting. Financial Cryptography 2005: 285-297

Edith Elkind, Helger Lipmaa: Hybrid Voting Protocols and Hardness of Manipulation. ISAAC 2005: 206-215

Edith Elkind: True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs. ACM Conference on Electronic Commerce 2005: 108-116

Edith Elkind, Helger Lipmaa: Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. Financial Cryptography 2004: 117-131

Edith Elkind, Amit Sahai, Kenneth Steiglitz: Frugality in path auctions. SODA 2004: 701-709

Edith Elkind, Helger Lipmaa: Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. IACR Cryptology ePrint Archive 2003: 21 (2003)

Edith Elkind, Amit Sahai: A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack. IACR Cryptology ePrint Archive 2002: 42 (2002)