Stackelberg Strategies for Atomic Congestion Games View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2010-07

AUTHORS

Dimitris Fotakis

ABSTRACT

We investigate the effectiveness of Stackelberg strategies for atomic congestion games with unsplittable demands. In our setting, only a fraction of the players are selfish, while the rest are willing to follow a predetermined strategy. A Stackelberg strategy assigns the coordinated players to appropriately selected strategies trying to minimize the performance degradation due to the selfish players. We consider two orthogonal cases, namely congestion games with affine latency functions and arbitrary strategies, and congestion games on parallel links with arbitrary non-decreasing latency functions. We restrict our attention to pure Nash equilibria and derive strong upper and lower bounds on the pure Price of Anarchy (PoA) under different Stackelberg strategies. For affine congestion games, we consider the Stackelberg strategies LLF and Scale introduced by Roughgarden (SIAM J. Comput. 33(2):332–350, 2004), and propose a new Stackelberg strategy called Cover. We establish an upper and a lower bound on the PoA of LLF that are quite close to each other, a nearly linear upper bound on the PoA of Scale, and a lower bound on the PoA of any (even randomized) Stackelberg strategy that assigns the coordinated players to their optimal strategies. Cover is suited for the case where the fraction of coordinated players is small but their number is larger than the number of resources. If the number of players is sufficiently larger than the number of resources, combining Cover with either LLF or Scale gives very strong upper bounds on the PoA, quite close to the best known bounds for non-atomic games with affine latencies. For congestion games on parallel links, we prove that the PoA of LLF matches that for non-atomic games on parallel links. In particular, we show that the PoA of LLF is at most 1/α for arbitrary latency functions, and at most for latency functions in class , where α denotes the fraction of coordinated players. To establish the latter bound, we need to show that the PoA of atomic congestion games on parallel links is at most , i.e. it is bounded by the PoA of non-atomic congestion games with arbitrary strategies. More... »

PAGES

218-249

References to SciGraph publications

Journal

TITLE

Theory of Computing Systems

ISSUE

1

VOLUME

47

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s00224-008-9152-8

DOI

http://dx.doi.org/10.1007/s00224-008-9152-8

