105 search results - page 9 / 21 » A Lower Bound on the Competitive Ratio of Truthful Auctions |
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
IJCAI
2007
13 years 10 months ago
2007
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
IPL
2010
13 years 7 months ago
2010
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
INFOCOM
2011
IEEE
13 years 12 days ago
2011
IEEE
—Dynamic spectrum allocation has proven promising for mitigating the spectrum scarcity problem. In this model, primary users lease chunks of under-utilized spectrum to secondary ...
SODA
1998
ACM
13 years 10 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...