118 search results - page 15 / 24 » Fairness and optimality in congestion games |
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
The loss and delay experienced by packets travelling along an Internet network path are mainly governed by the characteristics of a bottleneck link, such as available data rate an...
MIG
2010
Springer
13 years 6 months ago
2010
Springer
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we introduce an effective congestion control scheme for TCP over hybrid wireless/wired networks comprising a multihop wireless IEEE 802.11 network and the wired Int...