DIMENSIONS

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


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 the Aegean", 
          "id": "https://www.grid.ac/institutes/grid.7144.6", 
          "name": [
            "Dept. of Information and Communication Systems Engineering, University of the Aegean, 83200, Samos, Greece"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fotakis", 
        "givenName": "Dimitris", 
        "id": "sg:person.011037717620.11", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011037717620.11"
        ], 
        "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": "sg:pub.10.1007/3-540-45465-9_66", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1005507605", 
          "https://doi.org/10.1007/3-540-45465-9_66"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11786986_28", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1006830357", 
          "https://doi.org/10.1007/11786986_28"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11786986_28", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1006830357", 
          "https://doi.org/10.1007/11786986_28"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-0-387-30162-4_398", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1011471894", 
          "https://doi.org/10.1007/978-0-387-30162-4_398"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-27836-8_55", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013054537", 
          "https://doi.org/10.1007/978-3-540-27836-8_55"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-27836-8_55", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013054537", 
          "https://doi.org/10.1007/978-3-540-27836-8_55"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0166-218x(85)90006-x", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1021703857"
        ], 
        "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.1016/s0022-0000(03)00044-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1024012123"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0022-0000(03)00044-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1024012123"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11672142_17", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1026310762", 
          "https://doi.org/10.1007/11672142_17"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11672142_17", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1026310762", 
          "https://doi.org/10.1007/11672142_17"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1148109.1148113", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028719806"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1060590.1060599", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029757185"
        ], 
        "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/bf01737559", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044775936", 
          "https://doi.org/10.1007/bf01737559"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11523468_5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1045155152", 
          "https://doi.org/10.1007/11523468_5"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11523468_5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1045155152", 
          "https://doi.org/10.1007/11523468_5"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1060590.1060600", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1050456256"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-24749-4_48", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051697140", 
          "https://doi.org/10.1007/978-3-540-24749-4_48"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/90.554730", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061247290"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/s0097539701397059", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062879332"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1287/moor.1040.0098", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1064722758"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2010-07", 
    "datePublishedReg": "2010-07-01", 
    "description": "We investigate the effectiveness of Stackelberg strategies for atomic congestion games with unsplittable demands. In our setting, only a fraction of the players are selfish, while the rest are willing to follow a predetermined strategy. A Stackelberg strategy assigns the coordinated players to appropriately selected strategies trying to minimize the performance degradation due to the selfish players. We consider two orthogonal cases, namely congestion games with affine latency functions and arbitrary strategies, and congestion games on parallel links with arbitrary non-decreasing latency functions. We restrict our attention to pure Nash equilibria and derive strong upper and lower bounds on the pure Price of Anarchy (PoA) under different Stackelberg strategies. For affine congestion games, we consider the Stackelberg strategies LLF and Scale introduced by Roughgarden (SIAM J. Comput. 33(2):332\u2013350, 2004), and propose a new Stackelberg strategy called Cover. We establish an upper and a lower bound on the PoA of LLF that are quite close to each other, a nearly linear upper bound on the PoA of Scale, and a lower bound on the PoA of any (even randomized) Stackelberg strategy that assigns the coordinated players to their optimal strategies. Cover is suited for the case where the fraction of coordinated players is small but their number is larger than the number of resources. If the number of players is sufficiently larger than the number of resources, combining Cover with either LLF or Scale gives very strong upper bounds on the PoA, quite close to the best known bounds for non-atomic games with affine latencies. For congestion games on parallel links, we prove that the PoA of LLF matches that for non-atomic games on parallel links. In particular, we show that the PoA of LLF is at most 1/\u03b1 for arbitrary latency functions, and at most for latency functions in class , where \u03b1 denotes the fraction of coordinated players. To establish the latter bound, we need to show that the PoA of atomic congestion games on parallel links is at most , i.e. it is bounded by the PoA of non-atomic congestion games with arbitrary strategies.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s00224-008-9152-8", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1052098", 
        "issn": [
          "1432-4350", 
          "1433-0490"
        ], 
        "name": "Theory of Computing Systems", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "47"
      }
    ], 
    "name": "Stackelberg Strategies for Atomic Congestion Games", 
    "pagination": "218-249", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "cb4103f06e737e7f7950d5640e4ef7efd083436a3fb571465fbd6231025c81bc"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00224-008-9152-8"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1042669741"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00224-008-9152-8", 
      "https://app.dimensions.ai/details/publication/pub.1042669741"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T14:25", 
    "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/0000000373_0000000373/records_13068_00000001.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007/s00224-008-9152-8"
  }
]
 

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/s00224-008-9152-8'

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/s00224-008-9152-8'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00224-008-9152-8'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00224-008-9152-8'


 

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

129 TRIPLES      21 PREDICATES      46 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s00224-008-9152-8 schema:about anzsrc-for:14
2 anzsrc-for:1402
3 schema:author N9fd468d8d10344ddb344af0366bc3867
4 schema:citation sg:pub.10.1007/11523468_5
5 sg:pub.10.1007/11672142_17
6 sg:pub.10.1007/11786986_28
7 sg:pub.10.1007/3-540-45465-9_66
8 sg:pub.10.1007/3-540-49116-3_38
9 sg:pub.10.1007/978-0-387-30162-4_398
10 sg:pub.10.1007/978-3-540-24749-4_48
11 sg:pub.10.1007/978-3-540-27836-8_55
12 sg:pub.10.1007/bf01737559
13 sg:pub.10.1007/s00453-006-1211-4
14 sg:pub.10.1007/s00453-007-9018-5
15 https://doi.org/10.1016/0166-218x(85)90006-x
16 https://doi.org/10.1016/s0022-0000(03)00044-8
17 https://doi.org/10.1109/90.554730
18 https://doi.org/10.1137/s0097539701397059
19 https://doi.org/10.1145/1060590.1060599
20 https://doi.org/10.1145/1060590.1060600
21 https://doi.org/10.1145/1148109.1148113
22 https://doi.org/10.1287/moor.1040.0098
23 schema:datePublished 2010-07
24 schema:datePublishedReg 2010-07-01
25 schema:description We investigate the effectiveness of Stackelberg strategies for atomic congestion games with unsplittable demands. In our setting, only a fraction of the players are selfish, while the rest are willing to follow a predetermined strategy. A Stackelberg strategy assigns the coordinated players to appropriately selected strategies trying to minimize the performance degradation due to the selfish players. We consider two orthogonal cases, namely congestion games with affine latency functions and arbitrary strategies, and congestion games on parallel links with arbitrary non-decreasing latency functions. We restrict our attention to pure Nash equilibria and derive strong upper and lower bounds on the pure Price of Anarchy (PoA) under different Stackelberg strategies. For affine congestion games, we consider the Stackelberg strategies LLF and Scale introduced by Roughgarden (SIAM J. Comput. 33(2):332–350, 2004), and propose a new Stackelberg strategy called Cover. We establish an upper and a lower bound on the PoA of LLF that are quite close to each other, a nearly linear upper bound on the PoA of Scale, and a lower bound on the PoA of any (even randomized) Stackelberg strategy that assigns the coordinated players to their optimal strategies. Cover is suited for the case where the fraction of coordinated players is small but their number is larger than the number of resources. If the number of players is sufficiently larger than the number of resources, combining Cover with either LLF or Scale gives very strong upper bounds on the PoA, quite close to the best known bounds for non-atomic games with affine latencies. For congestion games on parallel links, we prove that the PoA of LLF matches that for non-atomic games on parallel links. In particular, we show that the PoA of LLF is at most 1/α for arbitrary latency functions, and at most for latency functions in class , where α denotes the fraction of coordinated players. To establish the latter bound, we need to show that the PoA of atomic congestion games on parallel links is at most , i.e. it is bounded by the PoA of non-atomic congestion games with arbitrary strategies.
26 schema:genre research_article
27 schema:inLanguage en
28 schema:isAccessibleForFree false
29 schema:isPartOf Naa4e105a23624ab088cb79493057fc89
30 Ne08ba793bf0a4960b57611728739e1c1
31 sg:journal.1052098
32 schema:name Stackelberg Strategies for Atomic Congestion Games
33 schema:pagination 218-249
34 schema:productId N12dc1865ed3e4560b1d20f57ec605155
35 N3f8e4165c8d24f0e997f26f345fcc782
36 Nad5a4a1fa0b84d7b86243f49d8d044b4
37 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042669741
38 https://doi.org/10.1007/s00224-008-9152-8
39 schema:sdDatePublished 2019-04-11T14:25
40 schema:sdLicense https://scigraph.springernature.com/explorer/license/
41 schema:sdPublisher Nf2f81be4643740969194cfda33c68e13
42 schema:url http://link.springer.com/10.1007/s00224-008-9152-8
43 sgo:license sg:explorer/license/
44 sgo:sdDataset articles
45 rdf:type schema:ScholarlyArticle
46 N12dc1865ed3e4560b1d20f57ec605155 schema:name readcube_id
47 schema:value cb4103f06e737e7f7950d5640e4ef7efd083436a3fb571465fbd6231025c81bc
48 rdf:type schema:PropertyValue
49 N3f8e4165c8d24f0e997f26f345fcc782 schema:name dimensions_id
50 schema:value pub.1042669741
51 rdf:type schema:PropertyValue
52 N9fd468d8d10344ddb344af0366bc3867 rdf:first sg:person.011037717620.11
53 rdf:rest rdf:nil
54 Naa4e105a23624ab088cb79493057fc89 schema:issueNumber 1
55 rdf:type schema:PublicationIssue
56 Nad5a4a1fa0b84d7b86243f49d8d044b4 schema:name doi
57 schema:value 10.1007/s00224-008-9152-8
58 rdf:type schema:PropertyValue
59 Ne08ba793bf0a4960b57611728739e1c1 schema:volumeNumber 47
60 rdf:type schema:PublicationVolume
61 Nf2f81be4643740969194cfda33c68e13 schema:name Springer Nature - SN SciGraph project
62 rdf:type schema:Organization
63 anzsrc-for:14 schema:inDefinedTermSet anzsrc-for:
64 schema:name Economics
65 rdf:type schema:DefinedTerm
66 anzsrc-for:1402 schema:inDefinedTermSet anzsrc-for:
67 schema:name Applied Economics
68 rdf:type schema:DefinedTerm
69 sg:journal.1052098 schema:issn 1432-4350
70 1433-0490
71 schema:name Theory of Computing Systems
72 rdf:type schema:Periodical
73 sg:person.011037717620.11 schema:affiliation https://www.grid.ac/institutes/grid.7144.6
74 schema:familyName Fotakis
75 schema:givenName Dimitris
76 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011037717620.11
77 rdf:type schema:Person
78 sg:pub.10.1007/11523468_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045155152
79 https://doi.org/10.1007/11523468_5
80 rdf:type schema:CreativeWork
81 sg:pub.10.1007/11672142_17 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026310762
82 https://doi.org/10.1007/11672142_17
83 rdf:type schema:CreativeWork
84 sg:pub.10.1007/11786986_28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006830357
85 https://doi.org/10.1007/11786986_28
86 rdf:type schema:CreativeWork
87 sg:pub.10.1007/3-540-45465-9_66 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005507605
88 https://doi.org/10.1007/3-540-45465-9_66
89 rdf:type schema:CreativeWork
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-0-387-30162-4_398 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011471894
94 https://doi.org/10.1007/978-0-387-30162-4_398
95 rdf:type schema:CreativeWork
96 sg:pub.10.1007/978-3-540-24749-4_48 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051697140
97 https://doi.org/10.1007/978-3-540-24749-4_48
98 rdf:type schema:CreativeWork
99 sg:pub.10.1007/978-3-540-27836-8_55 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013054537
100 https://doi.org/10.1007/978-3-540-27836-8_55
101 rdf:type schema:CreativeWork
102 sg:pub.10.1007/bf01737559 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044775936
103 https://doi.org/10.1007/bf01737559
104 rdf:type schema:CreativeWork
105 sg:pub.10.1007/s00453-006-1211-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022756805
106 https://doi.org/10.1007/s00453-006-1211-4
107 rdf:type schema:CreativeWork
108 sg:pub.10.1007/s00453-007-9018-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033706914
109 https://doi.org/10.1007/s00453-007-9018-5
110 rdf:type schema:CreativeWork
111 https://doi.org/10.1016/0166-218x(85)90006-x schema:sameAs https://app.dimensions.ai/details/publication/pub.1021703857
112 rdf:type schema:CreativeWork
113 https://doi.org/10.1016/s0022-0000(03)00044-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024012123
114 rdf:type schema:CreativeWork
115 https://doi.org/10.1109/90.554730 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061247290
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.1060599 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029757185
120 rdf:type schema:CreativeWork
121 https://doi.org/10.1145/1060590.1060600 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050456256
122 rdf:type schema:CreativeWork
123 https://doi.org/10.1145/1148109.1148113 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028719806
124 rdf:type schema:CreativeWork
125 https://doi.org/10.1287/moor.1040.0098 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064722758
126 rdf:type schema:CreativeWork
127 https://www.grid.ac/institutes/grid.7144.6 schema:alternateName University of the Aegean
128 schema:name Dept. of Information and Communication Systems Engineering, University of the Aegean, 83200, Samos, Greece
129 rdf:type schema:Organization
 




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


...