108 search results - page 19 / 22 » Computing Approximate Nash Equilibria in Network Congestion ... |
GAMESEC
2010
13 years 4 months ago
2010
Abstract. Even the most well-motivated models of information security have application limitations due to the inherent uncertainties involving risk. This paper exemplifies a formal...
WIOPT
2010
IEEE
13 years 4 months ago
2010
IEEE
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
TSP
2008
13 years 6 months ago
2008
Decentralized activation in wireless sensor networks is investigated for energy-efficient monitoring using the theory of global games. Given a large number of sensors which can ope...
CCS
2009
ACM
14 years 1 months ago
2009
ACM
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
AAAI
2012
11 years 9 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...