Sharing the Cost of Multicast Transmissions in Wireless Networks View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2004

AUTHORS

Paolo Penna , Carmine Ventre

ABSTRACT

We investigate the problem of sharing the cost of a multicast transmission in a wireless network where each node (radio station) of the network corresponds to (a set of) user(s) potentially interested in receiving the transmission. As in the model considered by Feigenbaum et al [2001], users may act selfishly and report a false ”level of interest” in receiving the transmission trying to be charged less by the system. We consider the issue of designing a so called truthful mechanisms for the problem of maximizing the net worth (i.e., the overall ”happiness” of the users minus the cost of the transmission) for the case of wireless networks. Intuitively, truthful mechanism guarantee that no user has an incentive in reporting a false valuation of the transmission. Unlike the ”wired” network case, here the cost of a set of connections implementing a multicast tree is not the sum of the single edge costs, thus introducing a complicating factor in the problem. We provide both positive and negative results on the existence of optimal algorithms for the problem and their use to obtain VCG truthful mechanisms achieving the same performances. More... »

PAGES

255-266

References to SciGraph publications

  • 2001. On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs in STACS 2001
  • 2002. On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks in FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING
  • 1999. Hardness Results for the Power Range Assignment Problem in Packet Radio Networks in RANDOMIZATION, APPROXIMATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2002. Symmetric Connectivity with Minimum Power Consumption in Radio Networks in FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING
  • 1995-10. Balancing minimum spanning trees and shortest-path trees in ALGORITHMICA
  • 2004. Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks in STACS 2004
  • 1998-04. Approximation Algorithms for Connected Dominating Sets in ALGORITHMICA
  • 1971-09. Multipart pricing of public goods in PUBLIC CHOICE
  • 2001-11. Strategyproof sharing of submodular costs:budget balance versus efficiency in ECONOMIC THEORY
  • 2004. Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms in APPROXIMATION AND ONLINE ALGORITHMS
  • Book

    TITLE

    Structural Information and Communication Complexity

    ISBN

    978-3-540-22230-9
    978-3-540-27796-5

    Author Affiliations

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-540-27796-5_23

    DOI

    http://dx.doi.org/10.1007/978-3-540-27796-5_23

    DIMENSIONS

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


    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/1005", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Communications Technologies", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/10", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Technology", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "University of Salerno", 
              "id": "https://www.grid.ac/institutes/grid.11780.3f", 
              "name": [
                "Dipartimento di Informatica ed Applicazioni \u201dR.M. Capocelli\u201d, Universit\u00e0 di Salerno, via S. Allende 2, I-84081, Baronissi (SA), Italy"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Penna", 
            "givenName": "Paolo", 
            "id": "sg:person.013624103516.76", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013624103516.76"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Salerno", 
              "id": "https://www.grid.ac/institutes/grid.11780.3f", 
              "name": [
                "Dipartimento di Informatica ed Applicazioni \u201dR.M. Capocelli\u201d, Universit\u00e0 di Salerno, via S. Allende 2, I-84081, Baronissi (SA), Italy"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Ventre", 
            "givenName": "Carmine", 
            "id": "sg:person.013762200435.42", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013762200435.42"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-0-387-35608-2_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1001979081", 
              "https://doi.org/10.1007/978-0-387-35608-2_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/pl00004200", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002007481", 
              "https://doi.org/10.1007/pl00004200"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01726210", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1003499590", 
              "https://doi.org/10.1007/bf01726210"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01726210", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1003499590", 
              "https://doi.org/10.1007/bf01726210"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0047-2727(76)90049-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008347259"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-48413-4_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009665385", 
              "https://doi.org/10.1007/978-3-540-48413-4_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/pl00009201", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011742700", 
              "https://doi.org/10.1007/pl00009201"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/380752.380883", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018290072"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0304-3975(02)00538-8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021115986"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0304-3975(02)00538-8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021115986"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-44693-1_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022005518", 
              "https://doi.org/10.1007/3-540-44693-1_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/938985.939011", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022618940"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0304-3975(03)00085-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025222313"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/380752.380825", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1028738557"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0304-3975(98)00223-0", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1030759533"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1006/game.1999.0790", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036056755"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24592-6_20", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036424844", 
              "https://doi.org/10.1007/978-3-540-24592-6_20"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24592-6_20", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036424844", 
              "https://doi.org/10.1007/978-3-540-24592-6_20"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1006/jcss.2001.1754", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1037137868"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/570810.570812", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041666416"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1111/j.1540-6261.1961.tb02789.x", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043120435"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24749-4_37", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043516498", 
              "https://doi.org/10.1007/978-3-540-24749-4_37"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24749-4_37", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043516498", 
              "https://doi.org/10.1007/978-3-540-24749-4_37"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-0-387-35608-2_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046566820", 
              "https://doi.org/10.1007/978-0-387-35608-2_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/509907.509956", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048921259"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01294129", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1049818437", 
              "https://doi.org/10.1007/bf01294129"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01294129", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1049818437", 
              "https://doi.org/10.1007/bf01294129"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.2307/1914085", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1069641186"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2004", 
        "datePublishedReg": "2004-01-01", 
        "description": "We investigate the problem of sharing the cost of a multicast transmission in a wireless network where each node (radio station) of the network corresponds to (a set of) user(s) potentially interested in receiving the transmission. As in the model considered by Feigenbaum et al [2001], users may act selfishly and report a false \u201dlevel of interest\u201d in receiving the transmission trying to be charged less by the system. We consider the issue of designing a so called truthful mechanisms for the problem of maximizing the net worth (i.e., the overall \u201dhappiness\u201d of the users minus the cost of the transmission) for the case of wireless networks. Intuitively, truthful mechanism guarantee that no user has an incentive in reporting a false valuation of the transmission. Unlike the \u201dwired\u201d network case, here the cost of a set of connections implementing a multicast tree is not the sum of the single edge costs, thus introducing a complicating factor in the problem. We provide both positive and negative results on the existence of optimal algorithms for the problem and their use to obtain VCG truthful mechanisms achieving the same performances.", 
        "editor": [
          {
            "familyName": "Kr\u00e1lovic\u0306", 
            "givenName": "Ratislav", 
            "type": "Person"
          }, 
          {
            "familyName": "S\u00fdkora", 
            "givenName": "Ondrej", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-540-27796-5_23", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": {
          "isbn": [
            "978-3-540-22230-9", 
            "978-3-540-27796-5"
          ], 
          "name": "Structural Information and Communication Complexity", 
          "type": "Book"
        }, 
        "name": "Sharing the Cost of Multicast Transmissions in Wireless Networks", 
        "pagination": "255-266", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1051676906"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-540-27796-5_23"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "f629d492f1a1f1adfcf507a63f60ef039a78f4accc1757723abdcd9a41287cb3"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-540-27796-5_23", 
          "https://app.dimensions.ai/details/publication/pub.1051676906"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T08:16", 
        "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/0000000362_0000000362/records_87079_00000001.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F978-3-540-27796-5_23"
      }
    ]
     

    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-540-27796-5_23'

    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-540-27796-5_23'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-27796-5_23'

    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-540-27796-5_23'


     

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

    156 TRIPLES      23 PREDICATES      50 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-540-27796-5_23 schema:about anzsrc-for:10
    2 anzsrc-for:1005
    3 schema:author N037a5c0fc17c431eb4f30473660f22c8
    4 schema:citation sg:pub.10.1007/3-540-44693-1_11
    5 sg:pub.10.1007/978-0-387-35608-2_11
    6 sg:pub.10.1007/978-0-387-35608-2_7
    7 sg:pub.10.1007/978-3-540-24592-6_20
    8 sg:pub.10.1007/978-3-540-24749-4_37
    9 sg:pub.10.1007/978-3-540-48413-4_21
    10 sg:pub.10.1007/bf01294129
    11 sg:pub.10.1007/bf01726210
    12 sg:pub.10.1007/pl00004200
    13 sg:pub.10.1007/pl00009201
    14 https://doi.org/10.1006/game.1999.0790
    15 https://doi.org/10.1006/jcss.2001.1754
    16 https://doi.org/10.1016/0047-2727(76)90049-9
    17 https://doi.org/10.1016/s0304-3975(02)00538-8
    18 https://doi.org/10.1016/s0304-3975(03)00085-9
    19 https://doi.org/10.1016/s0304-3975(98)00223-0
    20 https://doi.org/10.1111/j.1540-6261.1961.tb02789.x
    21 https://doi.org/10.1145/380752.380825
    22 https://doi.org/10.1145/380752.380883
    23 https://doi.org/10.1145/509907.509956
    24 https://doi.org/10.1145/570810.570812
    25 https://doi.org/10.1145/938985.939011
    26 https://doi.org/10.2307/1914085
    27 schema:datePublished 2004
    28 schema:datePublishedReg 2004-01-01
    29 schema:description We investigate the problem of sharing the cost of a multicast transmission in a wireless network where each node (radio station) of the network corresponds to (a set of) user(s) potentially interested in receiving the transmission. As in the model considered by Feigenbaum et al [2001], users may act selfishly and report a false ”level of interest” in receiving the transmission trying to be charged less by the system. We consider the issue of designing a so called truthful mechanisms for the problem of maximizing the net worth (i.e., the overall ”happiness” of the users minus the cost of the transmission) for the case of wireless networks. Intuitively, truthful mechanism guarantee that no user has an incentive in reporting a false valuation of the transmission. Unlike the ”wired” network case, here the cost of a set of connections implementing a multicast tree is not the sum of the single edge costs, thus introducing a complicating factor in the problem. We provide both positive and negative results on the existence of optimal algorithms for the problem and their use to obtain VCG truthful mechanisms achieving the same performances.
    30 schema:editor N39aa51afca5940b89e78cfa9f6833647
    31 schema:genre chapter
    32 schema:inLanguage en
    33 schema:isAccessibleForFree true
    34 schema:isPartOf N32a390ea4bba408493c306a0aa6d368a
    35 schema:name Sharing the Cost of Multicast Transmissions in Wireless Networks
    36 schema:pagination 255-266
    37 schema:productId N1e7734e8aa6049c3b6fde4d68017d496
    38 N375fa56093d04530b6c67f3b0c0425af
    39 Na79297d1ea4042afbb2646cd094b4a7f
    40 schema:publisher N4d223260cc67477ba39204bae6f44cd9
    41 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051676906
    42 https://doi.org/10.1007/978-3-540-27796-5_23
    43 schema:sdDatePublished 2019-04-16T08:16
    44 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    45 schema:sdPublisher N1dd2f02b9fb44e11a59905fb192ddea3
    46 schema:url https://link.springer.com/10.1007%2F978-3-540-27796-5_23
    47 sgo:license sg:explorer/license/
    48 sgo:sdDataset chapters
    49 rdf:type schema:Chapter
    50 N02b7c197b0964dc5b30e6cb8d16290e4 rdf:first sg:person.013762200435.42
    51 rdf:rest rdf:nil
    52 N037a5c0fc17c431eb4f30473660f22c8 rdf:first sg:person.013624103516.76
    53 rdf:rest N02b7c197b0964dc5b30e6cb8d16290e4
    54 N1dd2f02b9fb44e11a59905fb192ddea3 schema:name Springer Nature - SN SciGraph project
    55 rdf:type schema:Organization
    56 N1e7734e8aa6049c3b6fde4d68017d496 schema:name readcube_id
    57 schema:value f629d492f1a1f1adfcf507a63f60ef039a78f4accc1757723abdcd9a41287cb3
    58 rdf:type schema:PropertyValue
    59 N32a390ea4bba408493c306a0aa6d368a schema:isbn 978-3-540-22230-9
    60 978-3-540-27796-5
    61 schema:name Structural Information and Communication Complexity
    62 rdf:type schema:Book
    63 N375fa56093d04530b6c67f3b0c0425af schema:name doi
    64 schema:value 10.1007/978-3-540-27796-5_23
    65 rdf:type schema:PropertyValue
    66 N37f70f77a5834088bf24ea0a6c18bf93 schema:familyName Sýkora
    67 schema:givenName Ondrej
    68 rdf:type schema:Person
    69 N39aa51afca5940b89e78cfa9f6833647 rdf:first Na1e9430e0644489e82bd3b3b6d5c6d77
    70 rdf:rest N530cf2ca8c5149e69d927869a0c7d3b0
    71 N4d223260cc67477ba39204bae6f44cd9 schema:location Berlin, Heidelberg
    72 schema:name Springer Berlin Heidelberg
    73 rdf:type schema:Organisation
    74 N530cf2ca8c5149e69d927869a0c7d3b0 rdf:first N37f70f77a5834088bf24ea0a6c18bf93
    75 rdf:rest rdf:nil
    76 Na1e9430e0644489e82bd3b3b6d5c6d77 schema:familyName Královic̆
    77 schema:givenName Ratislav
    78 rdf:type schema:Person
    79 Na79297d1ea4042afbb2646cd094b4a7f schema:name dimensions_id
    80 schema:value pub.1051676906
    81 rdf:type schema:PropertyValue
    82 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
    83 schema:name Technology
    84 rdf:type schema:DefinedTerm
    85 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
    86 schema:name Communications Technologies
    87 rdf:type schema:DefinedTerm
    88 sg:person.013624103516.76 schema:affiliation https://www.grid.ac/institutes/grid.11780.3f
    89 schema:familyName Penna
    90 schema:givenName Paolo
    91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013624103516.76
    92 rdf:type schema:Person
    93 sg:person.013762200435.42 schema:affiliation https://www.grid.ac/institutes/grid.11780.3f
    94 schema:familyName Ventre
    95 schema:givenName Carmine
    96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013762200435.42
    97 rdf:type schema:Person
    98 sg:pub.10.1007/3-540-44693-1_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022005518
    99 https://doi.org/10.1007/3-540-44693-1_11
    100 rdf:type schema:CreativeWork
    101 sg:pub.10.1007/978-0-387-35608-2_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046566820
    102 https://doi.org/10.1007/978-0-387-35608-2_11
    103 rdf:type schema:CreativeWork
    104 sg:pub.10.1007/978-0-387-35608-2_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001979081
    105 https://doi.org/10.1007/978-0-387-35608-2_7
    106 rdf:type schema:CreativeWork
    107 sg:pub.10.1007/978-3-540-24592-6_20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036424844
    108 https://doi.org/10.1007/978-3-540-24592-6_20
    109 rdf:type schema:CreativeWork
    110 sg:pub.10.1007/978-3-540-24749-4_37 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043516498
    111 https://doi.org/10.1007/978-3-540-24749-4_37
    112 rdf:type schema:CreativeWork
    113 sg:pub.10.1007/978-3-540-48413-4_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009665385
    114 https://doi.org/10.1007/978-3-540-48413-4_21
    115 rdf:type schema:CreativeWork
    116 sg:pub.10.1007/bf01294129 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049818437
    117 https://doi.org/10.1007/bf01294129
    118 rdf:type schema:CreativeWork
    119 sg:pub.10.1007/bf01726210 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003499590
    120 https://doi.org/10.1007/bf01726210
    121 rdf:type schema:CreativeWork
    122 sg:pub.10.1007/pl00004200 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002007481
    123 https://doi.org/10.1007/pl00004200
    124 rdf:type schema:CreativeWork
    125 sg:pub.10.1007/pl00009201 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011742700
    126 https://doi.org/10.1007/pl00009201
    127 rdf:type schema:CreativeWork
    128 https://doi.org/10.1006/game.1999.0790 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036056755
    129 rdf:type schema:CreativeWork
    130 https://doi.org/10.1006/jcss.2001.1754 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037137868
    131 rdf:type schema:CreativeWork
    132 https://doi.org/10.1016/0047-2727(76)90049-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008347259
    133 rdf:type schema:CreativeWork
    134 https://doi.org/10.1016/s0304-3975(02)00538-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021115986
    135 rdf:type schema:CreativeWork
    136 https://doi.org/10.1016/s0304-3975(03)00085-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025222313
    137 rdf:type schema:CreativeWork
    138 https://doi.org/10.1016/s0304-3975(98)00223-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030759533
    139 rdf:type schema:CreativeWork
    140 https://doi.org/10.1111/j.1540-6261.1961.tb02789.x schema:sameAs https://app.dimensions.ai/details/publication/pub.1043120435
    141 rdf:type schema:CreativeWork
    142 https://doi.org/10.1145/380752.380825 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028738557
    143 rdf:type schema:CreativeWork
    144 https://doi.org/10.1145/380752.380883 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018290072
    145 rdf:type schema:CreativeWork
    146 https://doi.org/10.1145/509907.509956 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048921259
    147 rdf:type schema:CreativeWork
    148 https://doi.org/10.1145/570810.570812 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041666416
    149 rdf:type schema:CreativeWork
    150 https://doi.org/10.1145/938985.939011 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022618940
    151 rdf:type schema:CreativeWork
    152 https://doi.org/10.2307/1914085 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069641186
    153 rdf:type schema:CreativeWork
    154 https://www.grid.ac/institutes/grid.11780.3f schema:alternateName University of Salerno
    155 schema:name Dipartimento di Informatica ed Applicazioni ”R.M. Capocelli”, Università di Salerno, via S. Allende 2, I-84081, Baronissi (SA), Italy
    156 rdf:type schema:Organization
     




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


    ...