On two-point Nash equilibria in bimatrix games with convexity properties

Wojciech Połowczuk

Applicationes Mathematicae (2006)

  • Volume: 33, Issue: 1, page 71-84
  • ISSN: 1233-7234

Abstract

top
This paper considers bimatrix games with matrices having concavity properties. The games described by such payoff matrices well approximate two-person non-zero-sum games on the unit square, with payoff functions F₁(x,y) concave in x for each y, and/or F₂(x,y) concave in y for each x. For these games it is shown that there are Nash equilibria in players' strategies with supports consisting of at most two points. Also a simple search procedure for such Nash equilibria is given.

How to cite

top

Wojciech Połowczuk. "On two-point Nash equilibria in bimatrix games with convexity properties." Applicationes Mathematicae 33.1 (2006): 71-84. <http://eudml.org/doc/279324>.

@article{WojciechPołowczuk2006,
abstract = {This paper considers bimatrix games with matrices having concavity properties. The games described by such payoff matrices well approximate two-person non-zero-sum games on the unit square, with payoff functions F₁(x,y) concave in x for each y, and/or F₂(x,y) concave in y for each x. For these games it is shown that there are Nash equilibria in players' strategies with supports consisting of at most two points. Also a simple search procedure for such Nash equilibria is given.},
author = {Wojciech Połowczuk},
journal = {Applicationes Mathematicae},
keywords = {non-zero-sum game; concave/convex game; Nash equilibrium},
language = {eng},
number = {1},
pages = {71-84},
title = {On two-point Nash equilibria in bimatrix games with convexity properties},
url = {http://eudml.org/doc/279324},
volume = {33},
year = {2006},
}

TY - JOUR
AU - Wojciech Połowczuk
TI - On two-point Nash equilibria in bimatrix games with convexity properties
JO - Applicationes Mathematicae
PY - 2006
VL - 33
IS - 1
SP - 71
EP - 84
AB - This paper considers bimatrix games with matrices having concavity properties. The games described by such payoff matrices well approximate two-person non-zero-sum games on the unit square, with payoff functions F₁(x,y) concave in x for each y, and/or F₂(x,y) concave in y for each x. For these games it is shown that there are Nash equilibria in players' strategies with supports consisting of at most two points. Also a simple search procedure for such Nash equilibria is given.
LA - eng
KW - non-zero-sum game; concave/convex game; Nash equilibrium
UR - http://eudml.org/doc/279324
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.