41 search results - page 5 / 9 » On the Price of Truthfulness in Path Auctions |
AIR
2004
14 years 9 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
66
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—We propose a virtualization framework to separate the network operator (NO) who focuses on wireless resource management and service providers (SP) who target distinct objectives...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—Online spectrum auctions offer ample flexibility for bidders to request and obtain spectrum on-the-fly. Such flexibility, however, opens up new vulnerabilities to bidder mani...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
This paper reports on the design of a novel two-stage mechanism, based on strictly proper scoring rules, that motivates selfish rational agents to make a costly probabilistic estim...