38 search results - page 5 / 8 » First-price path auctions |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
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 ï¬...
ACMICEC
2003
ACM
14 years 26 days ago
2003
ACM
We develop two algorithms to manage bid data in flexible, multi-unit double auctions. The ï¬rst algorithm is a multi-unit extension of the 4-HEAP algorithm, and the second is a ...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
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...
NIPS
2003
13 years 9 months ago
2003
The design of cooperative multi-robot systems is a highly active research area in robotics. Two lines of research in particular have generated interest: the solution of large, wea...
SIGECOM
2003
ACM
14 years 25 days ago
2003
ACM
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...