An Ambiguous State Machine
We show that a replicated state machine (such as a blockchain protocol) can retain liveness in a strategic setting even while facing substantial ambiguity over certain events. This is implemented by a complementary protocol called "Machine II", which generates a non-ergodic value within chosen intervals such that no limiting frequency can be observed. We show how to implement this machine algorithmically and how it might be applied strategically as a mechanism for "veiling" actions. We demonstrate that welfare-enhancing applications for veiling exist for users belonging to a wide class of ambiguity attitudes, e.g. Binmore (2016), Gul and Pesendorfer (2014). Our approach is illustrated with applications to forking disputes in blockchain oracles and to Constant Function Market Makers, allowing the protocol to retain liveness without exposing their users to sure-loss.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Encoders Help You Disambiguate Word Senses in Neural Machine Translation
Neural machine translation (NMT) has achieved new state-of-the-art performance in translating ambiguous words. However, it is still unclear which component dominates the process of disambiguation. In this paper, we explo…
DecoderMachine TranslationNMTTranslation+1Towards Effective Disambiguation for Machine Translation with Large Language Models
Resolving semantic ambiguity has long been recognised as a central challenge in the field of Machine Translation. Recent work on benchmarking translation performance on ambiguous sentences has exposed the limitations of …
BenchmarkingIn-Context LearningMachine TranslationNMT+1Hybrid uncertainty quantification for selective text classification in ambiguous tasks
Many text classification tasks are inherently ambiguous, which results in automatic systems having a high risk of making mistakes, in spite of using advanced machine learning models. For example, toxicity detection in us…
text-classificationText ClassificationUncertainty QuantificationUnambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata
Nonuniform families of polynomial-size finite automata, which are series of indexed finite automata having polynomially many inner states, are used in the past literature to solve nonuniform families of promise decision …
An Analysis of Attention Mechanisms: The Case of Word Sense Disambiguation in Neural Machine Translation
Recent work has shown that the encoder-decoder attention mechanisms in neural machine translation (NMT) are different from the word alignment in statistical machine translation. In this paper, we focus on analyzing encod…
DecoderMachine TranslationNMTTranslation+2