Results 1  10
of
9,562
On the Complexity of Nash Dynamics and Sink equilibria
, 2009
"... Studying Nash dynamics is an important approach for analyzing the outcome of games with repeated selfish behavior of selfinterested agents. Sink equilibria has been introduced by Goemans, Mirrokni, and Vetta for studying social cost on Nash dynamics over pure strategies in games. However, they do n ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
not address the complexity of sink equilibria in these games. Recently, Fabrikant and Papadimitriou initiated the study of the complexity of Nash dynamics in two classes of games. In order to completely understand the complexity of Nash dynamics in a variety of games, we study the following three questions
The Complexity of Pure Nash Equilibria
, 2004
"... We investigate from the computational viewpoint multiplayer games that are guaranteed to have pure Nash equilibria. We focus on congestion games, and show that a pure Nash equilibrium can be computed in polynomial time in the symmetric network case, while the problem is PLScomplete in general. ..."
Abstract

Cited by 172 (6 self)
 Add to MetaCart
We investigate from the computational viewpoint multiplayer games that are guaranteed to have pure Nash equilibria. We focus on congestion games, and show that a pure Nash equilibrium can be computed in polynomial time in the symmetric network case, while the problem is PLScomplete in general
Cognitive Radio: BrainEmpowered Wireless Communications
, 2005
"... Cognitive radio is viewed as a novel approach for improving the utilization of a precious natural resource: the radio electromagnetic spectrum. The cognitive radio, built on a softwaredefined radio, is defined as an intelligent wireless communication system that is aware of its environment and use ..."
Abstract

Cited by 1479 (4 self)
 Add to MetaCart
the discussion of interference temperature as a new metric for the quantification and management of interference, the paper addresses three fundamental cognitive tasks. 1) Radioscene analysis. 2) Channelstate estimation and predictive modeling. 3) Transmitpower control and dynamic spectrum management
The Impact of Trade on IntraIndustry Reallocations and Aggregate Industry Productivity
, 2002
"... This paper builds a dynamic industry model with heterogeneous firms that exhibits the mechanisms by which trade causes reallocations of resources among firms in an industry. The paper shows how the exposure to trade will induce only the more productive firms to enter the export market (while some le ..."
Abstract

Cited by 1538 (24 self)
 Add to MetaCart
This paper builds a dynamic industry model with heterogeneous firms that exhibits the mechanisms by which trade causes reallocations of resources among firms in an industry. The paper shows how the exposure to trade will induce only the more productive firms to enter the export market (while some
Qualitative process theory
 MIT AI Lab Memo
, 1982
"... Objects move, collide, flow, bend, heat up, cool down, stretch, compress. and boil. These and other things that cause changes in objects over time are intuitively characterized as processes. To understand commonsense physical reasoning and make programs that interact with the physical world as well ..."
Abstract

Cited by 884 (92 self)
 Add to MetaCart
as people do we must understand qualitative reasoning about processes, when they will occur, their effects, and when they will stop. Qualitative process theory defines a simple notion of physical process that appears useful as a language in which to write dynamical theories. Reasoning about processes also
The Complexity of Nash Equilibria
, 2008
"... The Internet owes much of its complexity to the large number of entities that run it and use it. These entities have different and potentially conflicting interests, so their interactions are strategic in nature. Therefore, to understand these interactions, concepts from Economics and, most importan ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
on whether such equilibria are efficiently computable. After all, why should we expect a group of rational agents to behave in a fashion that requires exponential time to be computed? Motivated by this question, we study the computational complexity of the Nash equilibrium. We show that computing a Nash
Nash equilibria: Complexity, symmetries, and approximation
 Computer Science Review
"... Dedicated to Christos Papadimitriou, the eternal adolescent We survey recent joint work with Christos Papadimitriou and Paul Goldberg on the computational complexity of Nash equilibria. We show that finding a Nash equilibrium in normal form games is computationally intractable, but in an unusual way ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Dedicated to Christos Papadimitriou, the eternal adolescent We survey recent joint work with Christos Papadimitriou and Paul Goldberg on the computational complexity of Nash equilibria. We show that finding a Nash equilibrium in normal form games is computationally intractable, but in an unusual
The complexity of game dynamics: Bgp oscillations, sink equilibria, and beyond
 In SODA ’08: Proceedings of the nineteenth annual ACMSIAM symposium on Discrete algorithms
, 2008
"... We settle the complexity of a wellknown problem in networking by establishing that it is PSPACEcomplete to tell whether a system of path preferences in the BGP protocol [25] can lead to oscillatory behavior; one key insight is that the BGP oscillation question is in fact one about Nash dynamics. W ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
We settle the complexity of a wellknown problem in networking by establishing that it is PSPACEcomplete to tell whether a system of path preferences in the BGP protocol [25] can lead to oscillatory behavior; one key insight is that the BGP oscillation question is in fact one about Nash dynamics
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
 IN PROC. FOCS
, 2007
"... We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity of the associated problems. Specifically, we study the complexity of the following problem: given a finite game, Γ, with 3 ..."
Abstract

Cited by 68 (8 self)
 Add to MetaCart
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity of the associated problems. Specifically, we study the complexity of the following problem: given a finite game, Γ, with 3
Computing nash equilibria for scheduling on restricted parallel links
 In Proceedings of the 36th Annual ACM Symposium on the Thoery of Computing (STOC’04
, 2004
"... We consider the problem of routing n users on m parallel links under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. So, this problem is equivalent to the correspondingly restricted scheduling problem of assigning n jobs to m parallel ma ..."
Abstract

Cited by 61 (12 self)
 Add to MetaCart
allel machines. In a Nash equilibrium, no user may improve its own Individual Cost (latency) by unilaterally switching to another link from its set of allowed links. For identical links, we present, as our main result, a polynomial time algorithm to compute from any given assignment a Nash equilibrium with non
Results 1  10
of
9,562