On the evaluation of election outcomes under uncertainty
type: Item
instance of: scholarly article
title: On the evaluation of election outcomes under uncertainty
zbMATH Open document ID: 1251.91029
author: Noam Hazon
author: Yonatan Aumann
author: Sarit Kraus
author: M. J. Wooldridge
published in: Artificial Intelligence
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 91B14
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 91B12
zbMATH DE Number: 6106691
zbMATH Keywords: computational social choice
zbMATH Keywords: voting rules
MaRDI profile type: Publication
full work available at URL: j.artint.2012.04.009
OpenAlex ID: W2140055348
cites work: Handbook of social choice and welfare. Vol. 1.
cites work: Single transferable vote resists strategic voting
cites work: The computational difficulty of manipulating an election
cites work: Voting schemes for which it can be difficult to tell who won the election
cites work: Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
cites work: Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
cites work: Towards a dichotomy for the possible winner problem in elections based on scoring rules
cites work: Q3266133
cites work: Q4220395
cites work: When are elections with few candidates hard to manipulate?
cites work: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
cites work: Parametrized complexity theory.
cites work: Q4198056
cites work: Incompleteness and incomparability in preference aggregation: complexity results
cites work: Determining Possible and Necessary Winners Given Partial Orders
DOI: 10.1016/J.ARTINT.2012.04.009
description: scientific article; zbMATH DE number 6106691