Results 31 to 40 of about 2,154,790 (237)

Existence of pure strategy Nash equilibrium in Bertrand–Edgeworth oligopolies [PDF]

Economics Letters, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 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

Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games

EURO Journal on Computational Optimization, 2020
The concept of leader-follower (or Stackelberg) equilibrium plays a central role in a number of real-world applications bordering on mathematical optimization and game theory.
Nicola Basilico, Stefano Coniglio, Nicola Gatti, Alberto Marchesi   +3 more
doaj   +1 more source

Spike-based decision learning of Nash equilibria in two-player games. [PDF]

PLoS Computational Biology, 2012
Humans and animals face decision tasks in an uncertain multi-agent environment where an agent's strategy may change in time due to the co-adaptation of others strategies.
Johannes Friedrich, Walter Senn
doaj   +1 more source

Pure Nash Equilibrium in a Capacitated Selfish Resource Allocation Game

IEEE Transactions on Control of Network Systems, 2018
A resource allocation game with identical preferences is considered where each player, as a node of an undirected unweighted network, tries to minimize his or her cost by caching an appropriate resource. Using a generalized ordinal potential function, a polynomial time algorithm is devised in order to obtain a pure-strategy Nash equilibrium (NE) when ...
Seyed Rasoul Etesami, Tamer Basar
openaire   +2 more sources

Pure Nash Equilibrium and Coordination of Players in Ride Sharing Games

CoRR, 2016
GAMES 2016, the 5th World Congress of the Game Theory ...
Tatsuya Iwase, Takahiro Shiga
openaire   +2 more sources

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

Game-Theoretic Based Distributed Scheduling Algorithms for Minimum Coverage Breach in Directional Sensor Networks

International Journal of Distributed Sensor Networks, 2014
A directional sensor network, where a lot of sensors are intensively and randomly deployed, is able to enhance coverage performances, since working directions can be partitioned into different K covers which are activated in a round-robin fashion.
Jin Li, Kun Yue, Weiyi Liu, Qing Liu
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 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