Sciweavers

554 search results - page 2 / 111
» Designing networks with good equilibria
Sort
View
ESA
2009
Springer
111views Algorithms» more  ESA 2009»
14 years 1 days ago
Exact and Approximate Equilibria for Optimal Group Network Formation
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
Elliot Anshelevich, Bugra Caskurlu
SIROCCO
2008
13 years 6 months ago
Computing Approximate Nash Equilibria in Network Congestion Games
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
Andreas Emil Feldmann, Heiko Röglin, Berthold...
PODC
2003
ACM
13 years 10 months ago
On a network creation game
We introduce a novel game that models the creation of Internet-like networks by selfish node-agents without central design or coordination. Nodes pay for the links that they esta...
Alex Fabrikant, Ankur Luthra, Elitza N. Maneva, Ch...
AAAI
2007
13 years 7 months ago
The Impact of Network Topology on Pure Nash Equilibria in Graphical Games
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
CEJCS
2011
78views more  CEJCS 2011»
12 years 5 months ago
Good versus optimal: Why network analytic methods need more systematic evaluation
: Network analytic method designed for the analysis of static networks promise to identify significant relational patterns that correlate with important structures in the complex ...
Katharina Anna Zweig