Sciweavers

1662 search results - page 37 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ATAL
2007
Springer
13 years 11 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
ATAL
2007
Springer
13 years 11 months ago
Towards simulating billions of agents in thousands of seconds
Building multi-agent systems that can scale up to very large number of agents is a challenging research problem. In this paper, we present Distributed Multi Agent System Framework...
I. V. Aprameya Rao, Manish Jain, Kamalakar Karlapa...
EEMMAS
2007
Springer
14 years 1 months ago
Engineering Contextual Information for Pervasive Multiagent Systems
Multiagent systems for mobile and pervasive computing should extensively exploit contextual information both to adapt to user needs and to enable autonomic behavior. This raises th...
Gabriella Castelli, Marco Mamei, Franco Zambonelli
ATAL
2006
Springer
13 years 11 months ago
Junta distributions and the average-case complexity of manipulating elections
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ATAL
2008
Springer
13 years 9 months ago
A broader picture of the complexity of strategic behavior in multi-winner elections
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...