Edith Elkind : Publications

Books

• [1]

  Computational Aspects of Cooperative Game Theory

  Georgios Chalkiadakis‚ Edith Elkind and Michael Wooldridge

  Morgan & Claypool Publishers. 2011.

  Details about Computational Aspects of Cooperative Game Theory | BibTeX data for Computational Aspects of Cooperative Game Theory | Link to Computational Aspects of Cooperative Game Theory

Journal papers

• [1]

  Properties of multiwinner voting rules

  Edith Elkind‚ Piotr Faliszewski‚ Piotr Skowron and Arkadii Slinko

  In Social Choice and Welfare. 2017.

  Details about Properties of multiwinner voting rules | BibTeX data for Properties of multiwinner voting rules

• [2]

  Justified representation in approval−based committee voting

  Haris Aziz‚ Markus Brill‚ Vincent Conitzer‚ Edith Elkind‚ Rupert Freeman and Toby Walsh

  In Social Choice and Welfare. 2017.

  Details about Justified representation in approval−based committee voting | BibTeX data for Justified representation in approval−based committee voting

• [3]

  Arbitration and Stability in Cooperative Games with Overlapping Coalitions

  Yair Zick‚ Edith Elkind and Evangelos Markakis

  In J. Artif. Intell. Res. (JAIR). Pages to appear. 2014.

  Details about Arbitration and Stability in Cooperative Games with Overlapping Coalitions | BibTeX data for Arbitration and Stability in Cooperative Games with Overlapping Coalitions | Download (pdf) of Arbitration and Stability in Cooperative Games with Overlapping Coalitions

• [4]

  Dynamics of Profit−Sharing Games

  John Augustine‚ Ning Chen‚ Edith Elkind‚ Angelo Fanelli‚ Nick Gravin and Dmitry Shiryaev

  In Internet Mathematics. Pages to appear. 2014.

  Details about Dynamics of Profit−Sharing Games | BibTeX data for Dynamics of Profit−Sharing Games | Link to Dynamics of Profit−Sharing Games

• [5]

  On the hardness of finding subsets with equal average

  Edith Elkind and James B. Orlin

  In Inf. Process. Lett.. Vol. 113. No. 13. Pages 477−480. 2013.

  Details about On the hardness of finding subsets with equal average | BibTeX data for On the hardness of finding subsets with equal average | Link to On the hardness of finding subsets with equal average

• [6]

  Rationalizations of Condorcet−consistent rules via distances of hamming type

  Edith Elkind‚ Piotr Faliszewski and Arkadii M. Slinko

  In Social Choice and Welfare. Vol. 39. No. 4. Pages 891−905. 2012.

  Details about Rationalizations of Condorcet−consistent rules via distances of hamming type | BibTeX data for Rationalizations of Condorcet−consistent rules via distances of hamming type | Link to Rationalizations of Condorcet−consistent rules via distances of hamming type

• [7]

  Cooperative Game Theory: Basic Concepts and Computational Challenges

  Georgios Chalkiadakis‚ Edith Elkind and Michael Wooldridge

  In IEEE Intelligent Systems. Vol. 27. No. 3. Pages 86−90. 2012.

  Details about Cooperative Game Theory: Basic Concepts and Computational Challenges | BibTeX data for Cooperative Game Theory: Basic Concepts and Computational Challenges | Link to Cooperative Game Theory: Basic Concepts and Computational Challenges

• [8]

  Manipulating the quota in weighted voting games

  Michael Zuckerman‚ Piotr Faliszewski‚ Yoram Bachrach and Edith Elkind

  In Artif. Intell.. Vol. 180−181. Pages 1−19. 2012.

  Details about Manipulating the quota in weighted voting games | BibTeX data for Manipulating the quota in weighted voting games | Link to Manipulating the quota in weighted voting games

• [9]

  Cloning in Elections: Finding the Possible Winners

  Edith Elkind‚ Piotr Faliszewski and Arkadii M. Slinko

  In J. Artif. Intell. Res. (JAIR). Vol. 42. Pages 529−573. 2011.

  Details about Cloning in Elections: Finding the Possible Winners | BibTeX data for Cloning in Elections: Finding the Possible Winners | Link to Cloning in Elections: Finding the Possible Winners

• [10]

  False−Name Manipulations in Weighted Voting Games

  Haris Aziz‚ Yoram Bachrach‚ Edith Elkind and Mike Paterson

  In J. Artif. Intell. Res. (JAIR). Vol. 40. Pages 57−93. 2011.

  Details about False−Name Manipulations in Weighted Voting Games | BibTeX data for False−Name Manipulations in Weighted Voting Games | Link to False−Name Manipulations in Weighted Voting Games

• [11]

  Cooperative Games with Overlapping Coalitions

  Georgios Chalkiadakis‚ Edith Elkind‚ Evangelos Markakis‚ Maria Polukarov and Nick R. Jennings

  In J. Artif. Intell. Res. (JAIR). Vol. 39. Pages 179−216. 2010.

  Details about Cooperative Games with Overlapping Coalitions | BibTeX data for Cooperative Games with Overlapping Coalitions | Link to Cooperative Games with Overlapping Coalitions

• [12]

  Quantifying the Discord: Order Discrepancies in Message Sequence Charts

  Edith Elkind‚ Blaise Genest‚ Doron Peled and Paola Spoletini

  In Int. J. Found. Comput. Sci.. Vol. 21. No. 2. Pages 211−233. 2010.

  Details about Quantifying the Discord: Order Discrepancies in Message Sequence Charts | BibTeX data for Quantifying the Discord: Order Discrepancies in Message Sequence Charts | Link to Quantifying the Discord: Order Discrepancies in Message Sequence Charts

• [13]

  Stability of overlapping coalitions

  Georgios Chalkiadakis‚ Edith Elkind‚ Evangelos Markakis‚ Maria Polukarov and Nicholas R. Jennings

  In SIGecom Exchanges. Vol. 8. No. 1. 2009.

  Details about Stability of overlapping coalitions | BibTeX data for Stability of overlapping coalitions | Link to Stability of overlapping coalitions

• [14]

  A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications

  Edith Elkind‚ Leslie Ann Goldberg‚ Paul W. Goldberg and Michael Wooldridge

  In Math. Log. Q.. Vol. 55. No. 4. Pages 362−376. 2009.

  Details about A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications | BibTeX data for A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications | Link to A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications

• [15]

  On commutativity based Edge Lean search

  Dragan Bosnacki‚ Edith Elkind‚ Blaise Genest and Doron Peled

  In Ann. Math. Artif. Intell.. Vol. 56. No. 2. Pages 187−210. 2009.

  Details about On commutativity based Edge Lean search | BibTeX data for On commutativity based Edge Lean search | Link to On commutativity based Edge Lean search

• [16]

  On the computational complexity of weighted voting games

  Edith Elkind‚ Leslie Ann Goldberg‚ Paul W. Goldberg and Michael Wooldridge

  In Ann. Math. Artif. Intell.. Vol. 56. No. 2. Pages 109−131. 2009.

  Details about On the computational complexity of weighted voting games | BibTeX data for On the computational complexity of weighted voting games | Link to On the computational complexity of weighted voting games

Conference papers

• [1]

  On Detecting Nearly Structured Preference Profiles

  Edith Elkind and Martin Lackner

  In AAAI. Pages 661−667. 2014.

  Details about On Detecting Nearly Structured Preference Profiles | BibTeX data for On Detecting Nearly Structured Preference Profiles

• [2]

  A Characterization of the Single−Peaked Single−Crossing Domain

  Edith Elkind‚ Piotr Faliszewski and Piotr Skowron

  In AAAI. Pages 654−660. 2014.

  Details about A Characterization of the Single−Peaked Single−Crossing Domain | BibTeX data for A Characterization of the Single−Peaked Single−Crossing Domain

• [3]

  Properties of Multiwinner Voting Rules

  Edith Elkind‚ Piotr Faliszewski‚ Piotr Skowron and Arkadii Slinko

  In AAMAS. Pages 53−60. 2014.

  Details about Properties of Multiwinner Voting Rules | BibTeX data for Properties of Multiwinner Voting Rules

• [4]

  Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains

  Edith Elkind and Nisarg Shah

  In UAI. 2014.

  Details about Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains | BibTeX data for Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains

• [5]

  Recognizing 1−Euclidean Preferences: An Alternative Approach

  Edith Elkind and Piotr Faliszewski

  In SAGT. 2014.

  Details about Recognizing 1−Euclidean Preferences: An Alternative Approach | BibTeX data for Recognizing 1−Euclidean Preferences: An Alternative Approach

• [6]

  The Complexity of Fully Proportional Representation for Single−Crossing Electorates

  Piotr Skowron‚ Lan Yu‚ Piotr Faliszewski and Edith Elkind

  In SAGT. Pages 1−12. 2013.

  Details about The Complexity of Fully Proportional Representation for Single−Crossing Electorates | BibTeX data for The Complexity of Fully Proportional Representation for Single−Crossing Electorates | Link to The Complexity of Fully Proportional Representation for Single−Crossing Electorates

• [7]

  Multiwinner Elections Under Preferences That Are Single−Peaked on a Tree

  Lan Yu‚ Hau Chan and Edith Elkind

  In IJCAI. 2013.

  Details about Multiwinner Elections Under Preferences That Are Single−Peaked on a Tree | BibTeX data for Multiwinner Elections Under Preferences That Are Single−Peaked on a Tree | Link to Multiwinner Elections Under Preferences That Are Single−Peaked on a Tree

• [8]

  Dynamic weighted voting games

  Edith Elkind‚ Dmitrii V. Pasechnik and Yair Zick

  In AAMAS. Pages 515−522. 2013.

  Details about Dynamic weighted voting games | BibTeX data for Dynamic weighted voting games | Link to Dynamic weighted voting games

• [9]

  Strategic considerations in the design of committees

  Edith Elkind‚ Dmitrii V. Pasechnik and Michael Wooldridge

  In AAMAS. Pages 439−446. 2013.

  Details about Strategic considerations in the design of committees | BibTeX data for Strategic considerations in the design of committees | Link to Strategic considerations in the design of committees

• [10]

  On elections with robust winners

  Dmitry Shiryaev‚ Lan Yu and Edith Elkind

  In AAMAS. Pages 415−422. 2013.

  Details about On elections with robust winners | BibTeX data for On elections with robust winners | Link to On elections with robust winners

• [11]

  On swap−distance geometry of voting rules

  Svetlana Obraztsova‚ Edith Elkind‚ Piotr Faliszewski and Arkadii M. Slinko

  In AAMAS. Pages 383−390. 2013.

  Details about On swap−distance geometry of voting rules | BibTeX data for On swap−distance geometry of voting rules | Link to On swap−distance geometry of voting rules

• [12]

  On manipulation in multi−winner elections based on scoring rules

  Svetlana Obraztsova‚ Yair Zick and Edith Elkind

  In AAMAS. Pages 359−366. 2013.

  Details about On manipulation in multi−winner elections based on scoring rules | BibTeX data for On manipulation in multi−winner elections based on scoring rules | Link to On manipulation in multi−winner elections based on scoring rules

• [13]

  Bounding the Cost of Stability in Games over Interaction Networks

  Reshef Meir‚ Yair Zick‚ Edith Elkind and Jeffrey S. Rosenschein

  In AAAI. 2013.

  Details about Bounding the Cost of Stability in Games over Interaction Networks | BibTeX data for Bounding the Cost of Stability in Games over Interaction Networks | Link to Bounding the Cost of Stability in Games over Interaction Networks