Sciweavers

1662 search results - page 151 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
148
Voted
PEPM
2009
ACM
16 years 25 days ago
Self-adjusting computation: (an overview)
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
Umut A. Acar
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
ATAL
2007
Springer
15 years 10 months ago
Average-case tractability of manipulation in voting via the fraction of manipulators
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
Ariel D. Procaccia, Jeffrey S. Rosenschein
126
Voted
ATAL
2007
Springer
15 years 10 months ago
On the robustness of preference aggregation in noisy environments
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
Ariel D. Procaccia, Jeffrey S. Rosenschein, Gal A....
142
Voted
WWW
2005
ACM
16 years 4 months ago
Improving understanding of website privacy policies with fine-grained policy anchors
Website privacy policies state the ways that a site will use personal identifiable information (PII) that is collected from fields and forms in web-based transactions. Since these...
Stephen E. Levy, Carl Gutwin