Sciweavers

157 search results - page 16 / 32
» Totality in arena games
Sort
View
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
13 years 11 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
AI
2008
Springer
13 years 7 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
CONCUR
2010
Springer
13 years 7 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
COMCOM
2008
120views more  COMCOM 2008»
13 years 7 months ago
Game theoretic models for detecting network intrusions
In this paper, we study using game theory the problem of detecting intrusions in wired infrastructure networks. Detection is accomplished by sampling a subset of the transmitted p...
Hadi Otrok, Mona Mehrandish, Chadi Assi, Mourad De...
IJNSEC
2006
205views more  IJNSEC 2006»
13 years 7 months ago
A Game Theoretic Formulation for Intrusion Detection in Mobile Ad Hoc Networks
Nodes in a mobile ad hoc network need to thwart various attacks and malicious activities. This is especially true for the ad hoc environment where there is a total lack of central...
Animesh Patcha, Jung-Min Park