Optimization of an n-person game under linear side conditions

Krabs, Werner and Pickl, Stefan and Scheffran, Jürgen (2000) Optimization of an n-person game under linear side conditions.
Published in: Optimization, dynamics and economic analysis : essays in honor of Gustav Feichtinger. Springer 2000, pp. 79-85.

Abstract

This paper is concerned with n-person games which typically occur in mathematical conflict models [cf. cite{4}, cite{7},cite{9}]. These games are so called cost-games, in which every actor tries to minimize his own costs and the costs are interlinked by a system of linear inequalities. It is shown that, if the players cooperate, i.e., minimize the sum of all the costs, they achieve a Nash Equilibrium. In order to determine Nash Equilibria, the simplex method can be applied with respect to the dual problem. An important special case is discussed and numerical examples are presented.


Actions:
Download: [img] Postscript - Preprinted Version
Download (118kB) | Preview
Download: [img] PDF - Preprinted Version
Download (132kB) | Preview
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Collection Item
Citations: No citation data.
Uncontrolled Keywords: dynamic games simplex method Nash equilibrium
Subjects:
  • 93-XX Systems theory; control > 93Cxx Control systems, guided systems > 93C55 Discrete-time systems

  • 90-XX Operations research, mathematical programming > 90Bxx Operations research and management science > 90B50 Management decision making, including multiple objectives

    		•
    Divisions: Mathematical Institute
    Related URLs:
      Deposit Information:
      ZAIK Number: zaik2000-405
      Depositing User: Stefan Pickl
      Date Deposited: 12 Jun 2001 00:00
      Last Modified: 16 Jan 2012 14:02
      URI: http://e-archive.informatik.uni-koeln.de/id/eprint/405