Sciweavers

1662 search results - page 22 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
SIGECOM
2010
ACM
161views ECommerce» more  SIGECOM 2010»
14 years 9 days ago
Computation and incentives in combinatorial public projects
The Combinatorial Public Projects Problem s an abstraction of resource allocation problems in which agents have preferences over alternatives, and an outcome that is to be collect...
Dave Buchfuhrer, Michael Schapira, Yaron Singer
CONCURRENCY
2004
77views more  CONCURRENCY 2004»
13 years 7 months ago
Grids of agents for computer and telecommunication network management
The centralized system approach for computer and telecommunication network management has been presenting scalability problems along with the growth in the number and diversity of...
Marcos Dias de Assunção, Fernando Lu...
ICALP
2011
Springer
12 years 11 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
CAISE
2004
Springer
14 years 27 days ago
Agents to foster conscious design and reuse in architecture
In architecture companies, work is very often performed by several individuals. From conceptual design to the construction of a final product, the object passes through many hands,...
Daniel Pinho, Adriana Santarosa Vivacqua, Sé...
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 7 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...