Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdith Elkind
- > Home > Persons > Edith Elkind
Publications
- 2024
[c146]Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind:
Selecting Representative Bodies: An Axiomatic View. AAMAS 2024: 2701-2705- 2023
- [j38]Edith Elkind, Piotr Faliszewski
, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying groups in multiwinner approval voting. Theor. Comput. Sci. 969: 114039 (2023) - [i72]Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind:
Selecting Representative Bodies: An Axiomatic View. CoRR abs/2304.02774 (2023) - 2022
- [c139]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. AAAI 2022: 4983-4990 - [c133]Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa:
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. NeurIPS 2022 - [c131]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. SAGT 2022: 472-489 - [i64]Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa:
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. CoRR abs/2205.07831 (2022) - 2021
- [i57]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. CoRR abs/2108.12949 (2021) - [i55]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. CoRR abs/2112.05994 (2021) - 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) - [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 - 2019
- [c108]Maciej Kocot, Anna Kolonko, Edith Elkind, Piotr Faliszewski, Nimrod Talmon:
Multigoal Committee Selection. IJCAI 2019: 385-391 - [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) - 2017
- [j24]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management Under Approval-Driven Voting Rules. Algorithmica 77(1): 84-115 (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 - [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 - [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) - 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) - [c80]Edith Elkind, Piotr Faliszewski, Martin Lackner, Svetlana Obraztsova:
The Complexity of Recognizing Incomplete Single-Crossing Preferences. AAAI 2015: 865-871 - [i27]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management under Approval-Driven Voting Rules. CoRR abs/1501.00387 (2015) - [i25]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko:
Properties of Multiwinner Voting Rules. CoRR abs/1506.02891 (2015) - 2014
- [c73]Edith Elkind, Piotr Faliszewski, Piotr Skowron:
A Characterization of the Single-Peaked Single-Crossing Domain. AAAI 2014: 654-660 - [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 - [i21]Edith Elkind, Piotr Faliszewski, Arkadii Slinko:
Cloning in Elections: Finding the Possible Winners. CoRR abs/1401.4602 (2014) - 2013
- [c65]Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On swap-distance geometry of voting rules. AAMAS 2013: 383-390 - [c60]Piotr Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind:
The Complexity of Fully Proportional Representation for Single-Crossing Electorates. SAGT 2013: 1-12 - [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) - [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) - [c53]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Clone structures in voters' preferences. EC 2012: 496-513 - 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 J. Wooldridge, Nicholas R. Jennings:
Constrained Coalition Formation. AAAI 2011: 719-725 - [c50]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management under Approval-Driven Voting Rules. AAAI 2011: 726-731 - [c47]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Homogeneity and monotonicity of distance-rationalizable voting rules. AAMAS 2011: 821-828 - [c45]Yoram Bachrach, Edith Elkind, Piotr Faliszewski:
Coalitional Voting Manipulation: A Game-Theoretic Perspective. IJCAI 2011: 49-54 - [i15]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Clone Structures in Voters' Preferences. CoRR abs/1110.3939 (2011) - 2010
- [c39]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Cloning in Elections. AAAI 2010: 768-773 - [c38]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Good Rationalizations of Voting Rules. AAAI 2010: 774-779 - [c37]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On the role of distances in defining voting rules. AAMAS 2010: 375-382 - [c33]Edith Elkind, Piotr Faliszewski:
Approximation Algorithms for Campaign Management. WINE 2010: 473-482 - [i12]Edith Elkind, Piotr Faliszewski:
Approximation Algorithms for Campaign Management. CoRR abs/1004.0334 (2010) - [i11]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type. CoRR abs/1009.0300 (2010) - 2009
- [c32]Piotr Faliszewski, Edith Elkind, Michael J. Wooldridge:
Boolean combinations of weighted voting games. AAMAS (1) 2009: 185-192 - [c26]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Swap Bribery. SAGT 2009: 299-310 - [c24]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On distance rationalizability of some voting rules. TARK 2009: 108-117 - [i9]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Swap Bribery. CoRR abs/0905.3885 (2009) - 2008
- [c21]Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind:
Manipulating the Quota in Weighted Voting Games. AAAI 2008: 215-220
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-09 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
