Hierarchical optimization: An introduction

G. Anandalingam, Terry Lee Friesz

Research output: Contribution to journalEditorial

111 Scopus citations

Abstract

Decision problems involving multiple agents invariably lead to conflict and gaming. In recent years, multi-agent systems have been analyzed using approaches that explicitly assign to each agent a unique objective function and set of decision variables; the system is defined by a set of common constraints that affect all agents. The decisions made by each agent in these approaches affect the decisions made by the others and their objectives. When strategies are selected simultaneously, in a noncooperative manner, solutions are defined as equilibrium points [13,51] so that at optimality no player can do better by unilaterally altering his choice. There are other types of noncooperative decision problems, though, where there is a hierarchical ordering of the agents, and one set has the authority to strongly influence the preferences of the other agents. Such situations are analyzed using a concept known as a Stackelberg strategy [13, 14,46]. The hierarchical optimization problem [11, 16, 23] conceptually extends the open-loop Stackelberg model to K players. In this paper, we provide a brief introduction and survey of recent work in the literature, and summarize the contributions of this volume. It should be noted that the survey is not meant to be exhaustive, but rather to place recent papers in context.

Original languageEnglish (US)
Pages (from-to)1-11
Number of pages11
JournalAnnals of Operations Research
Volume34
Issue number1
DOIs
Publication statusPublished - Dec 1 1992

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this