= 27d567bc2d48d9f40e9ccc20ea370b15)
Oscar_Cunningham comments on Dutch Books and Decision Theory: An Introduction to a Long Conversation - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (100)
I have a question about Dutch books. If I give you a finite table of probabilities, is there a polynomial time algorithm that will verify that it is or is not Dutch bookable? Or: help me make this question better-posed.
It reminds me of Boolean satisfiability, which is known to be NP complete, but maybe the similarity is superficial.
If we let the probabilities go to 0 and 1, doesn't this problem just become SAT?
EDIT: As it turns out, no, no it doesn't.