186 search results - page 13 / 38 » Bounded Fairness |
SPAA
2003
ACM
14 years 27 days ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
WINE
2005
Springer
14 years 1 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
IOR
2007
13 years 7 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
AHSWN
2010
13 years 7 months ago
2010
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...