357 search results - page 5 / 72 » Is Computational Complexity a Barrier to Manipulation |
156
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
162
click to vote
WSCG
2004
15 years 7 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
192
click to vote
AAMAS
2011
Springer
15 years 22 days ago
2011
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...
157
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
174
Voted
ICCS
2009
Springer
16 years 7 days ago
2009
Springer
Climate simulation will not grow to the ultrascale without new algorithms to overcome the scalability barriers blocking existing implementations. Until recently, climate simulation...