Laplace transform applied to differential equations: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
No edit summary
 
Line 1: Line 1:
Human being who wrote the review is called Roberto Ledbetter and his wife shouldn't like it at every bit. His wife and your guy live in Idaho in addition he needs to exchange because of his spouse. In his [https://Www.google.com/search?hl=en&gl=us&tbm=nws&q=professional+life professional life] he is actually a filing assistant together with his salary has been recently really fulfilling. To go to karaoke is the thing your boyfriend loves most of every bit. He's been working on the length of his website for some era now. Check it available here: http://Circuspartypanama.com/<br><br>Stop by my [http://www.dict.cc/englisch-deutsch/web-site.html web-site] :: clash of clans hack tool ([http://Circuspartypanama.com/ visit this website])
{{You|date=November 2013}}
In a [[thought experiment]] proposed by the Italian probabilist [[Bruno de Finetti]] in order to justify [[Bayesian probability]], an array of wagers is '''coherent''' precisely if it does not expose the wagerer to certain loss regardless of the outcomes of events on which he is wagering, even if his opponent makes the most judicious choices.
 
==Operational subjective probabilities as wagering odds==
 
You must set the price of a promise to pay $1 if John Smith wins tomorrow's election, and $0 otherwise.  You know that your opponent will be able to choose either to buy such a promise from you at the price you have set, or require you to buy such a promise from him/her, still at the same price. In other words: you set the odds, but your opponent decides which side of the bet will be yours. The price you set is the "operational subjective probability" that you assign to the proposition on which you are betting.
 
=="Dutch books"==
 
A person who has set prices on an array of wagers in such a way that he or she will make a net gain regardless of the outcome, is said to have made a ''[[Dutch book]]''.
 
===A very trivial Dutch book===
 
The rules do not forbid you to set a price higher than $1, but if you do, your prudent opponent may sell you that high-priced ticket, and then your opponent comes out ahead regardless of the outcome of the event on which you bet.  Neither are you forbidden to set a negative price, but then your opponent may make you pay him to accept a promise from you to pay him later if a certain contingency eventuates.  Either way, you lose.  These lose-lose situations parallel the fact that a probability can neither exceed 1 nor be less than 0.
 
===A somewhat less trivial and more instructive Dutch book===
 
Now suppose you set the price of a promise to pay $1 if the Boston Red Sox win next year's World Series, and also the price of a promise to pay $1 if the New York Yankees win, and finally the price of a promise to pay $1 if ''either'' the Red Sox or the Yankees win.  You may set the prices in such a way that
 
:<math> \text{Price}(\text{Red Sox})+\text{Price}(\text{Yankees})\neq\text{Price}(\text{Red Sox or Yankees}) \, </math>
 
But if you set the price of the third ticket too low, your prudent opponent will buy that ticket and sell you the other two tickets.  By considering the three possible outcomes (Red Sox, Yankees, some other team), you will see that regardless of which of the three outcomes eventuates, you lose.  An analogous fate awaits you if you set the price of the third ticket too high relative to the other two prices. This parallels the fact that probabilities of [[mutually exclusive events]] are additive (see [[probability axioms]]).
 
==Conditional wagers and conditional probabilities==
 
Now imagine a more complicated scenario.  You must set the prices of three promises:
 
*to pay $1 if the Red Sox win tomorrow's game; the purchaser of this promise loses his bet if the Red Sox do not win regardless of whether their failure is due to their loss of a completed game or cancellation of the game, and
 
*to pay $1 if the Red Sox win, and to refund the price of the promise if the game is cancelled, and
 
*to pay $1 if the game is completed, regardless of who wins.
 
Three outcomes are possible: The game is cancelled; the game is played and the Red Sox lose; the game is played and the Red Sox win.  You may set the prices in such a way that
 
:<math>\text{Price}(\text{complete game})\times\text{Price}(\text{Red Sox win}\mid\text{complete game}) \neq \text{Price}(\text{Red Sox win})</math>
 
(where the second price above is that of the bet that includes the refund in case of cancellation). (Note: The prices here are the dimensionless numbers obtained by dividing by $1, which is the payout in all three cases.) Your prudent opponent writes three linear inequalities in three variables.  The variables are the amounts he will invest in each of the three promises; the value of one of these is negative if he will make you buy that promise and positive if he will buy it from you.  Each inequality corresponds to one of the three possible outcomes.  Each inequality states that your opponent's net gain is more than zero.  A solution exists if and only if the [[determinant]] of the matrix is not zero. That determinant is:
 
:<math>\text{Price}(\text{complete game})\times\text{Price}(\text{Red Sox win}\mid\text{complete game})-\text{Price}(\text{Red Sox win}).</math>
 
Thus your prudent opponent can make you a sure loser unless you set your prices in a way that parallels the simplest conventional characterization of [[conditional probability]].
 
== Coherence ==
 
It can be shown that the set of prices is coherent when they satisfy the [[probability axioms]] and related results such as the [[inclusion-exclusion principle]] (but not necessarily countable additivity).
 
==See also==
* [[Arbitrage-free]], analogous concept in mathematical finance
* [[Divide and choose]]
 
==References==
* Lad, Frank. ''Operational Subjective Statistical Methods: A Mathematical, Philosophical, and Historical Introduction.'' [[John Wiley & Sons|Wiley]], 1996.
 
==External links==
*[http://plato.stanford.edu/entries/epistemology-bayesian/ "Bayesian Epistemology"]
 
{{DEFAULTSORT:Coherence (Philosophical Gambling Strategy)}}
[[Category:Thought experiments]]
[[Category:Probability theory]]
[[Category:Wagering]]

Revision as of 19:57, 18 November 2013

Template:You In a thought experiment proposed by the Italian probabilist Bruno de Finetti in order to justify Bayesian probability, an array of wagers is coherent precisely if it does not expose the wagerer to certain loss regardless of the outcomes of events on which he is wagering, even if his opponent makes the most judicious choices.

Operational subjective probabilities as wagering odds

You must set the price of a promise to pay $1 if John Smith wins tomorrow's election, and $0 otherwise. You know that your opponent will be able to choose either to buy such a promise from you at the price you have set, or require you to buy such a promise from him/her, still at the same price. In other words: you set the odds, but your opponent decides which side of the bet will be yours. The price you set is the "operational subjective probability" that you assign to the proposition on which you are betting.

"Dutch books"

A person who has set prices on an array of wagers in such a way that he or she will make a net gain regardless of the outcome, is said to have made a Dutch book.

A very trivial Dutch book

The rules do not forbid you to set a price higher than $1, but if you do, your prudent opponent may sell you that high-priced ticket, and then your opponent comes out ahead regardless of the outcome of the event on which you bet. Neither are you forbidden to set a negative price, but then your opponent may make you pay him to accept a promise from you to pay him later if a certain contingency eventuates. Either way, you lose. These lose-lose situations parallel the fact that a probability can neither exceed 1 nor be less than 0.

A somewhat less trivial and more instructive Dutch book

Now suppose you set the price of a promise to pay $1 if the Boston Red Sox win next year's World Series, and also the price of a promise to pay $1 if the New York Yankees win, and finally the price of a promise to pay $1 if either the Red Sox or the Yankees win. You may set the prices in such a way that

Price(Red Sox)+Price(Yankees)Price(Red Sox or Yankees)

But if you set the price of the third ticket too low, your prudent opponent will buy that ticket and sell you the other two tickets. By considering the three possible outcomes (Red Sox, Yankees, some other team), you will see that regardless of which of the three outcomes eventuates, you lose. An analogous fate awaits you if you set the price of the third ticket too high relative to the other two prices. This parallels the fact that probabilities of mutually exclusive events are additive (see probability axioms).

Conditional wagers and conditional probabilities

Now imagine a more complicated scenario. You must set the prices of three promises:

  • to pay $1 if the Red Sox win tomorrow's game; the purchaser of this promise loses his bet if the Red Sox do not win regardless of whether their failure is due to their loss of a completed game or cancellation of the game, and
  • to pay $1 if the Red Sox win, and to refund the price of the promise if the game is cancelled, and
  • to pay $1 if the game is completed, regardless of who wins.

Three outcomes are possible: The game is cancelled; the game is played and the Red Sox lose; the game is played and the Red Sox win. You may set the prices in such a way that

Price(complete game)×Price(Red Sox wincomplete game)Price(Red Sox win)

(where the second price above is that of the bet that includes the refund in case of cancellation). (Note: The prices here are the dimensionless numbers obtained by dividing by $1, which is the payout in all three cases.) Your prudent opponent writes three linear inequalities in three variables. The variables are the amounts he will invest in each of the three promises; the value of one of these is negative if he will make you buy that promise and positive if he will buy it from you. Each inequality corresponds to one of the three possible outcomes. Each inequality states that your opponent's net gain is more than zero. A solution exists if and only if the determinant of the matrix is not zero. That determinant is:

Price(complete game)×Price(Red Sox wincomplete game)Price(Red Sox win).

Thus your prudent opponent can make you a sure loser unless you set your prices in a way that parallels the simplest conventional characterization of conditional probability.

Coherence

It can be shown that the set of prices is coherent when they satisfy the probability axioms and related results such as the inclusion-exclusion principle (but not necessarily countable additivity).

See also

References

  • Lad, Frank. Operational Subjective Statistical Methods: A Mathematical, Philosophical, and Historical Introduction. Wiley, 1996.

External links