Fair infinite lotteries
| Type of Publication: | Journal article |
| Publication status: | Published |
| URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-2-q8l0bj0nvd0b8 |
| Author: | Wenmackers, Sylvia; Horsten, Leon |
| Year of publication: | 2013 |
| Published in: | Synthese ; 190 (2013), 1. - pp. 37-61. - Springer Science+Business Media B.V.. - ISSN 0039-7857. - eISSN 1573-0964 |
| DOI (citable link): | https://dx.doi.org/10.1007/s11229-010-9836-x |
| Summary: |
This article discusses how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. Techniques and ideas from non-standard analysis are brought to bear on the problem.
|
| Subject (DDC): | 100 Philosophy |
| Keywords: | Foundations of probability, Non-standard analysis, Countable additivity, Infinity |
| Link to License: | In Copyright |
| Refereed: | Yes |
Cite This
Files in this item
![[PDF]](/themes/Kops/images/mimes/pdf.png "PDF file"){kind=small}
WENMACKERS, Sylvia, Leon HORSTEN, 2013. Fair infinite lotteries. In: Synthese. Springer Science+Business Media B.V.. 190(1), pp. 37-61. ISSN 0039-7857. eISSN 1573-0964. Available under: doi: 10.1007/s11229-010-9836-x
@article{Wenmackers2013-01infin-48712, title={Fair infinite lotteries}, year={2013}, doi={10.1007/s11229-010-9836-x}, number={1}, volume={190}, issn={0039-7857}, journal={Synthese}, pages={37--61}, author={Wenmackers, Sylvia and Horsten, Leon} }
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/48712"> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/48712/1/Wenmackers_2-q8l0bj0nvd0b8.pdf"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/48712"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-02-19T11:27:09Z</dcterms:available> <dc:rights>terms-of-use</dc:rights> <dc:contributor>Horsten, Leon</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dcterms:issued>2013-01</dcterms:issued> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-02-19T11:27:09Z</dc:date> <dc:creator>Horsten, Leon</dc:creator> <dc:creator>Wenmackers, Sylvia</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dc:contributor>Wenmackers, Sylvia</dc:contributor> <dcterms:abstract xml:lang="eng">This article discusses how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. Techniques and ideas from non-standard analysis are brought to bear on the problem.</dcterms:abstract> <dcterms:title>Fair infinite lotteries</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/48712/1/Wenmackers_2-q8l0bj0nvd0b8.pdf"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:language>eng</dc:language> </rdf:Description> </rdf:RDF>
Downloads since Feb 19, 2020 (Information about access statistics)
| Wenmackers_2-q8l0bj0nvd0b8.pdf | 61 |
This item appears in the following Collection(s)
Search KOPS
Browse
My Account
