468 search results - page 16 / 94 » Computationally Feasible Automated Mechanism Design: General... |
ICAC
2005
IEEE
14 years 27 days ago
2005
IEEE
When designing decentralised autonomic computing systems, a fundamental engineering issue is to assess systemwide behaviour. Such decentralised systems are characterised by the la...
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
While the deployment of WiFi networks continue to grow at an explosive rate, the multicast multimedia delivery service on WiFi compliant devices is still in its early stage of dev...
CLIMA
2007
13 years 8 months ago
2007
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
In this paper, we study the class of competitive equilibria in two sided matching markets with general (non-quasilinear) utility functions. Mechanism design in general non-quasili...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
The race conditions often limit the smallest feasible clock period that the optimal clock skew scheduling can achieve. Therefore, the combination of clock skew scheduling and dela...