This HTML5 document contains 30 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n9https://www.springer.com/us/book/
freebasehttp://rdf.freebase.com/ns/
n10http://math.ucsd.edu/~revans/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Silverman's_game
rdfs:label
Silverman's game
rdfs:comment
In game theory, Silverman's game is a two-person zero-sum game played on the unit square. It is named for mathematician . It is played by two players on a given set S of positive real numbers. Before play starts, a threshold T and penalty ν are chosen with 1 < T < ∞ and 0 < ν < ∞. For example, consider S to be the set of integers from 1 to n, T = 3 and ν = 2. A large number of variants have been studied, where the set S may be finite, countable, or uncountable. Extensions allow the two players to choose from different sets, such as the odd and even integers.
dct:subject
dbc:Non-cooperative_games
dbo:wikiPageID
17653787
dbo:wikiPageRevisionID
1021634893
dbo:wikiPageWikiLink
dbc:Non-cooperative_games dbr:American_Mathematical_Monthly dbr:Game_theory dbr:Zero-sum_game dbr:Unit_square dbr:Without_loss_of_generality dbr:Uncountable dbr:David_Silverman_(mathematician) dbr:Countable dbr:Positive_number
dbo:wikiPageExternalLink
n9:9783540592327 n10:Silverman.pdf
owl:sameAs
yago-res:Silverman's_game n14:4v77A wikidata:Q7516731 freebase:m.04792rz
dbp:wikiPageUsesTemplate
dbt:Cite_book dbt:Gametheory-stub dbt:Mvar dbt:Cite_journal dbt:Math
dbo:abstract
In game theory, Silverman's game is a two-person zero-sum game played on the unit square. It is named for mathematician . It is played by two players on a given set S of positive real numbers. Before play starts, a threshold T and penalty ν are chosen with 1 < T < ∞ and 0 < ν < ∞. For example, consider S to be the set of integers from 1 to n, T = 3 and ν = 2. Each player chooses an element of S, x and y. Suppose player A plays x and player B plays y. Without loss of generality, assume player A chooses the larger number, so x ≥ y. Then the payoff to A is 0 if x = y, 1 if 1 < x/y < T and −ν if x/y ≥ T. Thus each player seeks to choose the larger number, but there is a penalty of ν for choosing too large a number. A large number of variants have been studied, where the set S may be finite, countable, or uncountable. Extensions allow the two players to choose from different sets, such as the odd and even integers.
prov:wasDerivedFrom
wikipedia-en:Silverman's_game?oldid=1021634893&ns=0
dbo:wikiPageLength
2179
foaf:isPrimaryTopicOf
wikipedia-en:Silverman's_game