Sciweavers

12597 search results - page 214 / 2520
» Complexity of Mechanism Design
Sort
View
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
ATAL
2004
Springer
15 years 9 months ago
Degree of Local Cooperation and Its Implication on Global Utility
In a cooperative multi-agent system that is situated in an evolving environment, agents need to dynamically adjust their negotiation attitudes towards different agents in order to...
Jiaying Shen, Xiaoqin Zhang, Victor R. Lesser
MATA
2004
Springer
199views Communications» more  MATA 2004»
15 years 9 months ago
Configuration Management for Networked Reconfigurable Embedded Devices
Distribution of product updates to embedded devices can increase product lifetimes for consumers and boost revenues for vendors. Dynamic provisioning of application solutions to e...
Timothy O'Sullivan, Richard Studdert
ISCA
2003
IEEE
93views Hardware» more  ISCA 2003»
15 years 9 months ago
Improving Dynamic Cluster Assignment for Clustered Trace Cache Processors
This work examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed cluster assignment techniques run into unique problems as issue wid...
Ravi Bhargava, Lizy Kurian John
SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
15 years 9 months ago
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
Chaki Ng, David C. Parkes, Margo I. Seltzer