Games Other People Play View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2005

AUTHORS

Christos H. Papadimitriou

ABSTRACT

Games were used by Wittgenstein as an example in the philosophy of language of a concept that can have many and dramatically divergent meanings in different contexts.Case in point: Games are familiar in the Concurrency community as models of dynamic, multi-staged threats to correctness. In Economics, on the other hand, games refer to a family of mathematical models (including, strictly speaking, the games alluded to above) whose intention is to model the behavior of rational, selfish agents in the face of situations that are to varying degrees competitive and cooperative. In recent years there has been an increasingly active interface, motivated by the advent of the Internet, between the theory of games on the one hand, and the theory of algorithms and complexity on the other, and both with networking. This corpus of research problems and reults is already quite extensive, rich, and diverse; however, one can identify in it at least three salient themes: First, there is the endeavor of developing efficient algorithms for the fundamental computational problems associated with games, such as finding Nash and other equilibria; this quest is more than the predictable reflex of our research community, but it is arguably of fundamental value to Game Theory at large. There is also the field of algorithmic mechanism design, striving to devise computationally efficient methods for designing games whose equilibria are precisely the socially desirable outcomes (for example, that the person who has the highest personal appreciation for the item being auctioned actually wins the auction). And finally we have an ever-expanding family of problems collectively given the playful name “the price of anarchy,” studying how much worse a system emerging from the spontaneous interaction of a group of selfish agents can be when compared with the ideal optimum design.This talk will review recent results and open problems in these areas. More... »

PAGES

5-5

Book

TITLE

CONCUR 2005 – Concurrency Theory

ISBN

978-3-540-28309-6
978-3-540-31934-4

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/11539452_4

DOI

http://dx.doi.org/10.1007/11539452_4

DIMENSIONS

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


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/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of California, Berkeley", 
          "id": "http://www.grid.ac/institutes/grid.47840.3f", 
          "name": [
            "University of California, Berkeley"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Papadimitriou", 
        "givenName": "Christos H.", 
        "id": "sg:person.013233165465.63", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013233165465.63"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2005", 
    "datePublishedReg": "2005-01-01", 
    "description": "Games were used by Wittgenstein as an example in the philosophy of language of a concept that can have many and dramatically divergent meanings in different contexts.Case in point: Games are familiar in the Concurrency community as models of dynamic, multi-staged threats to correctness. In Economics, on the other hand, games refer to a family of mathematical models (including, strictly speaking, the games alluded to above) whose intention is to model the behavior of rational, selfish agents in the face of situations that are to varying degrees competitive and cooperative. In recent years there has been an increasingly active interface, motivated by the advent of the Internet, between the theory of games on the one hand, and the theory of algorithms and complexity on the other, and both with networking. This corpus of research problems and reults is already quite extensive, rich, and diverse; however, one can identify in it at least three salient themes: First, there is the endeavor of developing efficient algorithms for the fundamental computational problems associated with games, such as finding Nash and other equilibria; this quest is more than the predictable reflex of our research community, but it is arguably of fundamental value to Game Theory at large. There is also the field of algorithmic mechanism design, striving to devise computationally efficient methods for designing games whose equilibria are precisely the socially desirable outcomes (for example, that the person who has the highest personal appreciation for the item being auctioned actually wins the auction). And finally we have an ever-expanding family of problems collectively given the playful name \u201cthe price of anarchy,\u201d studying how much worse a system emerging from the spontaneous interaction of a group of selfish agents can be when compared with the ideal optimum design.This talk will review recent results and open problems in these areas.", 
    "editor": [
      {
        "familyName": "Abadi", 
        "givenName": "Mart\u00edn", 
        "type": "Person"
      }, 
      {
        "familyName": "de Alfaro", 
        "givenName": "Luca", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11539452_4", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-28309-6", 
        "978-3-540-31934-4"
      ], 
      "name": "CONCUR 2005 \u2013 Concurrency Theory", 
      "type": "Book"
    }, 
    "keywords": [
      "selfish agents", 
      "fundamental computational problem", 
      "theory of algorithms", 
      "algorithmic mechanism design", 
      "family of problems", 
      "computational problems", 
      "theory of games", 
      "efficient algorithm", 
      "mathematical model", 
      "research problem", 
      "research community", 
      "price of anarchy", 
      "open problem", 
      "game theory", 
      "algorithm", 
      "mechanism design", 
      "game", 
      "recent results", 
      "optimum design", 
      "spontaneous interaction", 
      "problem", 
      "efficient method", 
      "theory", 
      "Internet", 
      "different contexts", 
      "recent years", 
      "correctness", 
      "complexity", 
      "language", 
      "active interface", 
      "design", 
      "corpus", 
      "model", 
      "equilibrium", 
      "interface", 
      "system", 
      "advent", 
      "concept", 
      "threat", 
      "example", 
      "hand", 
      "context", 
      "NASH", 
      "situation", 
      "community", 
      "prices", 
      "method", 
      "point", 
      "fundamental values", 
      "anarchy", 
      "desirable outcomes", 
      "name", 
      "endeavor", 
      "divergent meanings", 
      "face", 
      "field", 
      "intention", 
      "family", 
      "agents", 
      "people", 
      "results", 
      "cases", 
      "economics", 
      "behavior", 
      "area", 
      "meaning", 
      "quest", 
      "values", 
      "degree", 
      "talk", 
      "philosophy", 
      "interaction", 
      "themes", 
      "reults", 
      "years", 
      "salient themes", 
      "philosophy of language", 
      "Wittgenstein", 
      "group", 
      "outcomes", 
      "reflex", 
      "Concurrency community", 
      "multi-staged threats", 
      "face of situations", 
      "predictable reflex", 
      "playful name", 
      "ideal optimum design"
    ], 
    "name": "Games Other People Play", 
    "pagination": "5-5", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1053019977"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11539452_4"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11539452_4", 
      "https://app.dimensions.ai/details/publication/pub.1053019977"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:17", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_3.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/11539452_4"
  }
]
 

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/11539452_4'

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/11539452_4'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/11539452_4'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/11539452_4'


 

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

152 TRIPLES      23 PREDICATES      113 URIs      106 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/11539452_4 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N0d6fecbfbf414b3cbd38176d1572b674
4 schema:datePublished 2005
5 schema:datePublishedReg 2005-01-01
6 schema:description Games were used by Wittgenstein as an example in the philosophy of language of a concept that can have many and dramatically divergent meanings in different contexts.Case in point: Games are familiar in the Concurrency community as models of dynamic, multi-staged threats to correctness. In Economics, on the other hand, games refer to a family of mathematical models (including, strictly speaking, the games alluded to above) whose intention is to model the behavior of rational, selfish agents in the face of situations that are to varying degrees competitive and cooperative. In recent years there has been an increasingly active interface, motivated by the advent of the Internet, between the theory of games on the one hand, and the theory of algorithms and complexity on the other, and both with networking. This corpus of research problems and reults is already quite extensive, rich, and diverse; however, one can identify in it at least three salient themes: First, there is the endeavor of developing efficient algorithms for the fundamental computational problems associated with games, such as finding Nash and other equilibria; this quest is more than the predictable reflex of our research community, but it is arguably of fundamental value to Game Theory at large. There is also the field of algorithmic mechanism design, striving to devise computationally efficient methods for designing games whose equilibria are precisely the socially desirable outcomes (for example, that the person who has the highest personal appreciation for the item being auctioned actually wins the auction). And finally we have an ever-expanding family of problems collectively given the playful name “the price of anarchy,” studying how much worse a system emerging from the spontaneous interaction of a group of selfish agents can be when compared with the ideal optimum design.This talk will review recent results and open problems in these areas.
7 schema:editor Nc5a5f37c68714298a1870dd8109820a3
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N763046de9a6d4b2ba952df1028162247
12 schema:keywords Concurrency community
13 Internet
14 NASH
15 Wittgenstein
16 active interface
17 advent
18 agents
19 algorithm
20 algorithmic mechanism design
21 anarchy
22 area
23 behavior
24 cases
25 community
26 complexity
27 computational problems
28 concept
29 context
30 corpus
31 correctness
32 degree
33 design
34 desirable outcomes
35 different contexts
36 divergent meanings
37 economics
38 efficient algorithm
39 efficient method
40 endeavor
41 equilibrium
42 example
43 face
44 face of situations
45 family
46 family of problems
47 field
48 fundamental computational problem
49 fundamental values
50 game
51 game theory
52 group
53 hand
54 ideal optimum design
55 intention
56 interaction
57 interface
58 language
59 mathematical model
60 meaning
61 mechanism design
62 method
63 model
64 multi-staged threats
65 name
66 open problem
67 optimum design
68 outcomes
69 people
70 philosophy
71 philosophy of language
72 playful name
73 point
74 predictable reflex
75 price of anarchy
76 prices
77 problem
78 quest
79 recent results
80 recent years
81 reflex
82 research community
83 research problem
84 results
85 reults
86 salient themes
87 selfish agents
88 situation
89 spontaneous interaction
90 system
91 talk
92 themes
93 theory
94 theory of algorithms
95 theory of games
96 threat
97 values
98 years
99 schema:name Games Other People Play
100 schema:pagination 5-5
101 schema:productId N95b6881882f0485591baaf557801c81d
102 Nde8f65396bf1445d96eb71403f7324b3
103 schema:publisher N189613789fea41c9bfffd55acd4757bb
104 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053019977
105 https://doi.org/10.1007/11539452_4
106 schema:sdDatePublished 2022-01-01T19:17
107 schema:sdLicense https://scigraph.springernature.com/explorer/license/
108 schema:sdPublisher N6dde7f8a04f14abbb59e5f13c7bf08dd
109 schema:url https://doi.org/10.1007/11539452_4
110 sgo:license sg:explorer/license/
111 sgo:sdDataset chapters
112 rdf:type schema:Chapter
113 N0d6fecbfbf414b3cbd38176d1572b674 rdf:first sg:person.013233165465.63
114 rdf:rest rdf:nil
115 N189613789fea41c9bfffd55acd4757bb schema:name Springer Nature
116 rdf:type schema:Organisation
117 N326a4afd477a4b79a261aa8017fb8395 rdf:first N57ee54f280564b02a73c00de2215c05a
118 rdf:rest rdf:nil
119 N57ee54f280564b02a73c00de2215c05a schema:familyName de Alfaro
120 schema:givenName Luca
121 rdf:type schema:Person
122 N6dde7f8a04f14abbb59e5f13c7bf08dd schema:name Springer Nature - SN SciGraph project
123 rdf:type schema:Organization
124 N763046de9a6d4b2ba952df1028162247 schema:isbn 978-3-540-28309-6
125 978-3-540-31934-4
126 schema:name CONCUR 2005 – Concurrency Theory
127 rdf:type schema:Book
128 N95b6881882f0485591baaf557801c81d schema:name dimensions_id
129 schema:value pub.1053019977
130 rdf:type schema:PropertyValue
131 Nc5a5f37c68714298a1870dd8109820a3 rdf:first Nd84c2fed2cf2428c9928358654666fd8
132 rdf:rest N326a4afd477a4b79a261aa8017fb8395
133 Nd84c2fed2cf2428c9928358654666fd8 schema:familyName Abadi
134 schema:givenName Martín
135 rdf:type schema:Person
136 Nde8f65396bf1445d96eb71403f7324b3 schema:name doi
137 schema:value 10.1007/11539452_4
138 rdf:type schema:PropertyValue
139 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
140 schema:name Information and Computing Sciences
141 rdf:type schema:DefinedTerm
142 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
143 schema:name Computation Theory and Mathematics
144 rdf:type schema:DefinedTerm
145 sg:person.013233165465.63 schema:affiliation grid-institutes:grid.47840.3f
146 schema:familyName Papadimitriou
147 schema:givenName Christos H.
148 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013233165465.63
149 rdf:type schema:Person
150 grid-institutes:grid.47840.3f schema:alternateName University of California, Berkeley
151 schema:name University of California, Berkeley
152 rdf:type schema:Organization
 




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


...