On convexity and monotonicity in generalized aggregative games

Giuseppe Belgioioso, Sergio Grammatico

Onderzoeksoutput: Bijdrage aan tijdschriftCongresartikelAcademicpeer review

4 Citaties (Scopus)

Uittreksel

Large-scale multi-agent systems arise in several control applications, such as demand side management in smart power networks, traffic control in intelligent transportation systems, and congestion control in communication networks. All these systems comprise a large population of noncooperative agents whose decision making process can be modeled as a generalized aggregative game. In this paper, we analyze the usual convexity assumption and the monotonicity of the so-called game mapping. Specifically, we show necessary and sufficient conditions on the problem data such that monotonicity holds. The derived conditions show that monotonicity cannot be expected in general.

TaalEngels
Pagina's14338-14343
Aantal pagina's6
TijdschriftIFAC-PapersOnLine
Volume50
Nummer van het tijdschrift1
DOI's
StatusGepubliceerd - 1 jul 2017

Vingerafdruk

Congestion control (communication)
Traffic control
Multi agent systems
Telecommunication networks
Decision making
Demand side management

Trefwoorden

    Citeer dit

    Belgioioso, Giuseppe ; Grammatico, Sergio. / On convexity and monotonicity in generalized aggregative games. In: IFAC-PapersOnLine. 2017 ; Vol. 50, Nr. 1. blz. 14338-14343
    @article{f2e4e28d6108412d8bbe745f06459cc4,
    title = "On convexity and monotonicity in generalized aggregative games",
    abstract = "Large-scale multi-agent systems arise in several control applications, such as demand side management in smart power networks, traffic control in intelligent transportation systems, and congestion control in communication networks. All these systems comprise a large population of noncooperative agents whose decision making process can be modeled as a generalized aggregative game. In this paper, we analyze the usual convexity assumption and the monotonicity of the so-called game mapping. Specifically, we show necessary and sufficient conditions on the problem data such that monotonicity holds. The derived conditions show that monotonicity cannot be expected in general.",
    keywords = "Aggregative games, generalized games, monotone game mapping",
    author = "Giuseppe Belgioioso and Sergio Grammatico",
    year = "2017",
    month = "7",
    day = "1",
    doi = "10.1016/j.ifacol.2017.08.2011",
    language = "English",
    volume = "50",
    pages = "14338--14343",
    journal = "IFAC-PapersOnLine",
    issn = "2405-8963",
    publisher = "Elsevier",
    number = "1",

    }

    On convexity and monotonicity in generalized aggregative games. / Belgioioso, Giuseppe; Grammatico, Sergio.

    In: IFAC-PapersOnLine, Vol. 50, Nr. 1, 01.07.2017, blz. 14338-14343.

    Onderzoeksoutput: Bijdrage aan tijdschriftCongresartikelAcademicpeer review

    TY - JOUR

    T1 - On convexity and monotonicity in generalized aggregative games

    AU - Belgioioso,Giuseppe

    AU - Grammatico,Sergio

    PY - 2017/7/1

    Y1 - 2017/7/1

    N2 - Large-scale multi-agent systems arise in several control applications, such as demand side management in smart power networks, traffic control in intelligent transportation systems, and congestion control in communication networks. All these systems comprise a large population of noncooperative agents whose decision making process can be modeled as a generalized aggregative game. In this paper, we analyze the usual convexity assumption and the monotonicity of the so-called game mapping. Specifically, we show necessary and sufficient conditions on the problem data such that monotonicity holds. The derived conditions show that monotonicity cannot be expected in general.

    AB - Large-scale multi-agent systems arise in several control applications, such as demand side management in smart power networks, traffic control in intelligent transportation systems, and congestion control in communication networks. All these systems comprise a large population of noncooperative agents whose decision making process can be modeled as a generalized aggregative game. In this paper, we analyze the usual convexity assumption and the monotonicity of the so-called game mapping. Specifically, we show necessary and sufficient conditions on the problem data such that monotonicity holds. The derived conditions show that monotonicity cannot be expected in general.

    KW - Aggregative games

    KW - generalized games

    KW - monotone game mapping

    UR - http://www.scopus.com/inward/record.url?scp=85044861521&partnerID=8YFLogxK

    U2 - 10.1016/j.ifacol.2017.08.2011

    DO - 10.1016/j.ifacol.2017.08.2011

    M3 - Conference article

    VL - 50

    SP - 14338

    EP - 14343

    JO - IFAC-PapersOnLine

    T2 - IFAC-PapersOnLine

    JF - IFAC-PapersOnLine

    SN - 2405-8963

    IS - 1

    ER -