A strategic implementation of the Average Tree solution for cycle-free graph games.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jet/BrinkLM13
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jet/BrinkLM13
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Gerard_van_der_Laan
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nigel_Moes
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ren%E2%88%9A%C2%A9_van_den_Brink
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.jet.2013.07.018
>
foaf:
homepage
<
https://doi.org/10.1016/j.jet.2013.07.018
>
dc:
identifier
DBLP journals/jet/BrinkLM13
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.jet.2013.07.018
(xsd:string)
dcterms:
issued
2013
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jet
>
rdfs:
label
A strategic implementation of the Average Tree solution for cycle-free graph games.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Gerard_van_der_Laan
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nigel_Moes
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ren%E2%88%9A%C2%A9_van_den_Brink
>
swrc:
number
6
(xsd:string)
swrc:
pages
2737-2748
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jet/BrinkLM13/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jet/BrinkLM13
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jet/jet148.html#BrinkLM13
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.jet.2013.07.018
>
dc:
title
A strategic implementation of the Average Tree solution for cycle-free graph games.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
148
(xsd:string)