Decision Theory with Resource-Bounded Agents

08/17/2013
by   Joseph Y. Halpern, et al.
0

There have been two major lines of research aimed at capturing resource-bounded players in game theory. The first, initiated by Rubinstein, charges an agent for doing costly computation; the second, initiated by Neyman, does not charge for computation, but limits the computation that agents can do, typically by modeling agents as finite automata. We review recent work on applying both approaches in the context of decision theory. For the first approach, we take the objects of choice in a decision problem to be Turing machines, and charge players for the "complexity" of the Turing machine chosen (e.g., its running time). This approach can be used to explain well-known phenomena like first-impression-matters biases (i.e., people tend to put more weight on evidence they hear early on) and belief polarization (two people with different prior beliefs, hearing the same evidence, can end up with diametrically opposed conclusions) as the outcomes of quite rational decisions. For the second approach, we model people as finite automata, and provide a simple algorithm that, on a problem that captures a number of settings of interest, provably performs optimally as the number of states in the automaton increases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2021

Resolution of the Linear-Bounded Automata Question

This work resolve a longstanding open question in automata theory, i.e. ...
research
08/17/2015

Reflective Oracles: A Foundation for Classical Game Theory

Classical game theory treats players as special---a description of a gam...
research
06/30/2020

Bounded Rationality in Las Vegas: Probabilistic Finite Automata PlayMulti-Armed Bandits

While traditional economics assumes that humans are fully rational agent...
research
12/22/2022

Real-valued affine automata compute beyond Turing machines

We show that bounded-error affine finite automata recognize uncountably ...
research
07/25/2023

Strategic Play By Resource-Bounded Agents in Security Games

Many studies have shown that humans are "predictably irrational": they d...
research
12/03/2018

Conscious enactive computation

This paper looks at recent debates in the enactivist literature on compu...
research
06/07/2021

Playing with words: Do people exploit loaded language to affect others' decisions for their own benefit?

In this article, we study whether people in the position of describing a...

Please sign up or login with your details

Forgot password? Click here to reset