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
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...
Maximization of an Asymmetric Utility Function by the Least Squares
This note points out that a utility maximization procedure proposed in an earlier paper may be reduced to the least squares.The utility function is asymmetric in the sense that for each cue an ideal value and a permissib...
Coordinating Contracts in SCM: A Review of Methods and Literature
Supply chain coordination through contracts has been a burgeoning area of re- search in recent years. In spite of rapid development of research, there are only a few structured analyses of assumptions, methods, and appli...
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...
Mixed Integer Programming Approaches to Planning and Scheduling in Electronics Supply Chains
This paper discusses mixed integer programming (MIP) approaches to planning and scheduling in electronics supply chains. First, the short-term detailed scheduling of wafer fabrication in semiconductor manufacturing and d...