30 search results - page 2 / 6 » Frugality in path auctions |
SODA
2008
ACM
13 years 6 months ago
2008
ACM
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
WINE
2007
Springer
13 years 11 months ago
2007
Springer
We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purch...
WINE
2010
Springer
13 years 3 months ago
2010
Springer
We consider collusion in path procurement auctions, where payments are determined using the VCG mechanism. We show that collusion can increase the utility of the agents, and in som...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...