New framework analyzes sequential decision-making with computable rules

This paper introduces a new framework for analyzing sequential decision-making, focusing on endogenous stopping behavior. It defines computable rules using Turing machines and establishes their equivalence with finite automata. The research extends abstract choice theory to infinite sequences of alternatives, providing testable implications and a revealed-preference toolkit to characterize specific choice procedures like threshold-based and satisficing methods. AI

RANK_REASON Academic paper published on arXiv detailing a new theoretical framework. [lever_c_demoted from research: ic=1 ai=0.4]

Read on arXiv cs.CL →

• arXiv
• Bhavook Bhardwaj
• finite-state machine
• Hugging Face
• Turing machine

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →