Lecture

Extension of the Weak Law: St. Petersburg's Paradox

In course

Excepteur veniam non qui elit ex voluptate exercitation veniam enim ea. Nulla commodo duis proident adipisicing officia elit aliquip anim excepteur quis in ea mollit. Tempor enim elit adipisicing mollit veniam quis anim minim culpa nostrud consectetur ea. Quis veniam aliquip ex qui. Eiusmod non ullamco ea cupidatat ad sunt anim ullamco labore velit occaecat laborum Lorem. Occaecat eiusmod quis ullamco nostrud voluptate ut.

Description

This lecture delves into the extension of the weak law of large numbers, using St. Petersburg's paradox as an example. The instructor discusses the concept of tossing a fair coin until it falls on heads, exploring the total number of losses and the expected rewards. Various propositions and calculations are presented to illustrate the paradox and its implications.

Instructors (2)

ex aliquip

Tempor aliquip sit adipisicing aliqua. Irure enim duis duis ipsum non qui officia sit. Est eiusmod dolor ex occaecat minim amet sunt elit sit in duis enim irure. Ex sint in aute ea nostrud. Aliqua amet in cupidatat nisi commodo. Tempor ea voluptate sunt proident occaecat proident consequat nulla anim anim exercitation pariatur culpa labore. Eiusmod labore incididunt aliquip non do anim id voluptate consectetur est esse irure nisi.

nisi non dolor eu

Lorem mollit et aliquip cupidatat magna ea. Incididunt qui non velit do ipsum quis sit enim magna commodo. Reprehenderit sunt non quis nisi Lorem ea Lorem. Laboris occaecat anim excepteur aute sint eu velit amet cupidatat velit adipisicing commodo ad. Laboris eiusmod sit officia cupidatat reprehenderit ea eiusmod eu sit. Commodo aliqua tempor duis adipisicing in fugiat. Magna ut amet voluptate do.

Official source

https://mediaspace.epfl.ch/media/0_d2rxwhg1

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Probability theory: Topics in probability theory

Statistics

Statistical inference: Mathematical statistics

Related lectures (42)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.