Edith Elkind | Academic Influence

Edith Elkind's AcademicInfluence.com Rankings

Edith Elkind

Computer Science

#11001

World Rank

#11607

Historical Rank

Theoretical Computer Science

#129

World Rank

#129

Historical Rank

Artificial Intelligence

#5418

World Rank

#5492

Historical Rank

Database

#8034

World Rank

#8373

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Edith Elkind's Degrees

PhD Computer Science University of Liverpool
Masters Computer Science University of Tartu
Bachelors Computer Science University of Tartu

Similar Degrees You Can Earn

Why Is Edith Elkind Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Edith Elkind is an Estonian computer scientist who works as a professor of computing science at the University of Oxford and as a non-tutorial fellow of Balliol College, Oxford. She is known for her work in algorithmic game theory and computational social choice.

(See a Problem?)

Edith Elkind's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Computational Aspects of Cooperative Game Theory (2011) (393)
Properties of multiwinner voting rules (2014) (231)
Cooperative Games with Overlapping Coalitions (2010) (128)
Frugality in path auctions (2004) (127)
Swap Bribery (2009) (126)
Proportional Justified Representation (2016) (117)
The Cost of Stability in Coalitional Games (2009) (113)
Computational Complexity of Weighted Threshold Games (2007) (108)
Hybrid Voting Protocols and Hardness of Manipulation (2005) (108)
The complexity of fully proportional representation for single-crossing electorates (2013) (97)
Hedonic coalition nets (2009) (96)
Equilibria of plurality voting with abstentions (2010) (91)
Manipulating the quota in weighted voting games (2008) (85)
Fair Division of a Graph (2017) (80)
Clone structures in voters' preferences (2011) (79)
Computational Aspects of Cooperative Game Theory (Synthesis Lectures on Artificial Inetlligence and Machine Learning) (2011) (77)
Group Activity Selection Problem (2012) (71)
On the computational complexity of weighted voting games (2009) (70)
Constrained Coalition Formation (2011) (70)
Structure in Dichotomous Preferences (2015) (69)
Designing and learning optimal finite support auctions (2007) (64)
Nash equilibria in graphical games on trees revisited (2006) (64)
Simple Causes of Complexity in Hedonic Games (2015) (64)
Ties Matter: Complexity of Voting Manipulation Revisited (2011) (62)
A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications (2008) (60)
Manipulating Opinion Diffusion in Social Networks (2017) (59)
Structured Preferences (2017) (59)
A hybrid exact algorithm for complete set partitioning (2016) (58)
On the Complexity of Extended and Proportional Justified Representation (2018) (58)
Coalition Structures in Weighted Voting Games (2008) (57)
Approximation Algorithms for Campaign Management (2010) (57)
False-Name Manipulations in Weighted Voting Games (2014) (56)
Divide and conquer: false-name manipulations in weighted voting games (2008) (55)
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain (2017) (54)
Multiwinner Elections Under Preferences That Are Single-Peaked on a Tree (2013) (50)
Cooperative Game Theory: Basic Concepts and Computational Challenges (2012) (49)
Distance rationalization of voting rules (2015) (49)
Price of Pareto Optimality in Hedonic Games (2016) (49)
On the role of distances in defining voting rules (2010) (47)
Proportional Rankings (2016) (47)
Computing the nucleolus of weighted voting games (2008) (46)
Cloning in Elections: Finding the Possible Winners (2011) (46)
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality (2017) (45)
On the Complexity of Voting Manipulation under Randomized Tie-Breaking (2011) (44)
On elections with robust winners (2013) (44)
Campaign Management Under Approval-Driven Voting Rules (2011) (43)
On distance rationalizability of some voting rules (2009) (43)
Hedonic Games with Graph-restricted Communication (2016) (40)
Small Coalitions Cannot Manipulate Voting (2005) (38)
Mechanism design: from partial to probabilistic verification (2012) (37)
Rationalizations of Voting Rules (2016) (37)
Overlapping coalition formation games: charting the tractability frontier (2012) (36)
Group Activity Selection on Social Networks (2016) (35)
A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack (2002) (35)
Overlapping Coalition Formation (2008) (34)
Good Rationalizations of Voting Rules (2010) (34)
Grey-Box Checking (2006) (33)
Cloning in Elections (2010) (32)
Recognizing 1-Euclidean Preferences: An Alternative Approach (2014) (32)
OWA-Based Extensions of the Chamberlin-Courant Rule (2015) (32)
Preference Restrictions in Computational Social Choice: Recent Progress (2016) (31)
A characterization of the single-peaked single-crossing domain (2014) (31)
Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion (2011) (31)
Condorcet winning sets (2015) (31)
Pairwise Diffusion of Preference Rankings in Social Networks (2016) (31)
Dynamics of Profit-Sharing Games (2010) (31)
Arbitrators in overlapping coalition formation games (2011) (31)
On Detecting Nearly Structured Preference Profiles (2014) (30)
Optimal Manipulation of Voting Rules (2012) (30)
Bounding the Cost of Stability in Games over Interaction Networks (2013) (30)
On the Dimensionality of Voting Games (2008) (29)
Fairness Towards Groups of Agents in the Allocation of Indivisible Items (2019) (29)
Preferences Single-Peaked on Nice Trees (2016) (28)
Schelling Games on Graphs (2019) (28)
Cooperative Game Theory (2016) (28)
Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2015) (28)
Frugal Mechanism Design via Spectral Techniques (2009) (27)
Equilibria of Plurality Voting: Lazy and Truth-Biased Voters (2014) (27)
Computational Coalition Formation (2013) (27)
The Shapley Value as a Function of the Quota in Weighted Voting Games (2011) (27)
Manipulation under voting rule uncertainty (2012) (27)
Coalitional Voting Manipulation: A Game-Theoretic Perspective (2011) (27)
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs (2005) (25)
On Parameterized Complexity of Group Activity Selection Problems on Social Networks (2017) (24)
Computing good nash equilibria in graphical games (2007) (24)
Rationalizations of Condorcet-consistent rules via distances of hamming type (2010) (24)
Frugality ratios and improved truthful mechanisms for vertex cover (2006) (24)
On manipulation in multi-winner elections based on scoring rules (2013) (22)
Social Choice Under Metric Preferences: Scoring Rules and STV (2017) (22)
Boolean combinations of weighted voting games (2009) (22)
PRIMA 2013: Principles and Practice of Multi-Agent Systems (2013) (21)
Swap Stability in Schelling Games on Graphs (2019) (21)
Computational Social Choice: The First Ten Years and Beyond (2019) (21)
Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains (2014) (21)
Stackelberg Security Games with Multiple Uncoordinated Defenders (2018) (21)
Group activity selection problem with approval preferences (2018) (20)
Interleaving Cryptography and Mechanism Design: The Case of Online Auctions (2004) (19)
The Complexity of Recognizing Incomplete Single-Crossing Preferences (2015) (19)
Coalitional Games on Sparse Social Networks (2014) (18)
The price of democracy in coalition formation (2009) (18)
The Complexity of Safe Manipulation under Scoring Rules (2011) (17)
Maximizing Revenue in Sequential Auctions (2007) (17)
Complexity of Safe Strategic Voting (2010) (17)
Hedonic Diversity Games (2019) (17)
Simple Coalitional Games with Beliefs (2009) (16)
Individual-Based Stability in Hedonic Diversity Games (2019) (15)
Preference Restrictions in Computational Social Choice: A Survey (2022) (13)
Dynamic weighted voting games (2013) (13)
Doodle Poll Games (2017) (12)
Protecting Elections by Recounting Ballots (2019) (12)
On swap-distance geometry of voting rules (2013) (12)
Mind the Gap: Cake Cutting With Separation (2020) (12)
Graphical Cake Cutting via Maximin Share (2021) (11)
Gibbard-Satterthwaite Games (2015) (11)
Stability Via Convexity and LP Duality in OCF Games (2012) (11)
Committees providing EJR can be computed efficiently (2017) (10)
Detecting Races in Ensembles of Message Sequence Charts (2007) (10)
Strategic Candidacy Games with Lazy Candidates (2015) (10)
Homogeneity and monotonicity of distance-rationalizable voting rules (2011) (10)
Trembling Hand Equilibria of Plurality Voting (2016) (9)
Keep Your Distance: Land Division With Separation (2021) (9)
Stable Roommate Problem with Diversity Preferences (2020) (9)
Multigoal Committee Selection (2019) (9)
Bounds on the Cost of Stabilizing a Cooperative Game (2018) (8)
On Recognising Nearly Single-Crossing Preferences (2018) (8)
Cooperative Games with Overlapping Coalitions: Charting the Tractability Frontier (2014) (7)
On commutativity based Edge Lean search (2007) (7)
Quantifying the Discord: Order Discrepancies in Message Sequence Charts (2007) (7)
Algorithms for Swap and Shift Bribery in Structured Elections (2020) (7)
Keeping Your Friends Close: Land Allocation with Friends (2020) (7)
Complexity of Finding Equilibria of Plurality Voting Under Structured Preferences (2016) (6)
Approximating mixed Nash equilibria using smooth fictitious play in simultaneous auctions (2008) (6)
Correlating Preferences and Attributes: Nearly Single-Crossing Profiles (2019) (6)
Mechanism Design for Defense Coordination in Security Games (2020) (6)
Optimal Average Satisfaction and Extended Justified Representation in Polynomial Time (2017) (5)
Contest Design with Threshold Objectives (2021) (5)
Manipulating Citation Indices in a Social Context (2016) (4)
Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (2020) (4)
Proportional Representation under Single-Crossing Preferences Revisited (2020) (4)
The Price of Justified Representation (2021) (4)
Guest editorial: special issue on computational social choice (2010) (4)
Stability of overlapping coalitions (2009) (4)
Algorithmic Game Theory and Artificial Intelligence (2010) (4)
United for Change: Deliberative Coalition Formation to Change the Status Quo (2020) (4)
Preferences Single-Peaked on a Tree: Sampling and Tree Recognition (2019) (4)
Cooperative Games with Bounded Dependency Degree (2017) (3)
Cognitive hierarchy and voting manipulation in k-approval voting (2020) (3)
Democratic Forking: Choosing Sides with Social Choice (2021) (3)
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, May 4-8, 2015 (2015) (3)
Restricted Preference Domains in Social Choice: Two Perspectives (2018) (3)
Games Gibbard – Satterthwaite Manipulators Play (2014) (3)
Internet and network economics : 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011: proceedings (2011) (3)
Cognitive Hierarchy and Voting Manipulation (2017) (3)
Justifying Groups in Multiwinner Approval Voting (2021) (2)
Committee Scoring Rules , Banzhaf Values , and Approximation Algorithms (2017) (2)
Egalitarian Deliberative Decision Making (2020) (2)
Strategic considerations in the design of committees (2013) (2)
Introduction to the AI Magazine Special Issue on Algorithmic Game Theory (2010) (2)
Justified Representation in Multiwinner Voting: Axioms and Algorithms (2017) (2)
Distance Rationalization of Voting Rules 1 (2010) (2)
Arbitration and stability in cooperative games (2014) (2)
Facility Location With Approval Preferences: Strategyproofness and Fairness (2022) (2)
Election Control by Manipulating Issue Significance (2020) (2)
Bounding the Cost of Stability in Games with Restricted Interaction (2012) (2)
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy (2022) (2)
Computational issues in optimal auction design (2005) (1)
Condorcet winning sets (2014) (1)
Explaining Preferences by Multiple Patterns in Voters' Behavior (2022) (1)
Refining the Cost of Cheap Labor in Set System Auctions (2009) (1)
Group activity selection problem with approval preferences (2017) (1)
Fairness in Temporal Slot Assignment (2022) (1)
Rationalizations of Condorcet-consistent rules via distances of hamming type (2011) (1)
Manipulation Under Voting Rule Uncertainty 1 (2012) (1)
Group Activity Selection on Social Networks Group Activity Selection on Social Networks (2018) (1)
On Swap Convexity of Voting Rules (2020) (1)
Proceedings of the IJCAI-2011 Workshop on Social Choice and Artificial Intelligence (2011) (1)
Frugality Ratios And Improved Truthful Mechanisms for (2007) (1)
Complexity of Deliberative Coalition Formation (2022) (1)
Multi-Issue Opinion Diffusion under Constraints (2019) (1)
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning (2022) (1)
Contests to Incentivize a Target Group (2022) (1)
Single-crossing Implementation (2019) (1)
Social Choice and Welfare Justified Representation in Approval-Based Committee Voting (2016) (1)
Computation and Incentives in Social Choice (2012) (1)
Multiwinner Candidacy Games (2020) (1)
Coalition Formation Games (Dagstuhl Seminar 21331) (2021) (0)
5 . Computational model of influences on physical activity (2018) (0)
Distributed Artificial Intelligence: Second International Conference, DAI 2020, Nanjing, China, October 24–27, 2020, Proceedings (2020) (0)
Better Collective Decisions via Uncertainty Reduction (2022) (0)
A characterization of the single-peaked single-crossing domain (2019) (0)
Distance rationalization of voting rules (2015) (0)
How Hard is it to Manipulate Voting (2004) (0)
Acyclic graphs Stars Paths (2016) (0)
Exact Learning of Preference Structure: Single-peaked Preferences and Beyond (2022) (0)
Voting: A View through the Algorithmic Lens (2009) (0)
On the hardness of finding subsets with equal average (2013) (0)
Deliberative Coalition Formation. (2020) (0)
Distance Rationalizability of Voting Rules (2010) (0)
Computational Aspects of Cooperative Games with Overlapping Coalitions (2014) (0)
The Price of Justiﬁed Representation (2022) (0)
1 Algorithmic Game Theory and Artificial Intelligence (2010) (0)
Simple , optimal and efficient auctions (2011) (0)
Properties of multiwinner voting rules (2017) (0)
k-Prize Weighted Voting Games (2023) (0)
10171 Abstracts Collection - Equilibrium Computation (2010) (0)
10171 Abstracts Collection Equilibrium Computation Dagstuhl Seminar (2008) (0)
M A ] 12 S ep 2 01 6 Justified Representation in Approval-Based Committee Voting (2021) (0)
Computation and Incentives in Social Choice (Dagstuhl Seminar 12101) (2012) (0)
Guest editorial: special issue on fair division (2022) (0)
Algorithmic Game Theory (2010) (0)
CS 493 : Algorithms for Massive Data Sets Classification and clustering March 14 , 2002 Scribe (0)
Internet and Network Economics (2011) (0)
Proceedings of the 7th international conference on Internet and Network Economics (2011) (0)
G T ] 2 3 Ju n 20 19 Single-Crossing Implementation (2019) (0)
Justified representation in approval-based committee voting (2017) (0)
Open Archive TOULOUSE Archive Ouverte (OATAO) (2004) (0)
Incorporating PGMs into a BDI Architecture (2013) (0)
Campaign Management Under Approval-Driven Voting Rules (2015) (0)
Defense coordination in security games: Equilibrium analysis and mechanism design (2022) (0)
Complexity of Safe Strategic Voting 1 (2010) (0)
Selecting Representative Bodies: An Axiomatic View (2023) (0)

This paper list is powered by the following services:

Other Resources About Edith Elkind

en.wikipedia.org

What Schools Are Affiliated With Edith Elkind?

Edith Elkind is affiliated with the following schools: