Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces

T. Harks, M. Klimm

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

Abstract

In this paper, we introduce a class of games which we term demand allocation games that combines the characteristics of finite games such as congestion games and continuous games such as cournot oligopolies. In a strategy profile each player may choose both an action out of a finite set and a non-negative demand out of a convex and compact interval. The utility of each player is assumed to depend solely on the action, the chosen demand, and the aggregated demand on the action chosen. We show that this general class of games possess a pure nash equilibrium whenever the players’ utility functions satisfy the assumptions negative externality, decreasing marginal returns and homogeneity. If one of the assumptions is violated, then a pure nash equilibrium may fail to exist. We demonstrate the applicability of our results by giving several concrete examples of games that fit into our model.
Original languageEnglish
Title of host publicationInternet and Network Economics
Subtitle of host publication79th International Workshop, WINE 2011 Singapore, December 2011 Proceedings
EditorsNing Chen, Edith Elkind, Elias Koutsoupias
Pages194-205
Volume7090
DOIs
Publication statusPublished - 1 Jan 2011
EventInternet and Network Economics - 7th International Workshop -
Duration: 1 Jan 20111 Jan 2011

Publication series

SeriesLecture Notes in Computer Science
Number7090
ISSN0302-9743

Conference

ConferenceInternet and Network Economics - 7th International Workshop
Period1/01/111/01/11

Cite this