ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1401.3876
  4. Cited By
Determining Possible and Necessary Winners Given Partial Orders

Determining Possible and Necessary Winners Given Partial Orders

AAAI Conference on Artificial Intelligence (AAAI), 2008
16 January 2014
Lirong Xia
Vincent Conitzer
ArXiv (abs)PDFHTML

Papers citing "Determining Possible and Necessary Winners Given Partial Orders"

32 / 32 papers shown
Determining Winners in Elections with Absent Votes
Determining Winners in Elections with Absent VotesInternational Joint Conference on Artificial Intelligence (IJCAI), 2023
Qishen Han
Amélie Marian
Lirong Xia
118
0
0
11 Oct 2023
On the Complexity of Finding a Diverse and Representative Committee
  using a Monotone, Separable Positional Multiwinner Voting Rule
On the Complexity of Finding a Diverse and Representative Committee using a Monotone, Separable Positional Multiwinner Voting Rule
Kunal Relia
83
0
0
23 Nov 2022
Approval-Based Committee Voting under Incomplete Information
Approval-Based Committee Voting under Incomplete InformationAAAI Conference on Artificial Intelligence (AAAI), 2021
Aviram Imber
Jonas Israel
Markus Brill
B. Kimelfeld
199
9
0
27 Mar 2021
DeepGroup: Representation Learning for Group Recommendation with
  Implicit Feedback
DeepGroup: Representation Learning for Group Recommendation with Implicit Feedback
Sarina Sajadi Ghaemmaghami
Amirali Salehi-Abari
FedML
204
3
0
13 Mar 2021
Aggregating Incomplete and Noisy Rankings
Aggregating Incomplete and Noisy RankingsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2020
Eleni Psaroudaki
Alkis Kalavasis
Konstantinos Stavropoulos
279
9
0
02 Nov 2020
Necessarily Optimal One-Sided Matchings
Necessarily Optimal One-Sided Matchings
Hadi Hosseini
V. Menon
Nisarg Shah
Sujoy Sikdar
129
0
0
17 Jul 2020
A Parameterized Perspective on Protecting Elections
A Parameterized Perspective on Protecting ElectionsInternational Joint Conference on Artificial Intelligence (IJCAI), 2019
P. Dey
Neeldhara Misra
Swaprava Nath
Garima Shakya
AAML
164
9
0
28 May 2019
Lie on the Fly: Strategic Voting in an Iterative Preference Elicitation
  Process
Lie on the Fly: Strategic Voting in an Iterative Preference Elicitation ProcessGroup Decision and Negotiation (GDN), 2019
L. Dery
S. Obraztsova
Zinovi Rabinovich
Meir Kalech
230
8
0
13 May 2019
Local Distance Constrained Bribery in Voting
Local Distance Constrained Bribery in Voting
P. Dey
260
7
0
25 Jan 2019
Election with Bribed Voter Uncertainty: Hardness and Approximation
  Algorithm
Election with Bribed Voter Uncertainty: Hardness and Approximation AlgorithmAAAI Conference on Artificial Intelligence (AAAI), 2018
Lin Chen
Lei Xu
Xuesu Xiao
Zhimin Gao
W. Shi
130
7
0
07 Nov 2018
Computational Social Choice Meets Databases
Computational Social Choice Meets Databases
B. Kimelfeld
Phokion G. Kolaitis
Julia Stoyanovich
21
14
0
10 May 2018
Distributed Monitoring of Election Winners
Distributed Monitoring of Election Winners
Arnold Filtser
Nimrod Talmon
197
6
0
06 May 2018
Manipulative Elicitation -- A New Attack on Elections with Incomplete
  Preferences
