26 search results - page 1 / 6 » sigecom 2005 |
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
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
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
A set of jobs need to be served by a single server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The j...