![]() | ![]() |
| 2012 | ||
|---|---|---|
| 78 | Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind: Manipulating the quota in weighted voting games. Artif. Intell. 180-181: 1-19 (2012) | |
| 2011 | ||
| 77 | Georgios Chalkiadakis, Edith Elkind, Michael Wooldridge: Computational Aspects of Cooperative Game Theory Morgan & Claypool Publishers 2011 | |
| 76 | Ning Chen, Edith Elkind, Elias Koutsoupias: Internet and Network Economics - 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011. Proceedings Springer 2011 | |
| 75 | Ildikó Schlotter, Piotr Faliszewski, Edith Elkind: Campaign Management under Approval-Driven Voting Rules. AAAI 2011 | |
| 74 | Talal Rahwan, Tomasz P. Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael Wooldridge, Nicholas R. Jennings: Constrained Coalition Formation. AAAI 2011 | |
| 73 | Yair Zick, Edith Elkind: Arbitrators in overlapping coalition formation games. AAMAS 2011: 55-62 | |
| 72 | Svetlana Obraztsova, Edith Elkind, Noam Hazon: Ties matter: complexity of voting manipulation revisited. AAMAS 2011: 71-78 | |
| 71 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Homogeneity and monotonicity of distance-rationalizable voting rules. AAMAS 2011: 821-828 | |
| 70 | Edith Elkind, Jérôme Lang, Abdallah Saffidine: Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion. IJCAI 2011: 186-191 | |
| 69 | Egor Ianovski, Lan Yu, Edith Elkind, Mark C. Wilson: The Complexity of Safe Manipulation under Scoring Rules. IJCAI 2011: 246-251 | |
| 68 | Svetlana Obraztsova, Edith Elkind, Noam Hazon: Ties Matter: Complexity of Voting Manipulation Revisited. IJCAI 2011: 2698-2703 | |
| 67 | Svetlana Obraztsova, Edith Elkind: On the Complexity of Voting Manipulation under Randomized Tie-Breaking. IJCAI 2011: 319-324 | |
| 66 | John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev: Dynamics of Profit-Sharing Games. IJCAI 2011: 37-42 | |
| 65 | Yoram Bachrach, Edith Elkind, Piotr Faliszewski: Coalitional Voting Manipulation: A Game-Theoretic Perspective. IJCAI 2011: 49-54 | |
| 64 | Yair Zick, Alexander Skopalik, Edith Elkind: The Shapley Value as a Function of the Quota in Weighted Voting Games. IJCAI 2011: 490-496 | |
| 63 | 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) | |
| 62 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Clone Structures in Voters' Preferences CoRR abs/1110.3939: (2011) | |
| 61 | Haris Aziz, Yoram Bachrach, Edith Elkind, Mike Paterson: False-Name Manipulations in Weighted Voting Games. J. Artif. Intell. Res. (JAIR) 40: 57-93 (2011) | |
| 60 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Cloning in Elections: Finding the Possible Winners. J. Artif. Intell. Res. (JAIR) 42: 529-573 (2011) | |
| 2010 | ||
| 59 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Cloning in Elections. AAAI 2010 | |
| 58 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Good Rationalizations of Voting Rules. AAAI 2010 | |
| 57 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: On the role of distances in defining voting rules. AAMAS 2010: 375-382 | |
| 56 | Yvo Desmedt, Edith Elkind: Equilibria of plurality voting with abstentions. ACM Conference on Electronic Commerce 2010: 347-356 | |
| 55 | Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov: Frugal Mechanism Design via Spectral Techniques. FOCS 2010: 755-764 | |
| 54 | Noam Hazon, Edith Elkind: Complexity of Safe Strategic Voting. SAGT 2010: 210-221 | |
| 53 | Edith Elkind, Piotr Faliszewski: Approximation Algorithms for Campaign Management. WINE 2010: 473-482 | |
| 52 | Edith Elkind, Kevin Leyton-Brown: Algorithmic Game Theory and Artificial Intelligence. AI Magazine 31(4): 9-12 (2010) | |
| 51 | Yvo Desmedt, Edith Elkind: Equilibria of Plurality Voting with Abstentions CoRR abs/1001.4939: (2010) | |
| 50 | Edith Elkind, Piotr Faliszewski: Approximation Algorithms for Campaign Management CoRR abs/1004.0334: (2010) | |
| 49 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type CoRR abs/1009.0300: (2010) | |
| 48 | John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev: Dynamics of Profit-Sharing Games CoRR abs/1010.5081: (2010) | |
| 47 | 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) | |
| 46 | 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) | |
| 2009 | ||
| 45 | Piotr Faliszewski, Edith Elkind, Michael Wooldridge: Boolean combinations of weighted voting games. AAMAS (1) 2009: 185-192 | |
| 44 | Georgios Chalkiadakis, Edith Elkind, Maria Polukarov, Nicholas R. Jennings: The price of democracy in coalition formation. AAMAS (1) 2009: 401-408 | |
| 43 | Edith Elkind, Michael Wooldridge: Hedonic coalition nets. AAMAS (1) 2009: 417-424 | |
| 42 | Edith Elkind: Voting: A View through the Algorithmic Lens. EC-Web 2009: 1 | |
| 41 | Georgios Chalkiadakis, Edith Elkind, Nicholas R. Jennings: Simple Coalitional Games with Beliefs. IJCAI 2009: 85-90 | |
| 40 | 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 | |
| 39 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Swap Bribery. SAGT 2009: 299-310 | |
| 38 | Edith Elkind, Dmitrii V. Pasechnik: Computing the nucleolus of weighted voting games. SODA 2009: 327-335 | |
| 37 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: On distance rationalizability of some voting rules. TARK 2009: 108-117 | |
| 36 | Ning Chen, Edith Elkind, Nick Gravin: Refining the Cost of Cheap Labor in Set System Auctions. WINE 2009: 447-454 | |
| 35 | 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) | |
| 34 | Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled: On commutativity based Edge Lean search. Ann. Math. Artif. Intell. 56(2): 187-210 (2009) | |
| 33 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Swap Bribery CoRR abs/0905.3885: (2009) | |
| 32 | 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) | |
| 31 | Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov: Frugal Mechanism Design via Spectral Techniques CoRR abs/0912.3403: (2009) | |
| 30 | 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) | |
| 29 | Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis, Maria Polukarov, Nicholas R. Jennings: Stability of overlapping coalitions. SIGecom Exchanges 8(1): (2009) | |
| 2008 | ||
| 28 | Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind: Manipulating the Quota in Weighted Voting Games. AAAI 2008: 215-220 | |
| 27 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: On the Dimensionality of Voting Games. AAAI 2008: 69-74 | |
| 26 | 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 | |
| 25 | Yoram Bachrach, Edith Elkind: Divide and conquer: false-name manipulations in weighted voting games. AAMAS (2) 2008: 975-982 | |
| 24 | 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 | |
| 23 | Edith Elkind, Georgios Chalkiadakis, Nicholas R. Jennings: Coalition Structures in Weighted Voting Games. ECAI 2008: 393-397 | |
| 22 | Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis, Nicholas R. Jennings: Overlapping Coalition Formation. WINE 2008: 307-321 | |
| 21 | Edith Elkind, Dmitrii V. Pasechnik: Computing the nucleolus of weighted voting games CoRR abs/0808.0298: (2008) | |
| 2007 | ||
| 20 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge: Computational Complexity of Weighted Threshold Games. AAAI 2007: 718-723 | |
| 19 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing good nash equilibria in graphical games. ACM Conference on Electronic Commerce 2007: 162-171 | |
| 18 | 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 | |
| 17 | Edith Elkind, Blaise Genest, Doron Peled, Paola Spoletini: Quantifying the Discord: Order Discrepancies in Message Sequence Charts. ATVA 2007: 378-393 | |
| 16 | Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled: On Commutativity Based Edge Lean Search. ICALP 2007: 158-170 | |
| 15 | Edith Elkind: Designing and learning optimal finite support auctions. SODA 2007: 736-745 | |
| 14 | Edith Elkind, Blaise Genest, Doron Peled: Detecting Races in Ensembles of Message Sequence Charts. TACAS 2007: 420-434 | |
| 13 | Edith Elkind, S. Shaheen Fatima: Maximizing Revenue in Sequential Auctions. WINE 2007: 491-502 | |
| 12 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Computing Good Nash Equilibria in Graphical Games CoRR abs/cs/0703133: (2007) | |
| 2006 | ||
| 11 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash equilibria in graphical games on trees revisited. ACM Conference on Electronic Commerce 2006: 100-109 | |
| 10 | Edith Elkind, Blaise Genest, Doron Peled, Hongyang Qu: Grey-Box Checking. FORTE 2006: 420-435 | |
| 9 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Frugality ratios and improved truthful mechanisms for vertex cover CoRR abs/cs/0606044: (2006) | |
| 8 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg: Nash Equilibria in Graphical Games on Trees Revisited Electronic Colloquium on Computational Complexity (ECCC)(005): (2006) | |
| 2005 | ||
| 7 | 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 | |
| 6 | Edith Elkind, Helger Lipmaa: Small Coalitions Cannot Manipulate Voting. Financial Cryptography 2005: 285-297 | |
| 5 | Edith Elkind, Helger Lipmaa: Hybrid Voting Protocols and Hardness of Manipulation. ISAAC 2005: 206-215 | |
| 2004 | ||
| 4 | Edith Elkind, Helger Lipmaa: Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. Financial Cryptography 2004: 117-131 | |
| 3 | Edith Elkind, Amit Sahai, Kenneth Steiglitz: Frugality in path auctions. SODA 2004: 701-709 | |
| 2003 | ||
| 2 | Edith Elkind, Helger Lipmaa: Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. IACR Cryptology ePrint Archive 2003: 21 (2003) | |
| 2002 | ||
| 1 | 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) | |
Colors in the list of coauthors
Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page