Manipulative Elicitation -- A New Attack on Elections with Incomplete Preferences
P. Dey
114
6
0
10 Nov 2017
Resolving the Complexity of Some Fundamental Problems in Computational
  Social Choice
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
P. Dey
145
1
0
23 Mar 2017
On the Exact Amount of Missing Information that makes Finding Possible
  Winners Hard
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard
P. Dey
Neeldhara Misra
102
14
0
26 Oct 2016
Optimizing positional scoring rules for rank aggregation
Optimizing positional scoring rules for rank aggregation
I. Caragiannis
Xenophon Chatzigeorgiou
George A. Krimpas
Alexandros A. Voudouris
221
32
0
18 Sep 2016
Complexity of Manipulation with Partial Information in Voting
Complexity of Manipulation with Partial Information in Voting
P. Dey
Neeldhara Misra
Y. Narahari
242
27
0
15 Apr 2016
Reinstating Combinatorial Protections for Manipulation and Bribery in
  Single-Peaked and Nearly Single-Peaked Electorates
Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates
V. Menon
Kate Larson
118
14
0
25 Nov 2015
Parliamentary Voting Procedures: Agenda Control, Manipulation, and
  Uncertainty
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty
Robert Bredereck
Jiehua Chen
R. Niedermeier
T. Walsh
137
19
0
08 Sep 2015
Complexity of Manipulation in Elections with Top-truncated Ballots
Complexity of Manipulation in Elections with Top-truncated Ballots
V. Menon
Kate Larson
156
7
0
21 May 2015
Manipulation is Harder with Incomplete Votes
Manipulation is Harder with Incomplete Votes
P. Dey
Neeldhara Misra
Y. Narahari
168
0
0
30 Apr 2015
Prices Matter for the Parameterized Complexity of Shift Bribery
Prices Matter for the Parameterized Complexity of Shift Bribery
Robert Bredereck
Jiehua Chen
Piotr Faliszewski
A. Nichterlein
R. Niedermeier
223
63
0
04 Feb 2015
Possible and Necessary Allocations via Sequential Mechanisms
Possible and Necessary Allocations via Sequential MechanismsInternational Joint Conference on Artificial Intelligence (IJCAI), 2014
Haris Aziz
T. Walsh
Lirong Xia
85
48
0
06 Dec 2014
Aggregating partial rankings with applications to peer grading in
  massive online open courses
Aggregating partial rankings with applications to peer grading in massive online open coursesAdaptive Agents and Multi-Agent Systems (AAMAS), 2014
I. Caragiannis
George A. Krimpas
Alexandros A. Voudouris
162
48
0
17 Nov 2014
Possible Winners in Noisy Elections
Possible Winners in Noisy ElectionsAAAI Conference on Artificial Intelligence (AAAI), 2012
Krzysztof Wojtas
Krzysztof Magiera
Tomasz Miąsko
Piotr Faliszewski
136
26
0
26 May 2014
Detecting Possible Manipulators in Elections
Detecting Possible Manipulators in ElectionsAdaptive Agents and Multi-Agent Systems (AAMAS), 2014
P. Dey
Neeldhara Misra
Y. Narahari
179
9
0
09 Apr 2014
Cloning in Elections: Finding the Possible Winners
Cloning in Elections: Finding the Possible WinnersJournal of Artificial Intelligence Research (JAIR), 2011
Edith Elkind
Piotr Faliszewski
A. Slinko
211
73
0
18 Jan 2014
How Hard Is It to Control an Election by Breaking Ties?
How Hard Is It to Control an Election by Breaking Ties?European Conference on Artificial Intelligence (ECAI), 2013
Nicholas Mattei
Nina Narodytska
T. Walsh
247
210
0
23 Apr 2013
Possible and Necessary Winner Problem in Social Polls
Possible and Necessary Winner Problem in Social PollsAdaptive Agents and Multi-Agent Systems (AAMAS), 2013
Serge Gaspers
V. Naroditskiy
Nina Narodytska
T. Walsh
165
26
0
07 Feb 2013
The Complexity of Online Manipulation of Sequential Elections
The Complexity of Online Manipulation of Sequential ElectionsTheoretical Aspects of Rationality and Knowledge (TARK), 2012
E. Hemaspaandra
L. Hemaspaandra
J. Rothe
266
33
0
29 Feb 2012
Dominating Manipulations in Voting with Partial Information
Dominating Manipulations in Voting with Partial InformationAAAI Conference on Artificial Intelligence (AAAI), 2011
Vincent Conitzer
T. Walsh
Lirong Xia
174
97
0
27 Jun 2011
Swap Bribery
Swap BriberyAlgorithmic Game Theory (AGT), 2009
Edith Elkind
Piotr Faliszewski
A. Slinko
196
139
0
24 May 2009
1