24 search results - page 4 / 5 » On revenue equivalence in truthful mechanisms |
SODA
2004
ACM
13 years 8 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...
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
Algorithmic mechanism design considers distributed settings where the participants, termed agents, cannot be assumed to follow the protocol but rather their own interests. The pro...
INFOCOM
2011
IEEE
12 years 10 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...
WINE
2010
Springer
13 years 4 months ago
2010
Springer
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
AAAI
2007
13 years 9 months ago
2007
In auction theory, agents are typically presumed to have perfect knowledge of their valuations. In practice, though, they may face barriers to this knowledge due to transaction co...