233 search results - page 38 / 47 » Affine General Equilibrium Models |
IOR
2007
13 years 6 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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
—In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG)...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Unstructured networks (like ad-hoc or peer-to-peer networks) are networks without centralized control of their operation. Users make local decisions regarding whether to follow ...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
We study the interaction among users of unstructured file sharing applications, who compete for available network resources (link bandwidth or capacity) by opening multiple conne...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
We introduce a game setting called a joint process, where the history of actions determine the state, and the state and agent properties determine the payoff. This setting is a sp...