S-modular games, with queueing applications

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

47 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)449-475
Journal / PublicationQueueing Systems
Volume21
Issue number3-4
Publication statusPublished - Sep 1995
Externally publishedYes

Abstract

The notion of S-modularity was developed by Glasserman and Yao [9] in the context of optimal control of queueing networks. S-modularity allows the objective function to be supermodular in some variables and submodular in others. It models both compatible and conflicting incentives, and hence conveniently accommodates a wide variety of applications. In this paper, we introduce S-modularity into the context of n-player noncooperative games. This generalizes the well-known supermodular games of Topkis [22], where each player maximizes a supermodular payoff function (or equivalently, minimizes a submodular payoff function). We illustrate the theory through a variety of applications in queueing systems. © 1995 J.C. Baltzer AG, Science Publishers.

Research Area(s)

  • control of queues, convergence, Nash equilibrium, Noncooperative games, submodularity/supermodularity

Citation Format(s)

S-modular games, with queueing applications. / Yao, David D.

In: Queueing Systems, Vol. 21, No. 3-4, 09.1995, p. 449-475.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review