Sciweavers

2024 search results - page 308 / 405
» The cost of social agents
Sort
View
CPAIOR
2008
Springer
15 years 8 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 8 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
IAT
2006
IEEE
16 years 14 days ago
Autonomous Mobile Programs
To manage load on large and dynamic networks we have developed Autonomous Mobile Programs (AMPs) that periodically use a cost model to decide where to execute. A disadvantage of d...
Xiao Yan Deng, Philip W. Trinder, Greg Michaelson
FOCS
2005
IEEE
16 years 22 hour ago
Beyond VCG: Frugality of Truthful Mechanisms
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the ï¬...
Anna R. Karlin, David Kempe, Tami Tamir
PODC
2004
ACM
15 years 12 months ago
On the expected payment of mechanisms for task allocation
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Artur Czumaj, Amir Ronen