Stackelberg Strategies for Selfish Routing in General Multicommodity Networks View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2009-01

AUTHORS

George Karakostas, Stavros G. Kolliopoulos

ABSTRACT

A natural generalization of the selfish routing setting arises when some of the users obey a central coordinating authority, while the rest act selfishly. Such behavior can be modeled by dividing the users into an α fraction that are routed according to the central coordinator’s routing strategy (Stackelberg strategy), and the remaining 1−α that determine their strategy selfishly, given the routing of the coordinated users. One seeks to quantify the resulting price of anarchy, i.e., the ratio of the cost of the worst traffic equilibrium to the system optimum, as a function of α. It is well-known that for α=0 and linear latency functions the price of anarchy is at most 4/3 (J. ACM 49, 236–259, 2002). If α tends to 1, the price of anarchy should also tend to 1 for any reasonable algorithm used by the coordinator. We analyze two such algorithms for Stackelberg routing, LLF and SCALE. For general topology networks, multicommodity users, and linear latency functions, we show a price of anarchy bound for SCALE which decreases from 4/3 to 1 as α increases from 0 to 1, and depends only on α. Up to this work, such a tradeoff was known only for the case of two nodes connected with parallel links (SIAM J. Comput. 33, 332–350, 2004), while for general networks it was not clear whether such a result could be achieved, even in the single-commodity case. We show a weaker bound for LLF and also some extensions to general latency functions. The existence of a central coordinator is a rather strong requirement for a network. We show that we can do away with such a coordinator, as long as we are allowed to impose taxes (tolls) on the edges in order to steer the selfish users towards an improved system cost. As long as there is at least a fraction α of users that pay their taxes, we show the existence of taxes that lead to the simulation of SCALE by the tax-payers. The extension of the results mentioned above quantifies the improvement on the system cost as the number of tax-evaders decreases. More... »

PAGES

132-153

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s00453-007-9018-5

DOI

http://dx.doi.org/10.1007/s00453-007-9018-5

DIMENSIONS

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


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": "McMaster University", 
          "id": "https://www.grid.ac/institutes/grid.25073.33", 
          "name": [
            "Department of Computing and Software, McMaster University, 1280 Main st. W., L8S 4K1, Hamilton, ON, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Karakostas", 
        "givenName": "George", 
        "id": "sg:person.012255240155.50", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012255240155.50"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "National and Kapodistrian University of Athens", 
          "id": "https://www.grid.ac/institutes/grid.5216.0", 
          "name": [
            "Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, Panepistimiopolis Ilissia, 157 84, Athens, Greece"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Kolliopoulos", 
        "givenName": "Stavros G.", 
        "id": "sg:person.07516472564.95", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07516472564.95"
        ], 
        "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.1145/506147.506153", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002416680"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/780542.780618", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009463170"
        ], 
        "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": "https://doi.org/10.1145/1148109.1148113", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028719806"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0191-2615(02)00074-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1030018443"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0191-2615(02)00074-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1030018443"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1250910.1250925", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1032705910"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-25960-2_4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1037234508", 
          "https://doi.org/10.1007/978-3-540-25960-2_4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-25960-2_4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1037234508", 
          "https://doi.org/10.1007/978-3-540-25960-2_4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf02206823", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1052792315", 
          "https://doi.org/10.1007/bf02206823"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf02206823", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1052792315", 
          "https://doi.org/10.1007/bf02206823"
        ], 
        "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/0602024", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062848699"
        ], 
        "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"
      }, 
      {
        "id": "https://doi.org/10.1287/trsc.14.1.42", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1064734567"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1680/ipeds.1952.11259", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1068230835"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.21236/ada637949", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1091599998"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/focs.2004.69", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094510950"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/focs.2004.26", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094666056"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2009-01", 
    "datePublishedReg": "2009-01-01", 
    "description": "A natural generalization of the selfish routing setting arises when some of the users obey a central coordinating authority, while the rest act selfishly. Such behavior can be modeled by dividing the users into an \u03b1 fraction that are routed according to the central coordinator\u2019s routing strategy (Stackelberg strategy), and the remaining 1\u2212\u03b1 that determine their strategy selfishly, given the routing of the coordinated users. One seeks to quantify the resulting price of anarchy, i.e., the ratio of the cost of the worst traffic equilibrium to the system optimum, as a function of \u03b1. It is well-known that for \u03b1=0 and linear latency functions the price of anarchy is at most 4/3 (J. ACM 49, 236\u2013259, 2002). If \u03b1 tends to 1, the price of anarchy should also tend to 1 for any reasonable algorithm used by the coordinator. We analyze two such algorithms for Stackelberg routing, LLF and SCALE. For general topology networks, multicommodity users, and linear latency functions, we show a price of anarchy bound for SCALE which decreases from 4/3 to 1 as \u03b1 increases from 0 to 1, and depends only on \u03b1. Up to this work, such a tradeoff was known only for the case of two nodes connected with parallel links (SIAM J. Comput. 33, 332\u2013350, 2004), while for general networks it was not clear whether such a result could be achieved, even in the single-commodity case. We show a weaker bound for LLF and also some extensions to general latency functions. The existence of a central coordinator is a rather strong requirement for a network. We show that we can do away with such a coordinator, as long as we are allowed to impose taxes (tolls) on the edges in order to steer the selfish users towards an improved system cost. As long as there is at least a fraction \u03b1 of users that pay their taxes, we show the existence of taxes that lead to the simulation of SCALE by the tax-payers. The extension of the results mentioned above quantifies the improvement on the system cost as the number of tax-evaders decreases.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s00453-007-9018-5", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1047644", 
        "issn": [
          "0178-4617", 
          "1432-0541"
        ], 
        "name": "Algorithmica", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "53"
      }
    ], 
    "name": "Stackelberg Strategies for Selfish Routing in General Multicommodity Networks", 
    "pagination": "132-153", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "a091961273e86b7b01996b9ea639e8cf23f219b18089e00bbc3511f2ff1b992d"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00453-007-9018-5"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1033706914"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00453-007-9018-5", 
      "https://app.dimensions.ai/details/publication/pub.1033706914"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T14:31", 
    "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_13093_00000001.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2Fs00453-007-9018-5"
  }
]
 

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/s00453-007-9018-5'

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/s00453-007-9018-5'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00453-007-9018-5'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00453-007-9018-5'


 

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

