Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

101

ECAI
2006
Springer

102views Artificial Intelligence» more ECAI 2006»

Computing Possible and Necessary Winners from Incomplete Partially-Ordered Preferences

15 years 6 months ago

Computing Possible and Necessary Winners from Incomplete Partially-Ordered Preferences

Download www.math.unipd.it

Maria Silvia Pini, Francesca Rossi, Kristen Brent

Real-time Traffic

Artificial Intelligence | ECAI 2006 |

claim paper

Related Content

» Winner determination in voting trees with incomplete preferences and weighted votes

» Incompleteness and Incomparability in Preference Aggregation

» Towards a dichotomy for the Possible Winner problem in elections based on scoring rules

» The Price of Neutrality for the Ranked Pairs Method

» Planning Partially for Situated Agents

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	ECAI
Authors	Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh

Comments (0)