GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2022
    In:  Autonomous Agents and Multi-Agent Systems Vol. 36, No. 2 ( 2022-10)
    In: Autonomous Agents and Multi-Agent Systems, Springer Science and Business Media LLC, Vol. 36, No. 2 ( 2022-10)
    Abstract: Residential segregation is a wide-spread phenomenon that can be observed in almost every major city. In these urban areas residents with different racial or socioeconomic background tend to form homogeneous clusters. Schelling’s famous agent-based model for residential segregation explains how such clusters can form even if all agents are tolerant, i.e., if they agree to live in mixed neighborhoods. For segregation to occur, all it needs is a slight bias towards agents preferring similar neighbors. Very recently, Schelling’s model has been investigated from a game-theoretic point of view with selfish agents that strategically select their residential location. In these games, agents can improve on their current location by performing a location swap with another agent who is willing to swap. We significantly deepen these investigations by studying the influence of the underlying topology modeling the residential area on the existence of equilibria, the Price of Anarchy and on the dynamic properties of the resulting strategic multi-agent system. Moreover, as a new conceptual contribution, we also consider the influence of locality, i.e., if the location swaps are restricted to swaps of neighboring agents. We give improved almost tight bounds on the Price of Anarchy for arbitrary underlying graphs and we present (almost) tight bounds for regular graphs, paths and cycles. Moreover, we give almost tight bounds for grids, which are commonly used in empirical studies. For grids we also show that locality has a severe impact on the game dynamics.
    Type of Medium: Online Resource
    ISSN: 1387-2532 , 1573-7454
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2022
    detail.hit.zdb_id: 2014972-4
    SSG: 24
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2015
    In:  Journal of Combinatorial Optimization Vol. 29, No. 1 ( 2015-1), p. 182-196
    In: Journal of Combinatorial Optimization, Springer Science and Business Media LLC, Vol. 29, No. 1 ( 2015-1), p. 182-196
    Type of Medium: Online Resource
    ISSN: 1382-6905 , 1573-2886
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2015
    detail.hit.zdb_id: 2005418-X
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Cambridge University Press (CUP) ; 2017
    In:  Mathematical Structures in Computer Science Vol. 27, No. 2 ( 2017-02), p. 197-214
    In: Mathematical Structures in Computer Science, Cambridge University Press (CUP), Vol. 27, No. 2 ( 2017-02), p. 197-214
    Abstract: We investigate the issues of existence and efficiency of lookahead equilibria in congestion games. Lookahead equilibria, whose study has been initiated by Mirrokni et al. (2012), correspond to the natural extension of pure Nash equilibria in which the players, when making use of global information in order to predict subsequent reactions of the other ones, have computationally limited capabilities.
    Type of Medium: Online Resource
    ISSN: 0960-1295 , 1469-8072
    Language: English
    Publisher: Cambridge University Press (CUP)
    Publication Date: 2017
    detail.hit.zdb_id: 2002549-X
    detail.hit.zdb_id: 1070265-9
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2016
    In:  Journal of Combinatorial Optimization Vol. 32, No. 4 ( 2016-11), p. 1036-1051
    In: Journal of Combinatorial Optimization, Springer Science and Business Media LLC, Vol. 32, No. 4 ( 2016-11), p. 1036-1051
    Type of Medium: Online Resource
    ISSN: 1382-6905 , 1573-2886
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2016
    detail.hit.zdb_id: 2005418-X
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2020
    In:  Journal of Combinatorial Optimization Vol. 40, No. 3 ( 2020-10), p. 610-635
    In: Journal of Combinatorial Optimization, Springer Science and Business Media LLC, Vol. 40, No. 3 ( 2020-10), p. 610-635
    Type of Medium: Online Resource
    ISSN: 1382-6905 , 1573-2886
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2020
    detail.hit.zdb_id: 2005418-X
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    World Scientific Pub Co Pte Ltd ; 2010
    In:  Journal of Interconnection Networks Vol. 11, No. 03n04 ( 2010-09), p. 97-120
    In: Journal of Interconnection Networks, World Scientific Pub Co Pte Ltd, Vol. 11, No. 03n04 ( 2010-09), p. 97-120
    Abstract: We consider the problem of sharing the cost of multicast transmissions in non-cooperative undirected networks where a set of receivers R wants to be connected to a common source s. The set of choices available to each receiver r ∈ R is represented by the set of all (s, r)-paths in the network. Given the choices performed by all the receivers, a public known cost sharing method determines the cost share to be charged to each of them. Receivers are selfish agents aiming to obtain the transmission at the minimum cost share and their interactions create a non-cooperative game. Devising cost sharing methods yielding games whose price of anarchy (price of stability), defined as the worst-case (best-case) ratio between the cost of a Nash equilibrium and that of an optimal solution, is not too high is thus of fundamental importance in non-cooperative network design. Moreover, since cost sharing games naturally arise in socio-economical contests, it is convenient for a cost sharing method to meet some constraining properties. In this paper, we first define several such properties and analyze their impact on the prices of anarchy and stability. We also reconsider all the methods known so far by classifying them according to which properties they satisfy and giving the first non-trivial lower bounds on their price of stability. Finally, we propose a new method, namely the free-riders method, which admits a polynomial time algorithm for computing a pure Nash equilibrium whose cost is at most twice the optimal one. Some of the ideas characterizing our approach have been independently proposed in Ref. 10.
    Type of Medium: Online Resource
    ISSN: 0219-2659 , 1793-6713
    Language: English
    Publisher: World Scientific Pub Co Pte Ltd
    Publication Date: 2010
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    World Scientific Pub Co Pte Ltd ; 2011
    In:  Journal of Interconnection Networks Vol. 12, No. 01n02 ( 2011-03), p. 1-17
    In: Journal of Interconnection Networks, World Scientific Pub Co Pte Ltd, Vol. 12, No. 01n02 ( 2011-03), p. 1-17
    Abstract: After almost seven years from its definition, 2 the price of stability of undirected network design games with fair cost allocation remains to be elusive. Its exact characterization has been achieved only for the basic case of two players 2,7 and, as soon as the number of players increases, the gap between the known upper and lower bounds becomes super-constant, even in the special variants of multicast and broadcast games. Motivated by the intrinsic difficulties that seem to characterize this problem, we analyze the already challenging case of three players and provide either new or improved bounds. For broadcast games, we prove an upper bound of 1.485 which exactly matches a lower bound given in Ref. 4; for multicast games, we show new upper and lower bounds which confine the price of stability in the interval [1.524; 1.532]; while, for the general case, we give an improved upper bound of 1.634. The techniques exploited in this paper are a refinement of those used in Ref. 7 and can be easily adapted to deal with all the cases involving a small number of players.
    Type of Medium: Online Resource
    ISSN: 0219-2659 , 1793-6713
    Language: English
    Publisher: World Scientific Pub Co Pte Ltd
    Publication Date: 2011
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2021
    In:  Algorithmica Vol. 83, No. 2 ( 2021-02), p. 447-530
    In: Algorithmica, Springer Science and Business Media LLC, Vol. 83, No. 2 ( 2021-02), p. 447-530
    Type of Medium: Online Resource
    ISSN: 0178-4617 , 1432-0541
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2021
    detail.hit.zdb_id: 1458414-1
    detail.hit.zdb_id: 53958-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2011
    In:  Algorithmica Vol. 61, No. 2 ( 2011-10), p. 274-297
    In: Algorithmica, Springer Science and Business Media LLC, Vol. 61, No. 2 ( 2011-10), p. 274-297
    Type of Medium: Online Resource
    ISSN: 0178-4617 , 1432-0541
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2011
    detail.hit.zdb_id: 1458414-1
    detail.hit.zdb_id: 53958-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2010
    In:  Theory of Computing Systems Vol. 47, No. 2 ( 2010-8), p. 507-530
    In: Theory of Computing Systems, Springer Science and Business Media LLC, Vol. 47, No. 2 ( 2010-8), p. 507-530
    Type of Medium: Online Resource
    ISSN: 1432-4350 , 1433-0490
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2010
    detail.hit.zdb_id: 1463181-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...