Paolo Penna


Ontology type: schema:Person     


Person Info

NAME

Paolo

SURNAME

Penna

Publications in SciGraph latest 50 shown

  • 2018-09 The price of anarchy and stability in general noisy best-response dynamics in INTERNATIONAL JOURNAL OF GAME THEORY
  • 2017-12-22 Inversions from Sorting with Distance-Based Errors in SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2017-11-16 Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2017 Logit Dynamics with Concurrent Updates for Local Interaction Games in EXTENDED ABSTRACTS SUMMER 2015
  • 2016-09 Convergence to Equilibrium of Logit Dynamics for Strategic Games in ALGORITHMICA
  • 2016 On Computing the Total Displacement Number via Weighted Motzkin Paths in COMBINATORIAL ALGORITHMS
  • 2016 Bribeproof Mechanisms for Two-Values Domains in ALGORITHMIC GAME THEORY
  • 2015-11 Logit Dynamics with Concurrent Updates for Local Interaction Potential Games in ALGORITHMICA
  • 2015-10 Imperfect Best-Response Mechanisms in THEORY OF COMPUTING SYSTEMS
  • 2015-10 Mechanisms for Scheduling with Single-Bit Private Values in THEORY OF COMPUTING SYSTEMS
  • 2014 Data Delivery by Energy-Constrained Mobile Agents in ALGORITHMS FOR SENSOR SYSTEMS
  • 2013 Logit Dynamics with Concurrent Updates for Local Interaction Games in ALGORITHMS – ESA 2013
  • 2013 Imperfect Best-Response Mechanisms in ALGORITHMIC GAME THEORY
  • 2012 Mechanisms for Scheduling with Single-Bit Private Values in ALGORITHMIC GAME THEORY
  • 2011-01 Alternatives to truthfulness are hard to recognize in AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS
  • 2011-01 A response to “Mechanism Design with Partial Verification and Revelation Principle” in AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS
  • 2009 Private Capacities in Mechanism Design in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009
  • 2009 Online Train Disposition: To Wait or Not to Wait? in ROBUST AND ONLINE LARGE-SCALE OPTIMIZATION
  • 2009 Pseudonyms in Cost-Sharing Games in INTERNET AND NETWORK ECONOMICS
  • 2008 Interference Games in Wireless Networks in INTERNET AND NETWORK ECONOMICS
  • 2008 Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions in ALGORITHMS - ESA 2008
  • 2008 Alternatives to Truthfulness Are Hard to Recognize in ALGORITHMIC GAME THEORY
  • 2007 An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2006 Strongly Polynomial-Time Truthful Mechanisms in One Shot in INTERNET AND NETWORK ECONOMICS
  • 2006 New Constructions of Mechanisms with Verification in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2006 The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms in STACS 2006
  • 2005-07 XOR-Based Schemes for Fast Parallel IP Lookups in THEORY OF COMPUTING SYSTEMS
  • 2005 On Designing Truthful Mechanisms for Online Scheduling in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2005 Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks in AD-HOC, MOBILE, AND WIRELESS NETWORKS
  • 2005 Free-Riders in Steiner Tree Cost-Sharing Games in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2005 More Powerful and Simpler Cost-Sharing Methods in APPROXIMATION AND ONLINE ALGORITHMS
  • 2004-04 On the Power Assignment Problem in Radio Networks in MOBILE NETWORKS AND APPLICATIONS
  • 2004 Truthful Mechanisms for Generalized Utilitarian Problems in EXPLORING NEW FRONTIERS OF THEORETICAL INFORMATICS
  • 2004 Sharing the Cost of Multicast Transmissions in Wireless Networks in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2004 Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines in STACS 2004
  • 2004 The Power of Verification for One-Parameter Agents in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2004 Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms in APPROXIMATION AND ONLINE ALGORITHMS
  • 2003-05-13 Improving Customer Proximity to Railway Stations in ALGORITHMS AND COMPLEXITY
  • 2003-05-13 XOR-Based Schemes for Fast Parallel IP Lookups in ALGORITHMS AND COMPLEXITY
  • 2003-02-11 The Minimum Range Assignment Problem on Linear Radio Networks in ALGORITHMS - ESA 2000
  • 2003 Noisy Data Make the Partial Digest Problem NP-hard in ALGORITHMS IN BIOINFORMATICS
  • 2003 Online Load Balancing Made Simple: Greedy Strikes Back in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002-04-12 Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines in STACS 99
  • 2002 Server Placements, Roman Domination and Other Dominating Set Variants in FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING
  • 2001-12-04 On the Complexity of Train Assignment Problems in ALGORITHMS AND COMPUTATION
  • 2001 On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs in STACS 2001
  • 2001 On Computing Ad-hoc Selective Families in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES
  • 2000 The Power Range Assignment Problem in Radio Networks on the Plane in STACS 2000
  • 1999-01-15 Proximity Drawings: Three Dimensions Are Better than Two in GRAPH DRAWING
  • 1999 Hardness Results for the Power Range Assignment Problem in Packet Radio Networks in RANDOMIZATION, APPROXIMATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 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", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.5801.c", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Penna", 
        "givenName": "Paolo", 
        "id": "sg:person.013624103516.76", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013624103516.76"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:13", 
        "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_1989.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.013624103516.76'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...