On Stackelberg Strategies in Affine Congestion Games View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2015

AUTHORS

Vittorio Bilò , Cosimo Vinci

ABSTRACT

We investigate the efficiency of some Stackelberg strategies in congestion games with affine latency functions. A Stackelberg strategy is an algorithm that chooses a subset of players and assigns them a prescribed strategy with the purpose of mitigating the detrimental effect that the selfish behavior of the remaining uncoordinated players may cause to the overall performance of the system. The efficiency of a Stackelberg strategy is measured in terms of the price of anarchy of the pure Nash equilibria they induce. Three Stackelberg strategies, namely Largest Latency First, Cover and Scale, were already considered in the literature and non-tight upper and lower bounds on their price of anarchy were given. We reconsider these strategies and provide the exact bound on the price of anarchy of both Largest Latency First and Cover and a better upper bound on the price of anarchy of Scale. More... »

PAGES

132-145

References to SciGraph publications

Book

TITLE

Web and Internet Economics

ISBN

978-3-662-48994-9
978-3-662-48995-6

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-48995-6_10

DOI

http://dx.doi.org/10.1007/978-3-662-48995-6_10

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1053291738


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1402", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Applied Economics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/14", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Economics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Salento", 
          "id": "https://www.grid.ac/institutes/grid.9906.6", 
          "name": [
            "Department of Mathematics and Physics \u201cEnnio De Giorgi\u201d, University of Salento"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bil\u00f2", 
        "givenName": "Vittorio", 
        "id": "sg:person.012652036261.27", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012652036261.27"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Gran Sasso Science Institute", 
          "id": "https://www.grid.ac/institutes/grid.466750.6", 
          "name": [
            "Gran Sasso Science Institute"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Vinci", 
        "givenName": "Cosimo", 
        "id": "sg:person.012770274011.86", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012770274011.86"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/3-540-49116-3_38", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002207134", 
          "https://doi.org/10.1007/3-540-49116-3_38"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-49116-3_38", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002207134", 
          "https://doi.org/10.1007/3-540-49116-3_38"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.tcs.2008.06.045", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013590738"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00453-010-9427-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1016706126", 
          "https://doi.org/10.1007/s00453-010-9427-8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/2344422.2344426", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1017791470"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00453-006-1211-4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1022756805", 
          "https://doi.org/10.1007/s00453-006-1211-4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/2209249.2209274", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029940041"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/2629666", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031469011"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00453-007-9018-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1033706914", 
          "https://doi.org/10.1007/s00453-007-9018-5"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00453-007-9018-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1033706914", 
          "https://doi.org/10.1007/s00453-007-9018-5"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-38016-7_18", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1038835483", 
          "https://doi.org/10.1007/978-3-642-38016-7_18"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.jcss.2008.07.001", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1042525379"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00224-008-9152-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1042669741", 
          "https://doi.org/10.1007/s00224-008-9152-8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00224-008-9152-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1042669741", 
          "https://doi.org/10.1007/s00224-008-9152-8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf01737559", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044775936", 
          "https://doi.org/10.1007/bf01737559"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1060590.1060600", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1050456256"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/090748986", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062855983"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/s0097539701397059", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062879332"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2015", 
    "datePublishedReg": "2015-01-01", 
    "description": "We investigate the efficiency of some Stackelberg strategies in congestion games with affine latency functions. A Stackelberg strategy is an algorithm that chooses a subset of players and assigns them a prescribed strategy with the purpose of mitigating the detrimental effect that the selfish behavior of the remaining uncoordinated players may cause to the overall performance of the system. The efficiency of a Stackelberg strategy is measured in terms of the price of anarchy of the pure Nash equilibria they induce. Three Stackelberg strategies, namely Largest Latency First, Cover and Scale, were already considered in the literature and non-tight upper and lower bounds on their price of anarchy were given. We reconsider these strategies and provide the exact bound on the price of anarchy of both Largest Latency First and Cover and a better upper bound on the price of anarchy of Scale.", 
    "editor": [
      {
        "familyName": "Markakis", 
        "givenName": "Evangelos", 
        "type": "Person"
      }, 
      {
        "familyName": "Sch\u00e4fer", 
        "givenName": "Guido", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-48995-6_10", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-662-48994-9", 
        "978-3-662-48995-6"
      ], 
      "name": "Web and Internet Economics", 
      "type": "Book"
    }, 
    "name": "On Stackelberg Strategies in Affine Congestion Games", 
    "pagination": "132-145", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-48995-6_10"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "fdd6f91591d0bac57388ebbba5fe2a5c98d17a795552e3f02c4bafb4f1701814"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1053291738"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-48995-6_10", 
      "https://app.dimensions.ai/details/publication/pub.1053291738"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T00:30", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8697_00000596.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/978-3-662-48995-6_10"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-48995-6_10'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-48995-6_10'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-48995-6_10'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-48995-6_10'


 

This table displays all metadata directly associated to this object as RDF triples.

132 TRIPLES      23 PREDICATES      42 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-48995-6_10 schema:about anzsrc-for:14
2 anzsrc-for:1402
3 schema:author N0c5afae169d146ee9abddc7247218a15
4 schema:citation sg:pub.10.1007/3-540-49116-3_38
5 sg:pub.10.1007/978-3-642-38016-7_18
6 sg:pub.10.1007/bf01737559
7 sg:pub.10.1007/s00224-008-9152-8
8 sg:pub.10.1007/s00453-006-1211-4
9 sg:pub.10.1007/s00453-007-9018-5
10 sg:pub.10.1007/s00453-010-9427-8
11 https://doi.org/10.1016/j.jcss.2008.07.001
12 https://doi.org/10.1016/j.tcs.2008.06.045
13 https://doi.org/10.1137/090748986
14 https://doi.org/10.1137/s0097539701397059
15 https://doi.org/10.1145/1060590.1060600
16 https://doi.org/10.1145/2209249.2209274
17 https://doi.org/10.1145/2344422.2344426
18 https://doi.org/10.1145/2629666
19 schema:datePublished 2015
20 schema:datePublishedReg 2015-01-01
21 schema:description We investigate the efficiency of some Stackelberg strategies in congestion games with affine latency functions. A Stackelberg strategy is an algorithm that chooses a subset of players and assigns them a prescribed strategy with the purpose of mitigating the detrimental effect that the selfish behavior of the remaining uncoordinated players may cause to the overall performance of the system. The efficiency of a Stackelberg strategy is measured in terms of the price of anarchy of the pure Nash equilibria they induce. Three Stackelberg strategies, namely Largest Latency First, Cover and Scale, were already considered in the literature and non-tight upper and lower bounds on their price of anarchy were given. We reconsider these strategies and provide the exact bound on the price of anarchy of both Largest Latency First and Cover and a better upper bound on the price of anarchy of Scale.
22 schema:editor N74d8ff87392d40a59fd665c071bcaf7c
23 schema:genre chapter
24 schema:inLanguage en
25 schema:isAccessibleForFree false
26 schema:isPartOf N51e910b433b44f47b750488caf1bad77
27 schema:name On Stackelberg Strategies in Affine Congestion Games
28 schema:pagination 132-145
29 schema:productId N7bc7c02cfbe2444c8d161ea77f18fcb4
30 Nbe7e159ebf354a82beb929836201f8f5
31 Ne60543245f844d89a82ddb8f5739adde
32 schema:publisher Nbf4358dfb2064810b93ecd0cadde309c
33 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053291738
34 https://doi.org/10.1007/978-3-662-48995-6_10
35 schema:sdDatePublished 2019-04-16T00:30
36 schema:sdLicense https://scigraph.springernature.com/explorer/license/
37 schema:sdPublisher Nd59a69ab488345b3a575a93664a92a20
38 schema:url http://link.springer.com/10.1007/978-3-662-48995-6_10
39 sgo:license sg:explorer/license/
40 sgo:sdDataset chapters
41 rdf:type schema:Chapter
42 N0c5afae169d146ee9abddc7247218a15 rdf:first sg:person.012652036261.27
43 rdf:rest Nf4f005a9c4474536b648cfebeba6946a
44 N51e910b433b44f47b750488caf1bad77 schema:isbn 978-3-662-48994-9
45 978-3-662-48995-6
46 schema:name Web and Internet Economics
47 rdf:type schema:Book
48 N74d8ff87392d40a59fd665c071bcaf7c rdf:first Ne57fea6c1cfa4fe8a037ae13cadbe910
49 rdf:rest Nb92bfd832f65449fabd659ccfe820c15
50 N7bc7c02cfbe2444c8d161ea77f18fcb4 schema:name doi
51 schema:value 10.1007/978-3-662-48995-6_10
52 rdf:type schema:PropertyValue
53 Nb92bfd832f65449fabd659ccfe820c15 rdf:first Nccc7018225a443eab4846877637cf327
54 rdf:rest rdf:nil
55 Nbe7e159ebf354a82beb929836201f8f5 schema:name readcube_id
56 schema:value fdd6f91591d0bac57388ebbba5fe2a5c98d17a795552e3f02c4bafb4f1701814
57 rdf:type schema:PropertyValue
58 Nbf4358dfb2064810b93ecd0cadde309c schema:location Berlin, Heidelberg
59 schema:name Springer Berlin Heidelberg
60 rdf:type schema:Organisation
61 Nccc7018225a443eab4846877637cf327 schema:familyName Schäfer
62 schema:givenName Guido
63 rdf:type schema:Person
64 Nd59a69ab488345b3a575a93664a92a20 schema:name Springer Nature - SN SciGraph project
65 rdf:type schema:Organization
66 Ne57fea6c1cfa4fe8a037ae13cadbe910 schema:familyName Markakis
67 schema:givenName Evangelos
68 rdf:type schema:Person
69 Ne60543245f844d89a82ddb8f5739adde schema:name dimensions_id
70 schema:value pub.1053291738
71 rdf:type schema:PropertyValue
72 Nf4f005a9c4474536b648cfebeba6946a rdf:first sg:person.012770274011.86
73 rdf:rest rdf:nil
74 anzsrc-for:14 schema:inDefinedTermSet anzsrc-for:
75 schema:name Economics
76 rdf:type schema:DefinedTerm
77 anzsrc-for:1402 schema:inDefinedTermSet anzsrc-for:
78 schema:name Applied Economics
79 rdf:type schema:DefinedTerm
80 sg:person.012652036261.27 schema:affiliation https://www.grid.ac/institutes/grid.9906.6
81 schema:familyName Bilò
82 schema:givenName Vittorio
83 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012652036261.27
84 rdf:type schema:Person
85 sg:person.012770274011.86 schema:affiliation https://www.grid.ac/institutes/grid.466750.6
86 schema:familyName Vinci
87 schema:givenName Cosimo
88 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012770274011.86
89 rdf:type schema:Person
90 sg:pub.10.1007/3-540-49116-3_38 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002207134
91 https://doi.org/10.1007/3-540-49116-3_38
92 rdf:type schema:CreativeWork
93 sg:pub.10.1007/978-3-642-38016-7_18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038835483
94 https://doi.org/10.1007/978-3-642-38016-7_18
95 rdf:type schema:CreativeWork
96 sg:pub.10.1007/bf01737559 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044775936
97 https://doi.org/10.1007/bf01737559
98 rdf:type schema:CreativeWork
99 sg:pub.10.1007/s00224-008-9152-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042669741
100 https://doi.org/10.1007/s00224-008-9152-8
101 rdf:type schema:CreativeWork
102 sg:pub.10.1007/s00453-006-1211-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022756805
103 https://doi.org/10.1007/s00453-006-1211-4
104 rdf:type schema:CreativeWork
105 sg:pub.10.1007/s00453-007-9018-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033706914
106 https://doi.org/10.1007/s00453-007-9018-5
107 rdf:type schema:CreativeWork
108 sg:pub.10.1007/s00453-010-9427-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016706126
109 https://doi.org/10.1007/s00453-010-9427-8
110 rdf:type schema:CreativeWork
111 https://doi.org/10.1016/j.jcss.2008.07.001 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042525379
112 rdf:type schema:CreativeWork
113 https://doi.org/10.1016/j.tcs.2008.06.045 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013590738
114 rdf:type schema:CreativeWork
115 https://doi.org/10.1137/090748986 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062855983
116 rdf:type schema:CreativeWork
117 https://doi.org/10.1137/s0097539701397059 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062879332
118 rdf:type schema:CreativeWork
119 https://doi.org/10.1145/1060590.1060600 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050456256
120 rdf:type schema:CreativeWork
121 https://doi.org/10.1145/2209249.2209274 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029940041
122 rdf:type schema:CreativeWork
123 https://doi.org/10.1145/2344422.2344426 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017791470
124 rdf:type schema:CreativeWork
125 https://doi.org/10.1145/2629666 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031469011
126 rdf:type schema:CreativeWork
127 https://www.grid.ac/institutes/grid.466750.6 schema:alternateName Gran Sasso Science Institute
128 schema:name Gran Sasso Science Institute
129 rdf:type schema:Organization
130 https://www.grid.ac/institutes/grid.9906.6 schema:alternateName University of Salento
131 schema:name Department of Mathematics and Physics “Ennio De Giorgi”, University of Salento
132 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...