Interval methods for computing strong Nash equilibria of continuous games
Journal Title: Decision Making in Manufacturing and Services - Year 2015, Vol 9, Issue 1
Abstract
The problem of seeking strong Nash equilibria of a continuous game is considered. For some games these points cannot be found analytically, only numerically. Interval methods provide us an approach to rigorously verify the existence of equilibria in certain points. A proper algorithm is presented. We formulate and prove propositions, giving us features that have to be used by the algorithm (to the best knowledge of the authors, these propositions and properties are original). Parallelization of the algorithm is considered, also, and numerical results are presented. As a particular example, we consider the game of "misanthropic individuals", a game (invented by the frst author) that may have several strong Nash equilibria, depending on the number of players. Our algorithm is able to localize and verify these equilibria.
Authors and Affiliations
Bartłomiej Jacek Kubica, Adam Woźniak
Keywords
Related Articles
- EP ID EP420108
- DOI 10.7494/dmms.2015.9.1.63
- Views 94
- Downloads 0
Stretching the Least Squares to Embed Loss Functions Tables
The method of least squares is extended to accommodate a class of loss functions specified in the form of function tables. Each function table is embedded into the standard quadratic loss function so that the nonlinear l...
Ant Algorithm for AP-N Aimed at Optimization of Complex Systems
Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions an...
Game-Theoretic Approach to Bank Loan Repayment
The paper presents a model of a bank loan repayment as a signaling game with a set of discrete types of borrowers. The type of the borrower is the return on investment project. A possibility of renegotiation of the loan...
Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling
The paper presents the resource-constrained project scheduling problem with the makespan minimisation criterion. To solve the problem, the authors propose insertion algorithms which generate schedules with use of forward...
Scheduling Jobs with Linear Model of Simultaneous Ageing and Learning Effects
In the paper, we introduce some new scheduling model in which learning and aging effects are both considered simultaneously. In this model the actual processing time of the jobs depends only on its position in a schedule...