87 search results - page 11 / 18 » Congestion Games: Optimization in Competition |
SIGMETRICS
2004
ACM
15 years 5 months ago
2004
ACM
Traditional Peer-to-Peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can easily access information without contributing any ...
ATAL
2001
Springer
15 years 4 months ago
2001
Springer
We present a simple model of distributed multi-agent multi-issued contract negotiation for open systems where interactions are competitive and information is private and not shared...
MIG
2010
Springer
14 years 10 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
16 years 9 days 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...
151
click to vote
WINE
2010
Springer
14 years 9 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...