default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
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
- 2024
[j40]Edith Elkind
, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. ACM Trans. Economics and Comput. 12(3): 11:1-11:27 (2024)- [c155]Giannis Tyrovolas, Andrei Constantinescu, Edith Elkind:
Unravelling Expressive Delegations: Complexity and Normative Analysis. AAAI 2024: 9918-9925 - [c154]Edith Elkind, Svetlana Obraztsova, Nicholas Teh:
Temporal Fairness in Multiwinner Voting. AAAI 2024: 22633-22640 - [c153]Edith Elkind, Svetlana Obraztsova, Nicholas Teh:
Verifying Proportionality in Temporal Voting. AAMAS 2024: 2246-2248 - [c152]Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind:
Selecting Representative Bodies: An Axiomatic View. AAMAS 2024: 2701-2705 - [c151]Valentin Zech, Niclas Boehmer, Edith Elkind, Nicholas Teh:
Multiwinner Temporal Voting with Aversion to Change. ECAI 2024: 3236-3243 - [c150]Edith Elkind, Tzeh Yuan Neoh, Nicholas Teh:
Temporal Elections: Welfare, Strategyproofness, and Proportionality. ECAI 2024: 3292-3299 - [c149]Sonja Kraiczy, Edith Elkind:
A Lower Bound for Local Search Proportional Approval Voting. ESA 2024: 82:1-82:14 - [c148]Edith Elkind:
Group Fairness: Multiwinner Voting and Beyond (Invited Talk). ICALP 2024: 2:1-2:1 - [c147]Tim Franzmeyer, Edith Elkind, Philip Torr, Jakob Nicolaus Foerster, João F. Henriques:
Select to Perfect: Imitating desired behavior from large multi-agent data. ICLR 2024 - [c146]Edith Elkind, Ayumi Igarashi, Nicholas Teh:
Fair Division of Chores with Budget Constraints. SAGT 2024: 55-71 - [i79]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Continuous-Time Best-Response and Related Dynamics in Tullock Contests with Convex Costs. CoRR abs/2402.08541 (2024) - [i78]Tim Franzmeyer, Edith Elkind, Philip Torr, Jakob N. Foerster, João F. Henriques:
Select to Perfect: Imitating desired behavior from large multi-agent data. CoRR abs/2405.03735 (2024) - [i77]Srijoni Majumdar, Edith Elkind, Evangelos Pournaras:
Generative AI Voting: Fair Collective Choice is Resilient to LLM Biases and Inconsistencies. CoRR abs/2406.11871 (2024) - [i76]Sonja Kraiczy, Edith Elkind:
A Lower Bound for Local Search Proportional Approval Voting. CoRR abs/2408.02300 (2024) - [i75]Valentin Zech, Niclas Boehmer, Edith Elkind, Nicholas Teh:
Multiwinner Temporal Voting with Aversion to Change. CoRR abs/2408.11017 (2024) - [i74]Edith Elkind, Tzeh Yuan Neoh, Nicholas Teh:
Temporal Elections: Welfare, Strategyproofness, and Proportionality. CoRR abs/2408.13637 (2024) - 2023
- [j39]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Keep your distance: Land division with separation. Comput. Geom. 113: 102006 (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) - [c145]Edith Elkind:
Proportionality in Multiwinner Voting: The Power of Local Search. AAMAS 2023: 4 - [c144]Wei-Chen Lee, David Hyland, Alessandro Abate, Edith Elkind, Jiarui Gan, Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
k-Prize Weighted Voting Game. AAMAS 2023: 2049-2057 - [c143]Edith Elkind, Warut Suksompong, Nicholas Teh:
Settling the Score: Portioning with Cardinal Preferences. ECAI 2023: 621-628 - [c142]Edith Elkind:
Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk). ISAAC 2023: 1:1-1:3 - [c141]Sonja Kraiczy, Edith Elkind:
An Adaptive and Verifiably Proportional Method for Participatory Budgeting. WINE 2023: 438-455 - [i73]Wei-Chen Lee, David Hyland, Alessandro Abate, Edith Elkind, Jiarui Gan, Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
k-Prize Weighted Voting Games. CoRR abs/2302.13888 (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) - [i71]Edith Elkind, Warut Suksompong, Nicholas Teh:
Settling the Score: Portioning with Cardinal Preferences. CoRR abs/2307.15586 (2023) - [i70]Sonja Kraiczy, Edith Elkind:
An Adaptive and Verifiably Proportional Method for Participatory Budgeting. CoRR abs/2310.10215 (2023) - [i69]Edith Elkind, Svetlana Obraztsova, Nicholas Teh:
Temporal Fairness in Multiwinner Voting. CoRR abs/2312.04417 (2023) - [i68]Giannis Tyrovolas, Andrei Constantinescu, Edith Elkind:
Unravelling Expressive Delegations: Complexity and Normative Analysis. CoRR abs/2312.11932 (2023) - 2022
- [j37]Edith Elkind, Nicolas Maudet, Warut Suksompong:
Guest editorial: special issue on fair division. Auton. Agents Multi Agent Syst. 36(2): 33 (2022) - [j36]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Mind the gap: Cake cutting with separation. Artif. Intell. 313: 103783 (2022) - [j35]Jiarui Gan, Edith Elkind, Sarit Kraus, Michael J. Wooldridge:
Defense coordination in security games: Equilibrium analysis and mechanism design. Artif. Intell. 313: 103791 (2022) - [j34]Dominik Peters, Lan Yu, Hau Chan, Edith Elkind:
Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results. J. Artif. Intell. Res. 73: 231-276 (2022) - [c140]Edith Elkind, Abheek Ghosh, Paul Goldberg:
Complexity of Deliberative Coalition Formation. AAAI 2022: 4975-4982 - [c139]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. AAAI 2022: 4983-4990 - [c138]Edith Elkind, Minming Li, Houyu Zhou:
Facility Location With Approval Preferences: Strategyproofness and Fairness. AAMAS 2022: 391-399 - [c137]Sonja Kraiczy, Edith Elkind:
Exact Learning of Preference Structure: Single-peaked Preferences and Beyond. ICML 2022: 11598-11612 - [c136]Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh:
Better Collective Decisions via Uncertainty Reduction. IJCAI 2022: 24-30 - [c135]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Contests to Incentivize a Target Group. IJCAI 2022: 279-285 - [c134]Sonja Kraiczy, Edith Elkind:
Explaining Preferences by Multiple Patterns in Voters' Behavior. IJCAI 2022: 370-376 - [c133]Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa:
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. NeurIPS 2022 - [c132]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy. SAGT 2022: 133-150 - [c131]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. SAGT 2022: 472-489 - [c130]Edith Elkind, Sonja Kraiczy, Nicholas Teh:
Fairness in Temporal Slot Assignment. SAGT 2022: 490-507 - [i67]Sonja Kraiczy, Edith Elkind:
Explaining Preferences by Multiple Patterns in Voters' Behavior. CoRR abs/2201.11195 (2022) - [i66]Edith Elkind, Abheek Ghosh, Paul Goldberg:
Complexity of Deliberative Coalition Formation. CoRR abs/2202.12594 (2022) - [i65]Edith Elkind, Abheek Ghosh, Paul Goldberg:
Contests to Incentivize a Target Group. CoRR abs/2204.14051 (2022) - [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) - [i63]Edith Elkind, Martin Lackner, Dominik Peters:
Preference Restrictions in Computational Social Choice: A Survey. CoRR abs/2205.09092 (2022) - [i62]Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh:
Better Collective Decisions via Uncertainty Reduction. CoRR abs/2207.04983 (2022) - [i61]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy. CoRR abs/2207.08151 (2022) - 2021
- [j33]Edith Elkind, Jiarui Gan, Svetlana Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris:
Protecting elections by recounting ballots. Artif. Intell. 290: 103401 (2021) - [j32]Aishwarya Agarwal, Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling games on graphs. Artif. Intell. 301: 103576 (2021) - [c129]Andrei Costin Constantinescu, Edith Elkind:
Proportional Representation under Single-Crossing Preferences Revisited. AAAI 2021: 5286-5293 - [c128]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Mind the Gap: Cake Cutting With Separation. AAAI 2021: 5330-5338 - [c127]Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon:
United for Change: Deliberative Coalition Formation to Change the Status Quo. AAAI 2021: 5339-5346 - [c126]Ben Abramowitz, Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon:
Democratic Forking: Choosing Sides with Social Choice. ADT 2021: 341-356 - [c125]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Graphical Cake Cutting via Maximin Share. IJCAI 2021: 161-167 - [c124]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Keep Your Distance: Land Division With Separation. IJCAI 2021: 168-174 - [c123]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Contest Design with Threshold Objectives. WINE 2021: 554 - [i60]Ben Abramowitz, Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon:
Democratic Forking: Choosing Sides with Social Choice. CoRR abs/2103.03652 (2021) - [i59]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Graphical Cake Cutting via Maximin Share. CoRR abs/2105.04755 (2021) - [i58]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Keep Your Distance: Land Division With Separation. CoRR abs/2105.06669 (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) - [i56]Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Contest Design with Threshold Objectives. CoRR abs/2109.03179 (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) - [i54]Edith Elkind, Judy Goldsmith, Anja Rey, Jörg Rothe:
Coalition Formation Games (Dagstuhl Seminar 21331). Dagstuhl Reports 11(7): 1-15 (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: 340-349 - [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] - [i53]Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon:
Egalitarian Deliberative Decision Making. CoRR abs/2001.08031 (2020) - [i52]Edith Elkind, Neel Patel, Alan Tsang, Yair Zick:
Keeping Your Friends Close: Land Allocation with Friends. CoRR abs/2003.03558 (2020) - [i51]Niclas Boehmer, Edith Elkind:
Stable Roommate Problem with Diversity Preferences. CoRR abs/2004.14640 (2020) - [i50]Dominik Peters, Lan Yu, Hau Chan, Edith Elkind:
Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results. CoRR abs/2007.06549 (2020) - [i49]Andrew Estornell, Sanmay Das, Edith Elkind, Yevgeniy Vorobeychik:
Election Control by Manipulating Issue Significance. CoRR abs/2007.09786 (2020) - [i48]Andrei Costin Constantinescu, Edith Elkind:
Proportional Representation under Single-Crossing Preferences Revisited. CoRR abs/2010.08637 (2020) - [i47]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Mind the Gap: Cake Cutting With Separation. CoRR abs/2012.06682 (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: 690-696 - [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]Yair Zick, Evangelos Markakis, Edith Elkind:
Stability Via Convexity and LP Duality in OCF Games. AAAI 2012: 1506-1512 - [c58]Svetlana Obraztsova, Edith Elkind:
Optimal Manipulation of Voting Rules. AAAI 2012: 2141-2147 - [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]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 J. Wooldridge:
Computational Aspects of Cooperative Game Theory. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2011, ISBN 978-3-031-00430-8 - [j10]Edith Elkind, Jérôme Lang:
Guest editorial: special issue on computational social choice. Auton. Agents Multi Agent Syst. 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 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 - [c49]Yair Zick, Edith Elkind:
Arbitrators in overlapping coalition formation games. AAMAS 2011: 55-62 - [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 Mag. 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]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 - [c36]Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov:
Frugal Mechanism Design via Spectral Techniques. FOCS 2010: 755-764 - [c35]Noam Hazon, Edith Elkind:
Complexity of Safe Strategic Voting. SAGT 2010: 210-221 - [c34]Yvo Desmedt, Edith Elkind:
Equilibria of plurality voting with abstentions. EC 2010: 347-356 - [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]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) - [i10]John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev:
Dynamics of Profit-Sharing Games. CoRR abs/1010.5081 (2010)
2000 – 2009
- 2009
- [j4]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
On the computational complexity of weighted voting games. Ann. Math. Artif. Intell. 56(2): 109-131 (2009) - [j3]Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron A. Peled:
On commutativity based Edge Lean search. Ann. Math. Artif. Intell. 56(2): 187-210 (2009) - [j2]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications. Math. Log. Q. 55(4): 362-376 (2009) - [j1]Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis, Maria Polukarov, Nicholas R. Jennings:
Stability of overlapping coalitions. SIGecom Exch. 8(1) (2009) - [c32]Piotr Faliszewski, Edith Elkind, Michael J. Wooldridge:
Boolean combinations of weighted voting games. AAMAS (1) 2009: 185-192 - [c31]Georgios Chalkiadakis, Edith Elkind, Maria Polukarov, Nicholas R. Jennings:
The price of democracy in coalition formation. AAMAS (1) 2009: 401-408 - [c30]Edith Elkind, Michael J. Wooldridge:
Hedonic coalition nets. AAMAS (1) 2009: 417-424 - [c29]Edith Elkind:
Voting: A View through the Algorithmic Lens. EC-Web 2009: 1 - [c28]Georgios Chalkiadakis, Edith Elkind, Nicholas R. Jennings:
Simple Coalitional Games with Beliefs. IJCAI 2009: 85-90 - [c27]Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein:
The Cost of Stability in Coalitional Games. SAGT 2009: 122-134 - [c26]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Swap Bribery. SAGT 2009: 299-310 - [c25]Edith Elkind, Dmitrii V. Pasechnik:
Computing the nucleolus of weighted voting games. SODA 2009: 327-335 - [c24]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On distance rationalizability of some voting rules. TARK 2009: 108-117 - [c23]Ning Chen, Edith Elkind, Nick Gravin:
Refining the Cost of Cheap Labor in Set System Auctions. WINE 2009: 447-454 - [i9]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Swap Bribery. CoRR abs/0905.3885 (2009) - [i8]Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein:
The Cost of Stability in Coalitional Games. CoRR abs/0907.4385 (2009) - [i7]Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov:
Frugal Mechanism Design via Spectral Techniques. CoRR abs/0912.3403 (2009) - 2008
- [c22]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
On the Dimensionality of Voting Games. AAAI 2008: 69-74 - [c21]Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind:
Manipulating the Quota in Weighted Voting Games. AAAI 2008: 215-220 - [c20]Yoram Bachrach, Edith Elkind:
Divide and conquer: false-name manipulations in weighted voting games. AAMAS (2) 2008: 975-982 - [c19]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
A tractable and expressive class of marginal contribution nets and its applications. AAMAS (2) 2008: 1007-1014 - [c18]Enrico H. Gerding, Zinovi Rabinovich, Andrew Byde, Edith Elkind, Nicholas R. Jennings:
Approximating mixed Nash equilibria using smooth fictitious play in simultaneous auctions. AAMAS (3) 2008: 1577-1580 - [c17]Edith Elkind, Georgios Chalkiadakis, Nicholas R. Jennings:
Coalition Structures in Weighted Voting Games. ECAI 2008: 393-397 - [c16]Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis, Nicholas R. Jennings:
Overlapping Coalition Formation. WINE 2008: 307-321 - [i6]Edith Elkind, Dmitrii V. Pasechnik:
Computing the nucleolus of weighted voting games. CoRR abs/0808.0298 (2008) - 2007
- [c15]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
Computational Complexity of Weighted Threshold Games. AAAI 2007: 718-723 - [c14]Edith Elkind, Blaise Genest, Doron A. Peled, Paola Spoletini:
Quantifying the Discord: Order Discrepancies in Message Sequence Charts. ATVA 2007: 378-393 - [c13]Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron A. Peled:
On Commutativity Based Edge Lean Search. ICALP 2007: 158-170 - [c12]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Computing good nash equilibria in graphical games. EC 2007: 162-171 - [c11]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Frugality ratios and improved truthful mechanisms for vertex cover. EC 2007: 336-345 - [c10]Edith Elkind:
Designing and learning optimal finite support auctions. SODA 2007: 736-745 - [c9]Edith Elkind, Blaise Genest, Doron A. Peled:
Detecting Races in Ensembles of Message Sequence Charts. TACAS 2007: 420-434 - [c8]Edith Elkind, S. Shaheen Fatima:
Maximizing Revenue in Sequential Auctions. WINE 2007: 491-502 - [i5]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Computing Good Nash Equilibria in Graphical Games. CoRR abs/cs/0703133 (2007) - 2006
- [c7]Edith Elkind, Blaise Genest, Doron A. Peled, Hongyang Qu:
Grey-Box Checking. FORTE 2006: 420-435 - [c6]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Nash equilibria in graphical games on trees revisited. EC 2006: 100-109 - [i4]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Frugality ratios and improved truthful mechanisms for vertex cover. CoRR abs/cs/0606044 (2006) - [i3]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Nash Equilibria in Graphical Games on Trees Revisited. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c5]Edith Elkind, Helger Lipmaa:
Small Coalitions Cannot Manipulate Voting. Financial Cryptography 2005: 285-297 - [c4]Edith Elkind, Helger Lipmaa:
Hybrid Voting Protocols and Hardness of Manipulation. ISAAC 2005: 206-215 - [c3]Edith Elkind:
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs. EC 2005: 108-116 - 2004
- [c2]Edith Elkind, Helger Lipmaa:
Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. Financial Cryptography 2004: 117-131 - [c1]Edith Elkind, Amit Sahai, Kenneth Steiglitz:
Frugality in path auctions. SODA 2004: 701-709 - 2003
- [i2]Edith Elkind, Helger Lipmaa:
Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. IACR Cryptol. ePrint Arch. 2003: 21 (2003) - 2002
- [i1]Edith Elkind, Amit Sahai:
A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack. IACR Cryptol. ePrint Arch. 2002: 42 (2002)
Coauthor Index
[j40] [c152] [j38] [i72] [c139] [c133] [c131] [i64] [i57] [i55] [j29] [c120] [c119] [c108] [i46] [j24] [j22] [c100] [c93] [i39] [j18] [j17] [c80] [i27] [i25] [c73] [c71] [c70] [i21] [c65] [c60] [i17] [j13] [j11] [c53] [j8] [c51] [c50] [c47] [c45] [i15] [c39] [c38] [c37] [c33] [i12] [i11] [c32] [c26] [c24] [i9] [c21]
Nicholas R. Jennings
aka: Nick R. Jennings
aka: Nick R. Jennings
Piotr Skowron 0001
aka: Piotr Krzysztof Skowron
aka: Piotr Krzysztof Skowron
Arkadii M. Slinko
aka: Arkadii Slinko
aka: Arkadii Slinko
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-10-28 20:15 CET 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:
