Algorithms for payoff trajectories in C 1 parametric games

11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In 2009 ([4]) a new procedure to determine the payoff space of non-parametric differentiable normal form games has been presented. Then, the new procedure has been applied (in [1]) to numerically determine an original type of 3-dimensional representation of the family of payoff spaces in normal-form C 1 parametric games, with two players. In this work, the method in [4] has been pointed out and assumed with the aim of realizing an algorithm which (computationally) gives the real geometric representation of the payoff trajectory of normal-form C 1-parametric games, with two players. The application of our algorithm to several examples concludes the paper. Our analysis of parametric games, also, allows us to pass from the standard normal-form games to their coopetitive extension, as already illustrated in several applicative papers by D. Carfì. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Carfì, D., & Ricciardello, A. (2012). Algorithms for payoff trajectories in C 1 parametric games. In Communications in Computer and Information Science (Vol. 300 CCIS, pp. 642–654). https://doi.org/10.1007/978-3-642-31724-8_67

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free