Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarEdith Elkind
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j25]Elliot Anshelevich, Onkar Bhardwaj, Edith Elkind, John Postl, Piotr Skowron:
Approximating optimal social choice under metric preferences. Artif. Intell. 264: 27-51 (2018)- [c105]Haris Aziz, Edith Elkind, Shenwei Huang, Martin Lackner, Luis Sánchez Fernández, Piotr Skowron:
On the Complexity of Extended and Proportional Justified Representation. AAAI 2018 - [c104]Ayumi Igarashi, Rani Izsak, Edith Elkind:
Cooperative Games With Bounded Dependency Degree. AAAI 2018 - [c103]Florian Jaeckle, Dominik Peters, Edith Elkind:
On Recognising Nearly Single-Crossing Preferences. AAAI 2018 - [c102]Jiarui Gan, Edith Elkind, Michael Wooldridge:
Stackelberg Security Games with Multiple Uncoordinated Defenders. AAMAS 2018: 703-711 - [c101]
- [e5]Éva Tardos, Edith Elkind, Rakesh Vohra:
Proceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018. ACM 2018 [contents] - 2017
- [j24]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management Under Approval-Driven Voting Rules. Algorithmica 77(1): 84-115 (2017) - [j23]Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert Freeman, Toby Walsh:
Justified representation in approval-based committee voting. Social Choice and Welfare 48(2): 461-485 (2017) - [j22]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko:
Properties of multiwinner voting rules. Social Choice and Welfare 48(3): 599-632 (2017) - [c100]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. AAAI 2017: 494-501 - [c99]Ayumi Igarashi, Dominik Peters, Edith Elkind:
Group Activity Selection on Social Networks. AAAI 2017: 565-571 - [c98]Luis Sánchez Fernández, Edith Elkind, Martin Lackner, Norberto Fernández García, Jesús Arias-Fisteus, Pablo Basanta-Val, Piotr Skowron:
Proportional Justified Representation. AAAI 2017: 670-676 - [c97]Piotr Krzysztof Skowron, Edith Elkind:
Social Choice Under Metric Preferences: Scoring Rules and STV. AAAI 2017: 706-712 - [c96]Svetlana Obraztsova, Maria Polukarov, Zinovi Rabinovich, Edith Elkind:
Doodle Poll Games. AAMAS 2017: 876-884 - [c95]Ayumi Igarashi, Robert Bredereck, Edith Elkind:
On Parameterized Complexity of Group Activity Selection Problems on Social Networks. AAMAS 2017: 1575-1577 - [c94]Edith Elkind:
Justified Representation in Multiwinner Voting: Axioms and Algorithms. FSTTCS 2017: 1:1-1:10 - [c93]Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, Piotr Skowron:
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. IJCAI 2017: 84-90 - [c92]Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters:
Fair Division of a Graph. IJCAI 2017: 135-141 - [c91]Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, Edith Elkind:
Proportional Rankings. IJCAI 2017: 409-415 - [c90]Robert Bredereck, Edith Elkind:
Manipulating Opinion Diffusion in Social Networks. IJCAI 2017: 894-900 - [i39]Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, Piotr Skowron:
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. CoRR abs/1701.08023 (2017) - [i38]Ayumi Igarashi, Robert Bredereck, Edith Elkind:
On Parameterized Complexity of Group Activity Selection Problems on Social Networks. CoRR abs/1703.01121 (2017) - [i37]Piotr Skowron, Martin Lackner, Edith Elkind, Luis Sánchez Fernández:
Optimal Average Satisfaction and Extended Justified Representation in Polynomial Time. CoRR abs/1704.00293 (2017) - [i36]Luis Sánchez Fernández, Edith Elkind, Martin Lackner:
Committees providing EJR can be computed efficiently. CoRR abs/1704.00356 (2017) - [i35]Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters:
Fair Division of a Graph. CoRR abs/1705.10239 (2017) - [i34]Edith Elkind, Umberto Grandi, Francesca Rossi, Arkadii Slinko:
Cognitive Hierarchy and Voting Manipulation. CoRR abs/1707.08598 (2017) - [i33]Ayumi Igarashi, Rani Izsak, Edith Elkind:
Cooperative Games with Bounded Dependency Degree. CoRR abs/1711.07310 (2017) - [i32]Ayumi Igarashi, Robert Bredereck, Dominik Peters, Edith Elkind:
Group Activity Selection on Social Networks. CoRR abs/1712.02712 (2017) - 2016
- [j21]Tomasz P. Michalak, Talal Rahwan, Edith Elkind, Michael Wooldridge, Nicholas R. Jennings:
A hybrid exact algorithm for complete set partitioning. Artif. Intell. 230: 14-50 (2016) - [c89]Edith Elkind, Angelo Fanelli, Michele Flammini:
Price of Pareto Optimality in Hedonic Games. AAAI 2016: 475-481 - [c88]
- [c87]Chrystalla Pavlou, Edith Elkind:
Manipulating Citation Indices in a Social Context. AAMAS 2016: 32-40 - [c86]Ayumi Igarashi, Edith Elkind:
Hedonic Games with Graph-restricted Communication. AAMAS 2016: 242-250 - [c85]Edith Elkind, Evangelos Markakis, Svetlana Obraztsova, Piotr Skowron:
Complexity of Finding Equilibria of Plurality Voting Under Structured Preferences. AAMAS 2016: 394-401 - [c84]Markus Brill, Edith Elkind, Ulle Endriss, Umberto Grandi:
Pairwise Diffusion of Preference Rankings in Social Networks. IJCAI 2016: 130-136 - [c83]Svetlana Obraztsova, Zinovi Rabinovich, Edith Elkind, Maria Polukarov, Nicholas R. Jennings:
Trembling Hand Equilibria of Plurality Voting. IJCAI 2016: 440-446 - [c82]Edith Elkind, Martin Lackner, Dominik Peters:
Preference Restrictions in Computational Social Choice: Recent Progress. IJCAI 2016: 4062-4065 - [p1]
- [r1]Edith Elkind, Arkadii Slinko:
Rationalizations of Voting Rules. Handbook of Computational Social Choice 2016: 169-196 - [i31]Ayumi Igarashi, Edith Elkind:
Hedonic Games with Graph-restricted Communication. CoRR abs/1602.05342 (2016) - [i30]Ayumi Igarashi, Dominik Peters, Edith Elkind:
Group Activity Selection on Social Networks. CoRR abs/1611.04524 (2016) - [i29]Luis Sánchez Fernández, Edith Elkind, Martin Lackner, Norberto Fernández García, Jesús A. Fisteus, Pablo Basanta-Val, Piotr Skowron:
Proportional Justified Representation. CoRR abs/1611.09928 (2016) - [i28]Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, Edith Elkind:
Proportional Rankings. CoRR abs/1612.01434 (2016) - 2015
- [j20]John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev:
Dynamics of Profit-Sharing Games. Internet Mathematics 11(1): 1-22 (2015) - [j19]Edith Elkind, Jérôme Lang, Abdallah Saffidine:
Condorcet winning sets. Social Choice and Welfare 44(3): 493-517 (2015) - [j18]Edith Elkind, Piotr Faliszewski, Arkadii Slinko:
Distance rationalization of voting rules. Social Choice and Welfare 45(2): 345-377 (2015) - [j17]Piotr Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind:
The complexity of fully proportional representation for single-crossing electorates. Theor. Comput. Sci. 569: 43-57 (2015) - [c81]Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert Freeman, Toby Walsh:
Justified Representation in Approval-Based Committee Voting. AAAI 2015: 784-790 - [c80]Edith Elkind, Piotr Faliszewski, Martin Lackner, Svetlana Obraztsova:
The Complexity of Recognizing Incomplete Single-Crossing Preferences. AAAI 2015: 865-871 - [c79]Edith Elkind, Anisse Ismaili:
OWA-Based Extensions of the Chamberlin-Courant Rule. ADT 2015: 486-502 - [c78]Edith Elkind, Umberto Grandi, Francesca Rossi, Arkadii Slinko:
Gibbard-Satterthwaite Games. IJCAI 2015: 533-539 - [c77]Svetlana Obraztsova, Edith Elkind, Maria Polukarov, Zinovi Rabinovich:
Strategic Candidacy Games with Lazy Candidates. IJCAI 2015: 610-616 - [c76]
- [c75]
- [c74]Edith Elkind, Evangelos Markakis, Svetlana Obraztsova, Piotr Skowron:
Equilibria of Plurality Voting: Lazy and Truth-Biased Voters. SAGT 2015: 110-122 - [e4]Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, Edith Elkind:
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015. ACM 2015, ISBN 978-1-4503-3413-6 [contents] - [i27]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management under Approval-Driven Voting Rules. CoRR abs/1501.00387 (2015) - [i26]
- [i25]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko:
Properties of Multiwinner Voting Rules. CoRR abs/1506.02891 (2015) - [i24]Dominik Peters, Edith Elkind:
Simple Causes of Complexity in Hedonic Games. CoRR abs/1507.03474 (2015) - 2014
- [j16]Yair Zick, Evangelos Markakis, Edith Elkind:
Arbitration and Stability in Cooperative Games with Overlapping Coalitions. J. Artif. Intell. Res. 50: 847-884 (2014) - [c73]Edith Elkind, Piotr Faliszewski, Piotr Skowron:
A Characterization of the Single-Peaked Single-Crossing Domain. AAAI 2014: 654-660 - [c72]Edith Elkind, Martin Lackner:
On Detecting Nearly Structured Preference Profiles. AAAI 2014: 661-667 - [c71]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko:
Properties of multiwinner voting rules. AAMAS 2014: 53-60 - [c70]Edith Elkind, Piotr Faliszewski:
Recognizing 1-Euclidean Preferences: An Alternative Approach. SAGT 2014: 146-157 - [c69]Edith Elkind, Nisarg Shah:
Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains. UAI 2014: 182-191 - [c68]
- [i23]Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis, Maria Polukarov, Nicholas R. Jennings:
Cooperative Games with Overlapping Coalitions. CoRR abs/1401.3856 (2014) - [i22]Haris Aziz, Yoram Bachrach, Edith Elkind, Mike Paterson:
False-Name Manipulations in Weighted Voting Games. CoRR abs/1401.3869 (2014) - [i21]Edith Elkind, Piotr Faliszewski, Arkadii Slinko:
Cloning in Elections: Finding the Possible Winners. CoRR abs/1401.4602 (2014) - [i20]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. CoRR abs/1401.8151 (2014) - [i19]Yair Zick, Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis:
Cooperative Games with Overlapping Coalitions: Charting the Tractability Frontier. CoRR abs/1407.0420 (2014) - [i18]Edith Elkind, Evangelos Markakis, Svetlana Obraztsova, Piotr Skowron:
Equilibria of Plurality Voting: Lazy and Truth-biased Voters. CoRR abs/1409.4132 (2014) - 2013
- [j15]Edith Elkind, James B. Orlin:
On the hardness of finding subsets with equal average. Inf. Process. Lett. 113(13): 477-480 (2013) - [j14]Yair Zick, Edith Elkind:
Arbitration and stability in cooperative games. SIGecom Exchanges 12(2): 36-41 (2013) - [c67]Reshef Meir, Yair Zick, Edith Elkind, Jeffrey S. Rosenschein:
Bounding the Cost of Stability in Games over Interaction Networks. AAAI 2013 - [c66]Svetlana Obraztsova, Yair Zick, Edith Elkind:
On manipulation in multi-winner elections based on scoring rules. AAMAS 2013: 359-366 - [c65]Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On swap-distance geometry of voting rules. AAMAS 2013: 383-390 - [c64]
- [c63]Edith Elkind, Dmitrii V. Pasechnik, Michael Wooldridge:
Strategic considerations in the design of committees. AAMAS 2013: 439-446 - [c62]
- [c61]Lan Yu, Hau Chan, Edith Elkind:
Multiwinner Elections Under Preferences That Are Single-Peaked on a Tree. IJCAI 2013: 425-431 - [c60]Piotr Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind:
The Complexity of Fully Proportional Representation for Single-Crossing Electorates. SAGT 2013: 1-12 - [e3]Guido Boella, Edith Elkind, Bastin Tony Roy Savarimuthu, Frank Dignum, Martin K. Purvis:
PRIMA 2013: Principles and Practice of Multi-Agent Systems - 16th International Conference, Dunedin, New Zealand, December 1-6, 2013. Proceedings. Lecture Notes in Computer Science 8291, Springer 2013, ISBN 978-3-642-44926-0 [contents] - [i17]Piotr Krzysztof Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind:
The Complexity of Fully Proportional Representation for Single-Crossing Electorates. CoRR abs/1307.1252 (2013) - 2012
- [j13]Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind:
Manipulating the quota in weighted voting games. Artif. Intell. 180-181: 1-19 (2012) - [j12]Georgios Chalkiadakis, Edith Elkind, Michael Wooldridge:
Cooperative Game Theory: Basic Concepts and Computational Challenges. IEEE Intelligent Systems 27(3): 86-90 (2012) - [j11]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) - [c59]
- [c58]Yair Zick, Evangelos Markakis, Edith Elkind:
Stability Via Convexity and LP Duality in OCF Games. AAAI 2012 - [c57]
- [c56]
- [c55]Yair Zick, Georgios Chalkiadakis, Edith Elkind:
Overlapping coalition formation games: charting the tractability frontier. AAMAS 2012: 787-794 - [c54]Ioannis Caragiannis, Edith Elkind, Mario Szegedy, Lan Yu:
Mechanism design: from partial to probabilistic verification. EC 2012: 266-283 - [c53]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Clone structures in voters' preferences. EC 2012: 496-513 - [c52]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. WINE 2012: 156-169 - [i16]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) - 2011
- [b1]Georgios Chalkiadakis, Edith Elkind, Michael Wooldridge:
Computational Aspects of Cooperative Game Theory. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2011 - [j10]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) - [j9]Haris Aziz, Yoram Bachrach, Edith Elkind, Mike Paterson:
False-Name Manipulations in Weighted Voting Games. J. Artif. Intell. Res. 40: 57-93 (2011) - [j8]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Cloning in Elections: Finding the Possible Winners. J. Artif. Intell. Res. 42: 529-573 (2011) - [c51]Talal Rahwan, Tomasz P. Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael Wooldridge, Nicholas R. Jennings:
Constrained Coalition Formation. AAAI 2011 - [c50]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management under Approval-Driven Voting Rules. AAAI 2011 - [c49]
- [c48]Svetlana Obraztsova, Edith Elkind, Noam Hazon:
Ties matter: complexity of voting manipulation revisited. AAMAS 2011: 71-78 - [c47]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Homogeneity and monotonicity of distance-rationalizable voting rules. AAMAS 2011: 821-828 - [c46]John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev:
Dynamics of Profit-Sharing Games. IJCAI 2011: 37-42 - [c45]Yoram Bachrach, Edith Elkind, Piotr Faliszewski:
Coalitional Voting Manipulation: A Game-Theoretic Perspective. IJCAI 2011: 49-54 - [c44]Edith Elkind, Jérôme Lang, Abdallah Saffidine:
Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion. IJCAI 2011: 186-191 - [c43]Egor Ianovski, Lan Yu, Edith Elkind, Mark C. Wilson:
The Complexity of Safe Manipulation under Scoring Rules. IJCAI 2011: 246-251 - [c42]Svetlana Obraztsova, Edith Elkind:
On the Complexity of Voting Manipulation under Randomized Tie-Breaking. IJCAI 2011: 319-324 - [c41]Yair Zick, Alexander Skopalik, Edith Elkind:
The Shapley Value as a Function of the Quota in Weighted Voting Games. IJCAI 2011: 490-496 - [c40]Svetlana Obraztsova, Edith Elkind, Noam Hazon:
Ties Matter: Complexity of Voting Manipulation Revisited. IJCAI 2011: 2698-2703 - [e2]Ning Chen, Edith Elkind, Elias Koutsoupias:
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 [contents] - [i15]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Clone Structures in Voters' Preferences. CoRR abs/1110.3939 (2011) - 2010
- [j7]Edith Elkind, Kevin Leyton-Brown:
Algorithmic Game Theory and Artificial Intelligence. AI Magazine 31(4): 9-12 (2010) - [j6]Edith Elkind, Blaise Genest, Doron A. Peled, Paola Spoletini:
Quantifying the Discord: Order Discrepancies in Message Sequence Charts. Int. J. Found. Comput. Sci. 21(2): 211-233 (2010) - [j5]Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis, Maria Polukarov, Nick R. Jennings:
Cooperative Games with Overlapping Coalitions. J. Artif. Intell. Res. 39: 179-216 (2010) - [c39]
- [c38]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Good Rationalizations of Voting Rules. AAAI 2010 - [c37]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On the role of distances in defining voting rules. AAMAS 2010: 375-382 - [c36]Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov:
Frugal Mechanism Design via Spectral Techniques. FOCS 2010: 755-764 - [c35]
- [c34]
- [c33]Edith Elkind, Piotr Faliszewski:
Approximation Algorithms for Campaign Management. WINE 2010: 473-482 - [e1]Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Vijay V. Vazirani, Bernhard von Stengel:
Equilibrium Computation, 25.04. - 30.04.2010. Dagstuhl Seminar Proceedings 10171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i14]Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Bernhard von Stengel, Vijay V. Vazirani:
10171 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2010 - [i13]Yvo Desmedt, Edith Elkind:
Equilibria of Plurality Voting with Abstentions. CoRR abs/1001.4939 (2010) - [i12]