RELAXATION TECHNIQUES AND ASYNCHRONOUS ALGORITHMS FOR ON-LINE COMPUTATION OF NONCOOPERATIVE EQUILIBRIA.

Research output: Contribution to journalConference article

Abstract

The author introduces a relaxation technique that leads to online implementable algorithms that converge to equilibria, be they stable or unstable, and in some cases in a finite number of steps. Conditions are obtained for convergence of asynchronous algorithms that arise in the computation of equilibria in games in which the order of responses is not fixed a priori. The discussion and the analyses are primarily confined to two-person deterministic games, with extensions to N-player games and stochastic games briefly mentioned.

Original languageEnglish (US)
Pages (from-to)275-280
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - Dec 1 1987

Fingerprint

Asynchronous Algorithms
Game
Stochastic Games
Online Algorithms
Person
Unstable
Converge

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

@article{64e193066f6046ffa118cf08cdecff81,
title = "RELAXATION TECHNIQUES AND ASYNCHRONOUS ALGORITHMS FOR ON-LINE COMPUTATION OF NONCOOPERATIVE EQUILIBRIA.",
abstract = "The author introduces a relaxation technique that leads to online implementable algorithms that converge to equilibria, be they stable or unstable, and in some cases in a finite number of steps. Conditions are obtained for convergence of asynchronous algorithms that arise in the computation of equilibria in games in which the order of responses is not fixed a priori. The discussion and the analyses are primarily confined to two-person deterministic games, with extensions to N-player games and stochastic games briefly mentioned.",
author = "Basar, {M Tamer}",
year = "1987",
month = "12",
day = "1",
language = "English (US)",
pages = "275--280",
journal = "Proceedings of the IEEE Conference on Decision and Control",
issn = "0191-2216",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - RELAXATION TECHNIQUES AND ASYNCHRONOUS ALGORITHMS FOR ON-LINE COMPUTATION OF NONCOOPERATIVE EQUILIBRIA.

AU - Basar, M Tamer

PY - 1987/12/1

Y1 - 1987/12/1

N2 - The author introduces a relaxation technique that leads to online implementable algorithms that converge to equilibria, be they stable or unstable, and in some cases in a finite number of steps. Conditions are obtained for convergence of asynchronous algorithms that arise in the computation of equilibria in games in which the order of responses is not fixed a priori. The discussion and the analyses are primarily confined to two-person deterministic games, with extensions to N-player games and stochastic games briefly mentioned.

AB - The author introduces a relaxation technique that leads to online implementable algorithms that converge to equilibria, be they stable or unstable, and in some cases in a finite number of steps. Conditions are obtained for convergence of asynchronous algorithms that arise in the computation of equilibria in games in which the order of responses is not fixed a priori. The discussion and the analyses are primarily confined to two-person deterministic games, with extensions to N-player games and stochastic games briefly mentioned.

UR - http://www.scopus.com/inward/record.url?scp=0023548539&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023548539&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0023548539

SP - 275

EP - 280

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

ER -