Results 1  10
of
6,909
Symmetries and the Complexity of Pure Nash Equilibrium
, 2006
"... Strategic games may exhibit symmetries in a variety of ways. A common aspect of symmetry, enabling the compact representation of games even when the number of players is unbounded, is that players cannot (or need not) distinguish between the other players. We define four classes of symmetric games b ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
by considering two additional properties: identical payoff functions for all players and the ability to distinguish oneself from the other players. Based on these varying notions of symmetry, we investigate the computational complexity of pure Nash equilibria. It turns out that in all four classes of games
Symmetries and the Complexity of Pure Nash Equilibrium
"... Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, is that players cannot, or need not, distinguish between the other players. We investigate the computational complexity of ..."
Abstract
 Add to MetaCart
of pure Nash equilibria in four classes of symmetric games obtained by considering two additional properties: identical payoff functions for all players and the ability to distinguish oneself from the other players. In contrast to other types of succinctly representable multiplayer games, the pure
Pure Nash Equilibrium in Capacitated Selfish Replication (CSR) Game
, 2014
"... We consider the capacitated selfish replication game with binary preferences. We first devise an algorithm which can reach a pure Nash equilibrium on trees after n steps where n is the number of nodes (players) in the game. Introducing an ordinal potential function for such a game, we determine the ..."
Abstract
 Add to MetaCart
We consider the capacitated selfish replication game with binary preferences. We first devise an algorithm which can reach a pure Nash equilibrium on trees after n steps where n is the number of nodes (players) in the game. Introducing an ordinal potential function for such a game, we determine
Finding Pure Nash Equilibrium for the ResourceConstrained Project Scheduling Problem
"... Abstract. The paper focuses on solving the ResourceConstrained Project Scheduling (RCPS) problem with a method based on intelligent agents. Parallelism for performing the tasks is allowed. Common and limited resources are available to all agents. The agents are noncooperative and compete with each ..."
Abstract
 Add to MetaCart
Nash equilibrium, and we show that in this case there is a guarantee of obtaining a pure Nash equilibrium in polynomial time complexity. The pure Nash equilibrium point for this congestion network will be a local optimum in the neighborhood structure of the projects, where no project can improve its
Approximating Pure Nash Equilibrium in Cut, Party Affiliation, and Satisfiability Games
"... Cut games and party affiliation games are wellknown classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete. In general potential games, even the problem of computing any finite approximation to a pure equilibrium is also PLScom ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Cut games and party affiliation games are wellknown classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete. In general potential games, even the problem of computing any finite approximation to a pure equilibrium is also PLS
NPhardness of pure Nash equilibrium in Scheduling and Connection Games
 IN PROCEEDINGS OF THE 35TH INTERNATIONAL CONFERENCE ON CURRENT TRENDS IN THEORY AND PRACTICE OF COMPUTER SCIENCE (SOFSEM
, 2009
"... We prove N Phardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desired property and then embed it to a larger game which encodes a N Phard problem in order to prove the complexity of the ..."
Abstract
 Add to MetaCart
We prove N Phardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desired property and then embed it to a larger game which encodes a N Phard problem in order to prove the complexity
A Pure Nash Equilibrium Guaranteeing Game Theoretical Replica Allocation Method for Reducing Web Access Time
 in Proc. of 12th International Conference on Parallel and Distributed Systems
, 2006
"... This paper proposes a noncooperative game theoretical replica allocation technique (NCOR) to reduce user perceived Web access delays. NCOR uses distributed agents that because of their local knowledge act in a selfinterested manner in order to enhance the performance of the servers that they repre ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
deterministic strategies, the system can exhibit Nash equilibrium. However, that may or may not guaranteed systemwide performance at a given time. Furthermore, their can be multiple Nash equilibria, making it difficult to decide which one is the best. Instead, we use the notion of pure Nash equilibrium, which if achieved
Discovering theorems in game theory: Twoperson games with unique pure Nash equilibrium payoffs
, 2007
"... In this paper we provide a logical framework for using computers to discover theorems in twoperson finite games in strategic form, and apply it to discover classes of games that have unique pure Nash equilibrium payoffs. We consider all possible classes of games that can be expressed by a conjuncti ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
In this paper we provide a logical framework for using computers to discover theorems in twoperson finite games in strategic form, and apply it to discover classes of games that have unique pure Nash equilibrium payoffs. We consider all possible classes of games that can be expressed by a
A pure nash equilibriumbased game theoretical method for data replication across multiple servers
 Knowledge and Data Engineering, IEEE Transactions on
, 2009
"... Abstractâ€”This paper proposes a noncooperative game theoretical technique to replicate data objects across a system of multiple servers in order to reduce userperceived Web access delays. The proposed technique uses computational agents that compete with each other to optimize the performance of the ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
on spontaneous and nondeterministic strategies. However, Nash equilibrium may or may not guarantee systemwide performance. Furthermore, there can be multiple Nash equilibria, making it difficult to decide which one is the best. In contrast, the proposed technique uses the notion of pure Nash equilibrium, which
Results 1  10
of
6,909