Results 141 to 150 of about 393 (180)
Some of the next articles are maybe not open access.
Noncooperative Games: Extensions
2015In Chaps. 2–5 we have studied noncooperative games in which the players have finitely many (pure) strategies. The reason for the finiteness restriction is that in such games special results hold, such as the existence of a value and optimal strategies for two-person zero-sum games, and the existence of a Nash equilibrium in mixed strategies for finite ...
openaire +1 more source
NONCOOPERATIVE GAMES FROM TU GAMES WITH INFORMATION COST
International Game Theory Review, 2011From a special class of TU games with information cost, given by the problem of sharing the costs of facilities among users, we build a noncooperative game in which every player asks for the assessment of whom the users are. We analyze two models, "naming" game and majority decision game: the existence of equilibria is assured since the games are ...
openaire +2 more sources
The Theory of Voting and Equilibria in Noncooperative Games
Games and Economic Behavior, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On noncooperative nonlinear differential games
Kybernetika, 1999Summary: Noncooperative games with systems governed by nonlinear differential equations remain, in general, nonconvex even if continuously extended (i.e., relaxed) in terms of Young measures. However, if the individual payoff functionals are ``enough'' uniformly convex and the controlled system is only ``slightly'' nonlinear, then the relaxed game ...
openaire +2 more sources
Noncooperative foundations of the nucleolus in majority games
Games and Economic Behavior, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
1994
1.1 Fundamental concepts and elementary properties. Let the noncooperative game $$ \Gamma = \left\langle {I,\{ x_i \} _{i \in I} ,\{ H_i \} _{i \in I} } \right\rangle $$ (1.1) be finite (see 1.3, Chapter 1). For each i ∈ I, we set \( x_i = \{ x_i^{\text{1}} ,...,x_i^{mi} \} \).
openaire +1 more source
1.1 Fundamental concepts and elementary properties. Let the noncooperative game $$ \Gamma = \left\langle {I,\{ x_i \} _{i \in I} ,\{ H_i \} _{i \in I} } \right\rangle $$ (1.1) be finite (see 1.3, Chapter 1). For each i ∈ I, we set \( x_i = \{ x_i^{\text{1}} ,...,x_i^{mi} \} \).
openaire +1 more source
2017
This book is aimed at students interested in using game theory as a design methodology for solving problems in engineering and computer science. The book shows that such design challenges can be analyzed through game theoretical perspectives that help to pinpoint each problem's essence: Who are the players? What are their goals?
openaire +1 more source
This book is aimed at students interested in using game theory as a design methodology for solving problems in engineering and computer science. The book shows that such design challenges can be analyzed through game theoretical perspectives that help to pinpoint each problem's essence: Who are the players? What are their goals?
openaire +1 more source
Analysis of the n-person noncooperative supermodular multiobjective games
Operations Research Letters, 2023Rubono Setiawan
exaly