Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDEdith Elkind
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j32]Edith Elkind, Jiarui Gan, Svetlana Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris:
Protecting elections by recounting ballots. Artif. Intell. 290: 103401 (2021)- 2020
- [j31]Edith Elkind, Angelo Fanelli, Michele Flammini:
Price of Pareto Optimality in hedonic games. Artif. Intell. 288: 103357 (2020) - [j30]Edith Elkind, Umberto Grandi, Francesca Rossi, Arkadii Slinko:
Cognitive hierarchy and voting manipulation in k-approval voting. Math. Soc. Sci. 108: 193-205 (2020) - [j29]Edith Elkind, Piotr Faliszewski, Piotr Skowron
:
A characterization of the single-peaked single-crossing domain. Soc. Choice Welf. 54(1): 167-181 (2020) - [c122]Aishwarya Agarwal, Edith Elkind, Jiarui Gan, Alexandros A. Voudouris:
Swap Stability in Schelling Games on Graphs. AAAI 2020: 1758-1765 - [c121]Niclas Boehmer, Edith Elkind:
Individual-Based Stability in Hedonic Diversity Games. AAAI 2020: 1822-1829 - [c120]Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski:
On Swap Convexity of Voting Rules. AAAI 2020: 1910-1917 - [c119]Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy:
Algorithms for Swap and Shift Bribery in Structured Elections. AAMAS 2020: 366-374 - [c118]Jiarui Gan, Edith Elkind, Sarit Kraus, Michael J. Wooldridge:
Mechanism Design for Defense Coordination in Security Games. AAMAS 2020: 402-410 - [c117]Svetlana Obraztsova, Maria Polukarov, Edith Elkind, Marek Grzesiuk:
Multiwinner Candidacy Games. AAMAS 2020: 957-965 - [c116]Niclas Boehmer, Edith Elkind:
Stable Roommate Problem With Diversity Preferences. AAMAS 2020: 1780-1782 - [c115]Niclas Boehmer, Edith Elkind:
Stable Roommate Problem with Diversity Preferences. IJCAI 2020: 96-102 - [c114]Edith Elkind, Neel Patel, Alan Tsang, Yair Zick:
Keeping Your Friends Close: Land Allocation with Friends. IJCAI 2020: 318-324 - [c113]Andrew Estornell, Sanmay Das, Edith Elkind, Yevgeniy Vorobeychik:
Election Control by Manipulating Issue Significance. UAI 2020: 151 - [e7]Matthew E. Taylor, Yang Yu, Edith Elkind, Yang Gao:
Distributed Artificial Intelligence - Second International Conference, DAI 2020, Nanjing, China, October 24-27, 2020, Proceedings. Lecture Notes in Computer Science 12547, Springer 2020, ISBN 978-3-030-64095-8 [contents] - [i52]Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon:
Egalitarian Deliberative Decision Making. CoRR abs/2001.08031 (2020) - [i51]Edith Elkind, Neel Patel, Alan Tsang, Yair Zick:
Keeping Your Friends Close: Land Allocation with Friends. CoRR abs/2003.03558 (2020) - [i50]Niclas Boehmer, Edith Elkind:
Stable Roommate Problem with Diversity Preferences. CoRR abs/2004.14640 (2020) - [i49]Dominik Peters, Lan Yu, Hau Chan, Edith Elkind:
Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results. CoRR abs/2007.06549 (2020) - [i48]Andrew Estornell, Sanmay Das, Edith Elkind, Yevgeniy Vorobeychik:
Election Control by Manipulating Issue Significance. CoRR abs/2007.09786 (2020) - [i47]Andrei Constantinescu, Edith Elkind:
Proportional Representation under Single-Crossing Preferences Revisited. CoRR abs/2010.08637 (2020)
2010 – 2019
- 2019
- [j28]Yair Zick, Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis:
Cooperative games with overlapping coalitions: Charting the tractability frontier. Artif. Intell. 271: 74-97 (2019) - [c112]Robert Bredereck, Edith Elkind, Ayumi Igarashi:
Hedonic Diversity Games. AAMAS 2019: 565-573 - [c111]Nawal Benabbou, Mithun Chakraborty, Edith Elkind, Yair Zick:
Fairness Towards Groups of Agents in the Allocation of Indivisible Items. IJCAI 2019: 95-101 - [c110]Edith Elkind, Jiarui Gan, Svetlana Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris:
Protecting Elections by Recounting Ballots. IJCAI 2019: 259-265 - [c109]Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling Games on Graphs. IJCAI 2019: 266-272 - [c108]Maciej Kocot, Anna Kolonko, Edith Elkind, Piotr Faliszewski, Nimrod Talmon:
Multigoal Committee Selection. IJCAI 2019: 385-391 - [c107]Foram Lakhani, Dominik Peters, Edith Elkind:
Correlating Preferences and Attributes: Nearly Single-Crossing Profiles. IJCAI 2019: 414-420 - [c106]Jakub Sliwinski, Edith Elkind:
Preferences Single-Peaked on a Tree: Sampling and Tree Recognition. IJCAI 2019: 580-586 - [p2]Haris Aziz, Felix Brandt, Edith Elkind, Piotr Skowron:
Computational Social Choice: The First Ten Years and Beyond. Computing and Software Science 2019: 48-65 - [e6]Edith Elkind, Manuela Veloso, Noa Agmon, Matthew E. Taylor:
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '19, Montreal, QC, Canada, May 13-17, 2019. International Foundation for Autonomous Agents and Multiagent Systems 2019, ISBN 978-1-4503-6309-9 [contents] - [i46]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. CoRR abs/1901.09217 (2019) - [i45]Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling Games on Graphs. CoRR abs/1902.07937 (2019) - [i44]Robert Bredereck, Edith Elkind, Ayumi Igarashi:
Hedonic Diversity Games. CoRR abs/1903.00303 (2019) - [i43]Edith Elkind, Jiarui Gan, Svetlana Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris:
Protecting Elections by Recounting Ballots. CoRR abs/1906.07071 (2019) - [i42]Nathann Cohen, Edith Elkind, Foram Lakhani:
Single-crossing Implementation. CoRR abs/1906.09671 (2019) - [i41]Aishwarya Agarwal, Edith Elkind, Jiarui Gan, Alexandros A. Voudouris:
Swap Stability in Schelling Games on Graphs. CoRR abs/1909.02421 (2019) - [i40]Niclas Boehmer, Edith Elkind:
Individual-Based Stability in Hedonic Diversity Games. CoRR abs/1911.08669 (2019) - 2018
- [j27]Elliot Anshelevich, Onkar Bhardwaj, Edith Elkind, John Postl, Piotr Skowron:
Approximating optimal social choice under metric preferences. Artif. Intell. 264: 27-51 (2018) - [j26]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group activity selection problem with approval preferences. Int. J. Game Theory 47(3): 767-796 (2018) - [j25]Yoram Bachrach, Edith Elkind, Enrico Malizia, Reshef Meir, Dmitrii V. Pasechnik, Jeffrey S. Rosenschein, Jörg Rothe, Michael Zuckerman:
Bounds on the Cost of Stabilizing a Cooperative Game. J. Artif. Intell. Res. 63: 987-1023 (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: 902-909 - [c104]Ayumi Igarashi, Rani Izsak, Edith Elkind:
Cooperative Games With Bounded Dependency Degree. AAAI 2018: 1063-1070 - [c103]Florian Jaeckle, Dominik Peters, Edith Elkind:
On Recognising Nearly Single-Crossing Preferences. AAAI 2018: 1079-1086 - [c102]Jiarui Gan, Edith Elkind, Michael J. Wooldridge:
Stackelberg Security Games with Multiple Uncoordinated Defenders. AAMAS 2018: 703-711 - [c101]Edith Elkind:
Restricted Preference Domains in Social Choice: Two Perspectives. SAGT 2018: 12-18 - [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. Soc. Choice Welf. 48(2): 461-485 (2017) - [j22]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko:
Properties of multiwinner voting rules. Soc. Choice Welf. 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 J. 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]Dominik Peters, Edith Elkind:
Preferences Single-Peaked on Nice Trees. AAAI 2016: 594-600 - [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]Edith Elkind, Jörg Rothe:
Cooperative Game Theory. Economics and Computation 2016: 135-193 - [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 Math. 11(1): 1-22 (2015) - [j19]Edith Elkind, Jérôme Lang, Abdallah Saffidine:
Condorcet winning sets. Soc. Choice Welf. 44(3): 493-517 (2015) - [j18]Edith Elkind, Piotr Faliszewski, Arkadii Slinko:
Distance rationalization of voting rules. Soc. Choice Welf. 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]Dominik Peters, Edith Elkind:
Simple Causes of Complexity in Hedonic Games. IJCAI 2015: 617-623 - [c75]Edith Elkind, Martin Lackner:
Structure in Dichotomous Preferences. IJCAI 2015: 2019-2025 - [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]Edith Elkind, Martin Lackner:
Structure in Dichotomous Preferences. CoRR abs/1505.00341 (2015) - [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]Edith Elkind:
Coalitional Games on Sparse Social Networks. WINE 2014: 308-321 - [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 Exch. 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]Dmitry Shiryaev, Lan Yu, Edith Elkind:
On elections with robust winners. AAMAS 2013: 415-422 - [c63]Edith Elkind, Dmitrii V. Pasechnik, Michael J. Wooldridge:
Strategic considerations in the design of committees. AAMAS 2013: 439-446 - [c62]Edith Elkind, Dmitrii V. Pasechnik, Yair Zick:
Dynamic weighted voting games. AAMAS 2013: 515-522 - [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 J. Wooldridge:
Cooperative Game Theory: Basic Concepts and Computational Challenges. IEEE Intell. Syst. 27(3): 86-90 (2012) - [j11]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Rationalizations of Condorcet-consistent rules via distances of hamming type. Soc. Choice Welf. 39(4): 891-905 (2012) - [c59]Svetlana Obraztsova, Edith Elkind:
Optimal Manipulation of Voting Rules. AAAI 2012 - [c58]Yair Zick, Evangelos Markakis, Edith Elkind:
Stability Via Convexity and LP Duality in OCF Games. AAAI 2012 - [c57]Svetlana Obraztsova, Edith Elkind:
Optimal manipulation of voting rules. AAMAS 2012: 619-626 - [c56]Edith Elkind, Gábor Erdélyi:
Manipulation under voting rule uncertainty. AAMAS 2012: 627-634 - [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]