128 TRIPLES      21 PREDICATES      45 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s00453-007-9018-5 schema:about anzsrc-for:14
2 anzsrc-for:1402
3 schema:author N13dcf227cd3e4f13bf8b6055d8e8e346
4 schema:citation sg:pub.10.1007/3-540-49116-3_38
5 sg:pub.10.1007/978-3-540-25960-2_4
6 sg:pub.10.1007/bf02206823
7 https://doi.org/10.1016/s0022-0000(03)00044-8
8 https://doi.org/10.1016/s0191-2615(02)00074-7
9 https://doi.org/10.1109/90.554730
10 https://doi.org/10.1109/focs.2004.26
11 https://doi.org/10.1109/focs.2004.69
12 https://doi.org/10.1137/0602024
13 https://doi.org/10.1137/s0097539701397059
14 https://doi.org/10.1145/1148109.1148113
15 https://doi.org/10.1145/1250910.1250925
16 https://doi.org/10.1145/506147.506153
17 https://doi.org/10.1145/780542.780618
18 https://doi.org/10.1287/moor.1040.0098
19 https://doi.org/10.1287/trsc.14.1.42
20 https://doi.org/10.1680/ipeds.1952.11259
21 https://doi.org/10.21236/ada637949
22 schema:datePublished 2009-01
23 schema:datePublishedReg 2009-01-01
24 schema:description A natural generalization of the selfish routing setting arises when some of the users obey a central coordinating authority, while the rest act selfishly. Such behavior can be modeled by dividing the users into an α fraction that are routed according to the central coordinator’s routing strategy (Stackelberg strategy), and the remaining 1−α that determine their strategy selfishly, given the routing of the coordinated users. One seeks to quantify the resulting price of anarchy, i.e., the ratio of the cost of the worst traffic equilibrium to the system optimum, as a function of α. It is well-known that for α=0 and linear latency functions the price of anarchy is at most 4/3 (J. ACM 49, 236–259, 2002). If α tends to 1, the price of anarchy should also tend to 1 for any reasonable algorithm used by the coordinator. We analyze two such algorithms for Stackelberg routing, LLF and SCALE. For general topology networks, multicommodity users, and linear latency functions, we show a price of anarchy bound for SCALE which decreases from 4/3 to 1 as α increases from 0 to 1, and depends only on α. Up to this work, such a tradeoff was known only for the case of two nodes connected with parallel links (SIAM J. Comput. 33, 332–350, 2004), while for general networks it was not clear whether such a result could be achieved, even in the single-commodity case. We show a weaker bound for LLF and also some extensions to general latency functions. The existence of a central coordinator is a rather strong requirement for a network. We show that we can do away with such a coordinator, as long as we are allowed to impose taxes (tolls) on the edges in order to steer the selfish users towards an improved system cost. As long as there is at least a fraction α of users that pay their taxes, we show the existence of taxes that lead to the simulation of SCALE by the tax-payers. The extension of the results mentioned above quantifies the improvement on the system cost as the number of tax-evaders decreases.
25 schema:genre research_article
26 schema:inLanguage en
27 schema:isAccessibleForFree true
28 schema:isPartOf N636c84bec09a41a6969450d77ba17426
29 Nd076292f637043a8b1f34d4ad56fb312
30 sg:journal.1047644
31 schema:name Stackelberg Strategies for Selfish Routing in General Multicommodity Networks
32 schema:pagination 132-153
33 schema:productId N8d15dbefb6f74285bf7ce07da903d3ab
34 N9b23cf2a44844a57a6da3de7635f74d8
35 Nb57d82a308904443b507e7a223ba67be
36 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033706914
37 https://doi.org/10.1007/s00453-007-9018-5
38 schema:sdDatePublished 2019-04-11T14:31
39 schema:sdLicense https://scigraph.springernature.com/explorer/license/
40 schema:sdPublisher N37189ad4b4b344fe874b6d0994023211
41 schema:url http://link.springer.com/10.1007%2Fs00453-007-9018-5
42 sgo:license sg:explorer/license/
43 sgo:sdDataset articles
44 rdf:type schema:ScholarlyArticle
45 N13dcf227cd3e4f13bf8b6055d8e8e346 rdf:first sg:person.012255240155.50
46 rdf:rest Nab5944f145d7403aa72195398743fab7
47 N37189ad4b4b344fe874b6d0994023211 schema:name Springer Nature - SN SciGraph project
48 rdf:type schema:Organization
49 N636c84bec09a41a6969450d77ba17426 schema:issueNumber 1
50 rdf:type schema:PublicationIssue
51 N8d15dbefb6f74285bf7ce07da903d3ab schema:name dimensions_id
52 schema:value pub.1033706914
53 rdf:type schema:PropertyValue
54 N9b23cf2a44844a57a6da3de7635f74d8 schema:name readcube_id
55 schema:value a091961273e86b7b01996b9ea639e8cf23f219b18089e00bbc3511f2ff1b992d
56 rdf:type schema:PropertyValue
57 Nab5944f145d7403aa72195398743fab7 rdf:first sg:person.07516472564.95
58 rdf:rest rdf:nil
59 Nb57d82a308904443b507e7a223ba67be schema:name doi
60 schema:value 10.1007/s00453-007-9018-5
61 rdf:type schema:PropertyValue
62 Nd076292f637043a8b1f34d4ad56fb312 schema:volumeNumber 53
63 rdf:type schema:PublicationVolume
64 anzsrc-for:14 schema:inDefinedTermSet anzsrc-for:
65 schema:name Economics
66 rdf:type schema:DefinedTerm
67 anzsrc-for:1402 schema:inDefinedTermSet anzsrc-for:
68 schema:name Applied Economics
69 rdf:type schema:DefinedTerm
70 sg:journal.1047644 schema:issn 0178-4617
71 1432-0541
72 schema:name Algorithmica
73 rdf:type schema:Periodical
74 sg:person.012255240155.50 schema:affiliation https://www.grid.ac/institutes/grid.25073.33
75 schema:familyName Karakostas
76 schema:givenName George
77 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012255240155.50
78 rdf:type schema:Person
79 sg:person.07516472564.95 schema:affiliation https://www.grid.ac/institutes/grid.5216.0
80 schema:familyName Kolliopoulos
81 schema:givenName Stavros G.
82 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07516472564.95
83 rdf:type schema:Person
84 sg:pub.10.1007/3-540-49116-3_38 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002207134
85 https://doi.org/10.1007/3-540-49116-3_38
86 rdf:type schema:CreativeWork
87 sg:pub.10.1007/978-3-540-25960-2_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037234508
88 https://doi.org/10.1007/978-3-540-25960-2_4
89 rdf:type schema:CreativeWork
90 sg:pub.10.1007/bf02206823 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052792315
91 https://doi.org/10.1007/bf02206823
92 rdf:type schema:CreativeWork
93 https://doi.org/10.1016/s0022-0000(03)00044-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024012123
94 rdf:type schema:CreativeWork
95 https://doi.org/10.1016/s0191-2615(02)00074-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030018443
96 rdf:type schema:CreativeWork
97 https://doi.org/10.1109/90.554730 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061247290
98 rdf:type schema:CreativeWork
99 https://doi.org/10.1109/focs.2004.26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094666056
100 rdf:type schema:CreativeWork
101 https://doi.org/10.1109/focs.2004.69 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094510950
102 rdf:type schema:CreativeWork
103 https://doi.org/10.1137/0602024 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062848699
104 rdf:type schema:CreativeWork
105 https://doi.org/10.1137/s0097539701397059 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062879332
106 rdf:type schema:CreativeWork
107 https://doi.org/10.1145/1148109.1148113 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028719806
108 rdf:type schema:CreativeWork
109 https://doi.org/10.1145/1250910.1250925 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032705910
110 rdf:type schema:CreativeWork
111 https://doi.org/10.1145/506147.506153 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002416680
112 rdf:type schema:CreativeWork
113 https://doi.org/10.1145/780542.780618 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009463170
114 rdf:type schema:CreativeWork
115 https://doi.org/10.1287/moor.1040.0098 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064722758
116 rdf:type schema:CreativeWork
117 https://doi.org/10.1287/trsc.14.1.42 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064734567
118 rdf:type schema:CreativeWork
119 https://doi.org/10.1680/ipeds.1952.11259 schema:sameAs https://app.dimensions.ai/details/publication/pub.1068230835
120 rdf:type schema:CreativeWork
121 https://doi.org/10.21236/ada637949 schema:sameAs https://app.dimensions.ai/details/publication/pub.1091599998
122 rdf:type schema:CreativeWork
123 https://www.grid.ac/institutes/grid.25073.33 schema:alternateName McMaster University
124 schema:name Department of Computing and Software, McMaster University, 1280 Main st. W., L8S 4K1, Hamilton, ON, Canada
125 rdf:type schema:Organization
126 https://www.grid.ac/institutes/grid.5216.0 schema:alternateName National and Kapodistrian University of Athens
127 schema:name Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, Panepistimiopolis Ilissia, 157 84, Athens, Greece
128 rdf:type schema:Organization
 




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


...