Logo Goletty

An algorithm for payoff space in C1-games
Journal Title AAPP | Physical, Mathematical, and Natural Sciences
Journal Abbreviation AAPP
Publisher Group Università Degli Studi Di Messina (UNIME)
Website http://cab.unime.it/journals/
PDF (1,662 kb)
   
Title An algorithm for payoff space in C1-games
Authors Carfì, David; Ricciardello, Angela
Abstract In this paper we present an algorithm implemented by MATLAB, and several examples completely realized by this algorithm, based on a method developed by one of the authors to determine the payoff-space of certain normal-form C1-games. Specifically, our study is based on a method able to determine the payoff space of normal form C1-games in n dimensions, that is for n-players normal form games whose payoff functions are defined on compact intervals of the real line and of class at least C1. In this paper we will determine the payoff space of such normal form C1-games in the particular case of two dimensions. The implementation of the algorithm gives the parametric form of the critical zone of a game in the bistrategy space and in the payoff space and their graphical representations. Moreover, we obtain the parametric form of the transformation of the topological boundary of the bistrategy space and of the transformation of the critical zone. The final aim of the program is to plot the entire payoff space of the considered games. One of the main motivations of our paper is that the mixed extension of a bimatrix game - the most used in the application of Game Theory - is a game of the type considered. For this reason we realized an algorithm that produces the payoff space and the critical zone of a game in normal form supported by a finite family of compact intervals of the real line. Resuming in details, the algorithm returns: the parametric form of the critical zone; the parametric form of the transformation of the topological boundary of the bistrategy space; the parametric form of  the transformation of the critical zone. All of them are graphically represented. To prove the efficiency of the algorithm,  we show several examples. Our final goal is to provide a valuable tool to study simply but completely normal form C1-games in two dimensions.
Publisher Accademia Peloritana dei Pericolanti
Date 2010-02-19
Source 0365-0359
Rights Articles and conference papers published in Atti della Accademia Peloritana dei Pericolanti – Classe di Scienze Fisiche, Matematiche e Naturali are distributed under the terms and conditions of a Creative Commons Attribution 3.0 Unported License (effective since 2009, Vol. 87). Correspondingly, authors who publish with this journal agree to the following terms:Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work´s authorship and initial publication in this journal.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal´s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access). 

 

See other article in the same Issue


Goletty © 2024