Sciweavers

294 search results - page 33 / 59
» The complexity of computing a Nash equilibrium
Sort
View
ESA
2009
Springer
111views Algorithms» more  ESA 2009»
15 years 4 months 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
INFOCOM
2007
IEEE
15 years 4 months ago
Non-Cooperative Scheduling of Multiple Bag-of-Task Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we analyze the behavior of K non-cooperative schedu...
Arnaud Legrand, Corinne Touati
ATAL
2007
Springer
15 years 4 months ago
An incentive mechanism for message relaying in unstructured peer-to-peer systems
Distributed message relaying is an important function of a peer-topeer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either ...
Cuihong Li, Bin Yu, Katia P. Sycara
WINE
2007
Springer
191views Economy» more  WINE 2007»
15 years 3 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 ...
CDC
2008
IEEE
143views Control Systems» more  CDC 2008»
15 years 4 months ago
On the use of numerical methods for analysis and control of nonlinear convective systems
Abstract— A common approach to designing feedback controllers for nonlinear partial differential equations (PDEs) is to linearize the system about an equilibrium and use the line...
Edward Allen, John A. Burns, David S. Gilliam