Elias Koutsoupias


Ontology type: schema:Person     


Person Info

NAME

Elias

SURNAME

Koutsoupias

Publications in SciGraph latest 50 shown

  • 2018 Online Trading as a Secretary Problem in ALGORITHMIC GAME THEORY
  • 2017 Carpooling in Social Networks in EXTENDED ABSTRACTS SUMMER 2015
  • 2016 Revenue Maximization for Market Intermediation with Correlated Priors in ALGORITHMIC GAME THEORY
  • 2016 The Anarchy of Scheduling Without Money in ALGORITHMIC GAME THEORY
  • 2015 Selling Two Goods Optimally in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2014-04 Scheduling Without Payments in THEORY OF COMPUTING SYSTEMS
  • 2013-07 Preface to Special Issue on Algorithmic Game Theory in THEORY OF COMPUTING SYSTEMS
  • 2013-05 A Lower Bound of 1+φ for Truthful Scheduling Mechanisms in ALGORITHMICA
  • 2013 Prior-Free Auctions of Digital Goods in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013
  • 2012-12 Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait? in ALGORITHMICA
  • 2012 Competitive Analysis of Maintaining Frequent Items of a Stream in ALGORITHM THEORY – SWAT 2012
  • 2012 Contention Issues in Congestion Games in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2011-09 On the Performance of Approximate Equilibria in Congestion Games in ALGORITHMICA
  • 2011 Scheduling without Payments in ALGORITHMIC GAME THEORY
  • 2011 Recent Developments in the Mechanism Design Problem for Scheduling in FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2010 On the Competitive Ratio of Online Sampling Auctions in INTERNET AND NETWORK ECONOMICS
  • 2009-12 A Lower Bound for Scheduling Mechanisms in ALGORITHMICA
  • 2009 On the Performance of Approximate Equilibria in Congestion Games in ALGORITHMS - ESA 2009
  • 2009 Competitive Analysis of Aggregate Max in Windowed Streaming in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2008 A Characterization of 2-Player Mechanisms for Scheduling in ALGORITHMS - ESA 2008
  • 2007 Mechanism Design for Fractional Scheduling on Unrelated Machines in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2007 Selfish Load Balancing Under Partial Knowledge in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007
  • 2007 A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007
  • 2005 On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, in ALGORITHMS – ESA 2005
  • 2005 Experiments with an Economic Model of the Worldwide Web in INTERNET AND NETWORK ECONOMICS
  • 2004 Congestion Games and Coordination Mechanisms in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004
  • 2004 Coordination Mechanisms in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2004 The Online Matching Problem on a Line in APPROXIMATION AND ONLINE ALGORITHMS
  • 2003-12 Approximate Equilibria and Ball Fusion in THEORY OF COMPUTING SYSTEMS
  • 2002-04-12 Worst-Case Equilibria in STACS 99
  • 2002 Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002 The Structure and Complexity of Nash Equilibria for a Selfish Routing Game in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2000 On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem in STACS 2000
  • 2000 The CNN Problem and Other k-Server Variants in STACS 2000
  • 1999-01 Competitive Implementation of Parallel Programs in ALGORITHMICA
  • 1996 Searching a fixed graph in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 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": "Koutsoupias", 
        "givenName": "Elias", 
        "id": "sg:person.016555647611.20", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016555647611.20"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:40", 
        "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_1453.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.016555647611.20'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     

    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.016555647611.20 schema:familyName Koutsoupias
    2 schema:givenName Elias
    3 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016555647611.20
    4 schema:sdDatePublished 2019-03-07T13:40
    5 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    6 schema:sdPublisher Neeb1b672adc649cf8172b9071925d543
    7 sgo:license sg:explorer/license/
    8 sgo:sdDataset persons
    9 rdf:type schema:Person
    10 Neeb1b672adc649cf8172b9071925d543 schema:name Springer Nature - SN SciGraph project
    11 rdf:type schema:Organization
     




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


    ...