Results 31 to 40 of about 5,277,294 (228)

NECESSITY AND SUFFICIENCY FOR THE EXISTENCE OF A PURE-STRATEGY NASH EQUILIBRIUM

Journal of the Operations Research Society of Japan, 2012
In this paper, we consider a non-cooperative n-person game in the strategic form. As is well known, the game has a mixed-strategy Nash equilibrium. However, it does not always have a pure-strategy Nash equilibrium. Wherein, Topkis (1979), Iimura (2003), and Sato and Kawasaki (2009) provided a sufficient condition for the game to have a pure-strategy ...
Takeshita, Jun-ichi, Kawasaki, Hidefumi
openaire   +2 more sources

Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types [PDF]

, 2012
We extend the well-known fictitious play (FP) algorithm to compute pure-strategy Bayesian-Nash equilibria in private-value games of incomplete information with finite actions and continuous types (G-FACTs). We prove that, if the frequency distribution of
Rabinovich, Zinovi, Enrico H. Gerding, Victor Naroditskiy, Nicholas R. Jennings, Jennings, Nicholas R., Jennings, Nicholas R, Gerding, Enrico H, Zinovi Rabinovich, Naroditskiy, Victor, Gerding, Enrico H.   +9 more
core   +1 more source

Energy Management Based on Demand-Side Pricing: A Supermodular Game Approach

IEEE Access, 2017
This paper proposes a pricing strategy for energy management in the electricity market composed of one generation company, multiple competing utility companies, and consumers with heating, ventilation, and air conditionings, which participate in demand ...
Kai Ma, Congshan Wang, Jie Yang, Zhenhua Tian, Xinping Guan   +4 more
doaj   +1 more source

On the Existence of Pure Strategy Nash Equilibria in Large Games [PDF]

We consider an asymptotic version of Mas-Colell's theorem on the existence of pure strategy Nash equilibria in large games. Our result states that, if players' payoff functions are selected from an equicontinuous family, then all sufficiently large games
Guilherme Carmona
core   +4 more sources

A Logical–Computational Framework for Discovering Three-Player Games with Unique Pure Nash Equilibrium Payoffs

Mathematics
The Nash equilibrium is a central concept in game theory, widely used across economics, social sciences, computer science, and artificial intelligence. However, computing Nash equilibria, especially in multi-player games, is a complex and computationally
Jiajia Yang, Zhongtao Xie, Hongbo Hu, Xiang Du   +3 more
doaj   +1 more source

NASH E OS PASTEIS

Colloquium Humanarum, 2016
Game Theory and Nash equilibrium, are one of the great mathematical legacy of the twentieth century, it brings concepts widely used around the world in various fields of knowledge. However, usually the examples and solutions of their applicability come
Alexandre Godinho Bertoncello, Alessandra Harumi Sakai Santos   +1 more
doaj   +1 more source

A game theoretic approach to balance privacy risks and familial benefits

Scientific Reports, 2023
As recreational genomics continues to grow in its popularity, many people are afforded the opportunity to share their genomes in exchange for various services, including third-party interpretation (TPI) tools, to understand their predisposition to health
Jia Guo, Ellen Wright Clayton, Murat Kantarcioglu, Yevgeniy Vorobeychik, Myrna Wooders, Zhiyu Wan, Zhijun Yin, Bradley A. Malin   +7 more
doaj   +1 more source

Online-Offline Competition with Heterogeneous Consumers: An Example for No Existence of Pure Strategy Nash Equilibrium

Contributions to Game Theory and Management, 2022
Existing literature on competition between online and offline firms has focused on market conditions that guarantee the existence of a pure strategy Nash equilibrium. In this note, by constructing a concrete example, we provide a first attempt to show that the equilibrium existence result does not necessarily hold when consumers’ preferences are ...
Weixing Ford, Haipeng Han, Jie Zheng
openaire   +1 more source

A Matching Model for Ride-Sharing: A Non-Cooperative Game Approach Between Drivers and Riders

Smart Cities
This study proposes an optimal matching problem between drivers and riders as a generalised Nash equilibrium problem, which finds a solution where no drivers and riders have the incentive to change their strategy. The proposed model is formulated as a (D
Hiroshi Shimamoto
doaj   +1 more source

Searching One Pure-Strategy Nash Equilibrium Using a Distributed Computation Approach

Journal of Computers, 2014
A distributed implementation of Dang's Fixed-Point algorithm isproposed for searching one Nash equilibrium of a finite n-persongame in normal form. In this paper, the problem consists of twosubproblems. One is changing the problem form to a mixed 0-1 linearprogramming form. This process is derived from applications of theproperties of pure strategy and
Zhengtian Wu, Chuangyin Dang, Changan Zhu   +2 more
openaire   +1 more source