1662 search results - page 47 / 333 » The Computational Complexity of Agent Design Problems |
IJCAI
2007
13 years 10 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
WCC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
FDL
2004
IEEE
14 years 15 days ago
2004
IEEE
System-on-Chip (SOC) and other complex distributed hardware/software systems contain heterogeneous components such as DSPs, micro-controllers, application specific logic etc., whi...
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
SIGECOM
2004
ACM
14 years 2 months ago
2004
ACM
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...