Sciweavers

170 search results - page 29 / 34
» Parallel Computation of Nash Equilibria in N-Player Games
Sort
View
GAMESEC
2010
139views Game Theory» more  GAMESEC 2010»
13 years 5 months ago
Design of Network Topology in an Adversarial Environment
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
Assane Gueye, Jean C. Walrand, Venkat Anantharam
GAMESEC
2010
119views Game Theory» more  GAMESEC 2010»
13 years 5 months ago
Uncertainty in Interdependent Security Games
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...
Benjamin Johnson, Jens Grossklags, Nicolas Christi...
WINE
2007
Springer
191views Economy» more  WINE 2007»
14 years 1 months ago
The Importance of Network Topology in Local Contribution Games
We consider a model of content contribution in peer-to-peer networks with linear quadratic payoffs and very general interaction patterns. We find that Nash equilibria of this gam...
Jacomo Corbo, Antoni Calvó-Armengol, David ...
SIGECOM
2009
ACM
102views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
On the price of mediation
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson...
MOBIHOC
2008
ACM
14 years 7 months ago
A game approach for multi-channel allocation in multi-hop wireless networks
Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-ho...
Lin Gao, Xinbing Wang