Dynamic resource allocation games

Guy Avni*, Thomas A. Henzinger, Orna Kupferman

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability.

Original languageAmerican English
Title of host publicationAlgorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings
EditorsMartin Gairing, Rahul Savani
PublisherSpringer Verlag
Pages153-166
Number of pages14
ISBN (Print)9783662533536
DOIs
StatePublished - 2016
Event9th International Symposium on Algorithmic Game Theory, SAGT 2016 - Liverpool, United Kingdom
Duration: 19 Sep 201621 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9928 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Symposium on Algorithmic Game Theory, SAGT 2016
Country/TerritoryUnited Kingdom
CityLiverpool
Period19/09/1621/09/16

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2016.

Fingerprint

Dive into the research topics of 'Dynamic resource allocation games'. Together they form a unique fingerprint.

Cite this