Sciweavers

96 search results - page 15 / 20
» On a selfish caching game
Sort
View
IISWC
2006
IEEE
14 years 1 months ago
Workload Characterization of 3D Games
—The rapid pace of change in 3D game technology makes workload characterization necessary for every game generation. Comparing to CPU characterization, far less quantitative info...
Jordi Roca, Victor Moya Del Barrio, Carlos Gonz&aa...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Intrinsic robustness of the price of anarchy
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...
Tim Roughgarden
FC
2006
Springer
145views Cryptology» more  FC 2006»
13 years 11 months ago
Efficient Correlated Action Selection
Abstract. Participants in e-commerce and other forms of online collaborations tend to be selfish and rational, and therefore game theory has been recognized as particularly relevan...
Mikhail J. Atallah, Marina Blanton, Keith B. Frikk...
IISWC
2006
IEEE
14 years 1 months ago
Modeling Cache Sharing on Chip Multiprocessor Architectures
— As CMPs are emerging as the dominant architecture for a wide range of platforms (from embedded systems and game consoles, to PCs, and to servers) the need to manage on-chip res...
Pavlos Petoumenos, Georgios Keramidas, Håkan...
TON
2002
75views more  TON 2002»
13 years 7 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda