Pathwise smooth splittable congestion games and inefficiency

Roberto Raimondo

Journal of Mathematical Economics, 2020, vol. 86, issue C, 15-23

Abstract: Very recently the inefficiency of Nash equilibria has been analyzed in the context of SplittableCongestionGames. These games are like the congestion games but allow the players to use convex combinations of subsets of resources. A new notion has been introduced in order to give bounds on the inefficiency or Price of Anarchy; such a notion has been termed the local smoothness. We present a unified framework where local smoothness and smoothness, a previously introduced notion, are presented as particular cases of a more general approach which we term pathwise smoothness. Such an approach is based partially on the Hadamard’s Lemma, which shows that it is possible to present any function, linear or not, by means of families of linear functions.

Keywords: Atomic; Congestion; Correlated equilibrium; Price of anarchy; Splittable; Hadamard’s Lemma (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304406819301089
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:86:y:2020:i:c:p:15-23

DOI: 10.1016/j.jmateco.2019.10.006

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().