Vittorio Bilò


Ontology type: schema:Person     


Person Info

NAME

Vittorio

SURNAME

Bilò

Publications in SciGraph latest 50 shown

  • 2018-12-13 On Stackelberg Strategies in Affine Congestion Games in THEORY OF COMPUTING SYSTEMS
  • 2018-07 A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games in THEORY OF COMPUTING SYSTEMS
  • 2018 On Colorful Bin Packing Games in COMPUTING AND COMBINATORICS
  • 2016-11 On the performance of mildly greedy players in cut games in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2016 Opinion Formation Games with Dynamic Social Influences in WEB AND INTERNET ECONOMICS
  • 2016 On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games in ALGORITHMIC GAME THEORY
  • 2015 Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions in WEB AND INTERNET ECONOMICS
  • 2015-01 New bounds for the balloon popping problem in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2015-01 On the sequential price of anarchy of isolation games in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2015-01 Some Anomalies of Farsighted Strategic Behavior in THEORY OF COMPUTING SYSTEMS
  • 2015 On Stackelberg Strategies in Affine Congestion Games in WEB AND INTERNET ECONOMICS
  • 2014-04 Complexity of Rational and Irrational Nash Equilibria in THEORY OF COMPUTING SYSTEMS
  • 2014 The Price of Envy-Freeness in Machine Scheduling in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014
  • 2014 On the Performance of Mildly Greedy Players in Cut Games in COMPUTING AND COMBINATORICS
  • 2014 On Linear Congestion Games with Altruistic Social Context in COMPUTING AND COMBINATORICS
  • 2014 Approximating the Revenue Maximization Problem with Sharp Demands in ALGORITHM THEORY – SWAT 2014
  • 2014 Nash Stability in Fractional Hedonic Games in WEB AND INTERNET ECONOMICS
  • 2013-05 Improved Lower Bounds on the Price of Stability of Undirected Network Design Games in THEORY OF COMPUTING SYSTEMS
  • 2013 Some Anomalies of Farsighted Strategic Behavior in APPROXIMATION AND ONLINE ALGORITHMS
  • 2013 On the Sequential Price of Anarchy of Isolation Games in COMPUTING AND COMBINATORICS
  • 2013 On Lookahead Equilibria in Congestion Games in WEB AND INTERNET ECONOMICS
  • 2013 New Bounds for the Balloon Popping Problem in COMPUTING AND COMBINATORICS
  • 2013 A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games in APPROXIMATION AND ONLINE ALGORITHMS
  • 2012 The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games in ALGORITHMIC GAME THEORY
  • 2012 On Bidimensional Congestion Games in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2011-10 Graphical Congestion Games in ALGORITHMICA
  • 2011-10 On the performances of Nash equilibria in isolation games in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2011-07 Performance of One-Round Walks in Linear Congestion Games in THEORY OF COMPUTING SYSTEMS
  • 2011 Social Context Congestion Games in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2011 Complexity of Rational and Irrational Nash Equilibria in ALGORITHMIC GAME THEORY
  • 2010-08 Designing Fast Converging Cost Sharing Methods for Multicast Transmissions in THEORY OF COMPUTING SYSTEMS
  • 2010 Computing Exact and Approximate Nash Equilibria in 2-Player Games in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2010 Improved Lower Bounds on the Price of Stability of Undirected Network Design Games in ALGORITHMIC GAME THEORY
  • 2009-11-09 Game-Theoretic Approaches to Optimization Problems in Communication Networks in GRAPHS AND ALGORITHMS IN COMMUNICATION NETWORKS
  • 2009 Performances of One-Round Walks in Linear Congestion Games in ALGORITHMIC GAME THEORY
  • 2009 On the Performances of Nash Equilibria in Isolation Games in COMPUTING AND COMBINATORICS
  • 2008-04 On Nash equilibria for multicast transmissions in ad-hoc wireless networks in WIRELESS NETWORKS
  • 2008 Graphical Congestion Games in INTERNET AND NETWORK ECONOMICS
  • 2008 When Ignorance Helps: Graphical Multicast Cost Sharing Games in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008
  • 2007 Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007
  • 2007 On Satisfiability Games and the Power of Congestion Games in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2007 The Price of Nash Equilibria in Multicast Transmissions Games in ALGORITHMS AND COMPUTATION
  • 2005 Geometric Clustering to Minimize the Sum of Cluster Sizes in ALGORITHMS – ESA 2005
  • 2005 On Nash Equilibria in Non-cooperative All-Optical Networks in STACS 2005
  • 2004 An Improved Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph in EURO-PAR 2004 PARALLEL PROCESSING
  • 2004 On the Crossing Spanning Tree Problem in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2004 The Price of Anarchy in All-Optical Networks in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2004 On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks in ALGORITHMS AND COMPUTATION
  • 2003 Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem in EXPERIMENTAL AND EFFICIENT ALGORITHMS
  • 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", 
        "familyName": "Bil\u00f2", 
        "givenName": "Vittorio", 
        "id": "sg:person.012652036261.27", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012652036261.27"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:56", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1701.json", 
        "type": "Person"
      }
    ]
     

    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/person.012652036261.27'

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

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.012652036261.27'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.012652036261.27'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.012652036261.27'


     

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

    11 TRIPLES      9 PREDICATES      10 URIs      6 LITERALS      1 BLANK NODES

    Subject Predicate Object
    1 sg:person.012652036261.27 schema:familyName Bilò
    2 schema:givenName Vittorio
    3 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012652036261.27
    4 schema:sdDatePublished 2019-03-07T13:56
    5 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    6 schema:sdPublisher Nf794ec4f33284ed9bb951af8d5ef617b
    7 sgo:license sg:explorer/license/
    8 sgo:sdDataset persons
    9 rdf:type schema:Person
    10 Nf794ec4f33284ed9bb951af8d5ef617b schema:name Springer Nature - SN SciGraph project
    11 rdf:type schema:Organization
     




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


    ...