Sciweavers

295 search results - page 12 / 59
» Games and Definability for System F
Sort
View
NOMS
2008
IEEE
14 years 1 months ago
Towards an efficient implementation of traceback mechanisms in autonomous systems
—One of the major problems due to denial of service attacks is the identification of fault packets. To resolve this problem, several IP traceback methods have been defined. In th...
Karima Boudaoud, F. LeBorgne
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
14 years 7 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
ICECCS
2007
IEEE
95views Hardware» more  ICECCS 2007»
14 years 1 months ago
A Novel Approach to the Detection of Cheating in Multiplayer Online Games
— Modern online multiplayer games are complex heterogeneous distributed systems comprised of servers and untrusted clients, which are often engineered under considerable commerci...
Peter Laurens, Richard F. Paige, Phillip J. Brooke...
JSAC
2008
102views more  JSAC 2008»
13 years 7 months ago
Inefficient Noncooperation in Networking Games of Common-Pool Resources
We study in this paper a noncooperative approach for sharing resources of a common pool among users, wherein each user strives to maximize its own utility. The optimality notion is...
Hisao Kameda, Eitan Altman
SAGA
2007
Springer
14 years 1 months ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis