Sciweavers

554 search results - page 8 / 111
» Designing networks with good equilibria
Sort
View
ICDCS
2010
IEEE
13 years 11 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
CCR
2010
156views more  CCR 2010»
13 years 7 months ago
Evolvable network architectures: what can we learn from biology?
There is significant research interest recently to understand the evolution of the current Internet, as well as to design clean-slate Future Internet architectures. Clearly, even ...
Constantine Dovrolis, J. Todd Streelman
SIGECOM
2011
ACM
256views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Competitive equilibrium in two sided matching markets with general utility functions
In this paper, we study the class of competitive equilibria in two sided matching markets with general (non-quasilinear) utility functions. Mechanism design in general non-quasili...
Saeed Alaei, Kamal Jain, Azarakhsh Malekian
OL
2008
82views more  OL 2008»
13 years 6 months ago
An approximation algorithm for network design problems with downwards-monotone demand functions
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorith...
Michael Laszlo, Sumitra Mukherjee
SAGT
2010
Springer
151views Game Theory» more  SAGT 2010»
13 years 5 months ago
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
Abstract. We consider network congestion games in which a finite number of non-cooperative users select paths. The aim is to mitigate the inefficiency caused by the selfish users...
Dimitris Fotakis, George Karakostas, Stavros G. Ko...