SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We investigate the class of single-round, sealed-bid auctions for a set of identical items in unlimited supply. We adopt the worst-case competitive framework defined by [8, 4] th...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
Copyright holders have been investigating technological solutions to prevent distribution of copyrighted materials in peer-to-peer file sharing networks. A particularly popular t...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...