Hi,
Sharing a paper Siddharth Chatterjee and I wrote titled “Decisions over Sequences: Computability and Choice”
Abstract
A framework is introduced in which decision makers face alternatives sequentially.
We study endogenous stopping behavior using two broad classes of decision rules: stopping
rules and bounded stopping rules. Our key result establishes their equivalence. Two important
consequences are then explored. First, using Turing machines, we define computable rules and
show they can be implemented via finite automata. Second, we extend choice theory from inputs as sets or finite lists to infinite sequences of alternatives. The equivalence allows developing testable theories of choice in this framework. We develop a revealed preference “toolkit" and characterize threshold based and satisficing choice procedures.
We hope that you find something interesting in it!
Any comments will be greatly appreciated.
Regards,
Bhavook Bhardwaj