Non-reversible betting games on fuzzy events: complexity and algebra

DOI10.1016/j.fss.2010.12.009zbMath1237.91064OpenAlexW2044856880MaRDI QIDQ533180

Tommaso Flaminio, Martina Fedel

Publication date: 2 May 2011

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2010.12.009

zbMATH Keywords

computational complexityNP-completenessfuzzy eventsnon-reversible bookmakers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probabilistic games; gambling (91A60) Fuzzy probability (60A86)

Related Items (1)

A logical characterization of coherence for imprecise probabilities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bookmaking over infinite-valued events
• MV-algebras with internal states and probabilistic fuzzy logics
• The coherence of Łukasiewicz assessments is NP-complete
• Tensor products and the Loomis-Sikorski theorem for MV-algebras
• 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
• Algebraizable 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: Non-reversible betting games on fuzzy events: complexity and algebra