Results 41 to 50 of about 7,890,208 (208)
Nash demand game and the Kalai–Smorodinsky solution [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anbarci, Nejat, Boyd III, John H.
openaire +3 more sources
A Matching Model for Ride-Sharing: A Non-Cooperative Game Approach Between Drivers and Riders
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
Insecure Property Rights and Conflicts: How to Solve Them?
According to the leading literature, the valid enforcement of property rights is a key ingredient for economic development. However, their enforcement can be problematic in international relations, which can be a valid approximation of an anarchic or ...
Dario Maimone Ansaldo Patti +2 more
doaj +1 more source
Complexity and Monitoring of Economic Operations Using a Game-Theoretic Model for Cloud Computing
In this study, a model is presented for allocating cloud computing resources based on economic considerations using tools from game theory. The model, called the Non-Cooperative Game Resource Allocation Algorithm (NCGRAA), is designed to achieve the ...
P Hema +5 more
doaj +1 more source
Applications of Variational Analysis to Strong Nash Equilibria
Game theory problems have a wide array of applications and intricate structures. Because of this, there are different types of solution concepts available in the literature.
Glenn Harris, Sien Deng
doaj +1 more source
Methods for Solving Generalized Nash Equilibrium
The generalized Nash equilibrium problem (GNEP) is an extension of the standard Nash equilibrium problem (NEP), in which each player's strategy set may depend on the rival player's strategies. In this paper, we present two descent type methods.
Biao Qu, Jing Zhao
doaj +1 more source
Successful Nash Equilibrium Agent for a Three-Player Imperfect-Information Game
Creating strong agents for games with more than two players is a major open problem in AI. Common approaches are based on approximating game-theoretic solution concepts such as Nash equilibrium, which have strong theoretical guarantees in two-player zero-
Sam Ganzfried +2 more
doaj +1 more source
Rationality and solutions to nonconvex bargaining problems: Rationalizability and Nash solutions [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Yongsheng, Yoshihara, Naoki
openaire +2 more sources
This paper is concerned with a non-zero sum differential game problem of an anticipated forward-backward stochastic differential delayed equation under partial information.
Yi Zhuang
doaj +1 more source
Non-cooperative support for the asymmetric Nash bargaining solution [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Britz Volker +2 more
openaire +4 more sources

