On the Complexity of Non-reversible Betting Games on Many-Valued Events

DOI10.1007/978-3-642-14055-6_10zbMath1213.68621OpenAlexW2105426769MaRDI QIDQ3163975

Tommaso Flaminio, Martina Fedel

Publication date: 27 October 2010

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14055-6_10

zbMATH Keywords

computational complexityNP-completenessnon-reversible bookmakersmany-valued events

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Unnamed Item
• Bookmaking over infinite-valued events
• The coherence of Łukasiewicz assessments is NP-complete
• Metamathematics of fuzzy logic
• Algebraic foundations of many-valued reasoning
• Averaging the truth-value in Łukasiewicz logic
• De Finetti theorem and Borel states in \([0, 1\)-valued algebraic logic]
• Complexity of fuzzy probability logics. II
• Models for Many-Valued Probabilistic Reasoning
• Algebraic Analysis of Many Valued Logics
• The Uncertain Reasoner's Companion
• Imprecise probabilities, bets and functional analytic methods in Łukasiewicz logic
• A theorem about infinite-valued sentential logic

This page was built for publication: On the Complexity of Non-reversible Betting Games on Many-Valued Events