Results 71 to 80 of about 875,430 (205)
Three essays on game theory [PDF]
The main text of this thesis is divided into three chapters. The three papers are contributions to the literature on equilibrium refinements in noncooperative game theory. Each chapter can be read independently of the rest.
González Pimienta, Carlos
core +1 more source
ON RISKY BEHAVIOR IN BIMATRIX GAMES [PDF]
The experiment engaging 50 participants was performed to model and identify the determinants of the players’ risky behavior. Here, a questionnaire and a bimatrix game containing the negative/zero payoffs were used to identify the players’ motives to play
Kubák Matú +3 more
doaj
On the exact polynomial time algorithm for a special class of bimatrix game
The Strategy Elimination (SE) algorithm was proposed in [2] and implemented by a sequence of Linear Programming (LP) problems. In this paper an efficient explicit solution is developed and the convergence to the Nash Equilibrium is proven. Keywords: game
Jonas Mockus, Martynas Sabaliauskas
doaj +1 more source
Geometry and equilibria in bimatrix games [PDF]
This thesis studies the application of geometric concepts and methods in the analysis of strategic-form games, in particular bimatrix games. Our focus is on three geometric concepts: the index, geometric algorithms for the computation of Nash ...
Balthasar, Anne
core
On Altruism and Spite in Bimatrix Games
One common assumption in game theory is that any player optimizes a utility function that takes into account only its own payoff. However, it has long been observed that in real life players may adopt an altruistic or even spiteful behaviour. As such, there are numerous attempts in the economics literature that strive to explain the fact that players ...
Michail Fasoulakis +3 more
openaire +2 more sources
Constrained Bimatrix Games in Wireless Communications
We develop a constrained bimatrix game framework that can be used to model many practical problems in many disciplines, including jamming in packetized wireless networks. In contrast to the widely used zero-sum framework, in bimatrix games it is no longer required that the sum of the players' utilities to be zero or constant, thus, can be used to model
Koorosh Firouzbakht +2 more
openaire +3 more sources
A simplicial algorithm approach to Nash equilibria in concave games [PDF]
Haake C-J, Su FE. A simplicial algorithm approach to Nash equilibria in concave games. Working Papers. Institute of Mathematical Economics. Vol 382.
Claus-jochen Haake +3 more
core
On the Effect of Risk Aversion in Bimatrix Games [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Berden Caroline, Peters Hans
openaire +4 more sources
A note on bimatrix game maximal Selten subsets [PDF]
: In this paper, we implement automatic procedures to enumerate all Nash maximal subsets of a bimatrix game and compute their dimensions. We propose a linear programming approach to identify extreme perfect Nash equilibria, enumerate all Selten maximal ...
Pierre Hansen +5 more
core +2 more sources
PENYELESAIAN GAME DENGAN MATRIK PEMBAYARAN GANDA (BIMATRIX GAME) DENGAN METODE PENAWARAN NASH [PDF]
Metode penawaran Nash adalah merupakan salah satu metode pendekatan untuk menyelesaiakan game dengan matrik pembayaran ganda (Bimatrig game). Dengan Metode penawaran ini, bentuk Bimatrix Game dibawa kebentuk 2-person zero-sum game dimana strategi ...
Harsunanto , Harsunanto
core +1 more source

