Sciweavers

881 search results - page 55 / 177
» Solving satisfiability problems with preferences
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
14 years 2 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
ECAI
2010
Springer
13 years 7 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
14 years 3 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...
ICALP
1999
Springer
14 years 1 months ago
Stable Marriage with Incomplete Lists and Ties
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasu...
SAC
2008
ACM
13 years 8 months ago
A constraint hierarchies approach to geometric constraints on sketches
We propose an approach that uses preferences on the constraints in order to deal with over-constrained geometric constraint problems. This approach employs constraint hierarchies,...
Christophe Jermann, Hiroshi Hosobe