Choosing on Sequences
- URL: http://arxiv.org/abs/2203.00070v1
- Date: Mon, 28 Feb 2022 20:16:24 GMT
- Title: Choosing on Sequences
- Authors: Bhavook Bhardwaj and Siddharth Chatterjee
- Abstract summary: We propose a new framework that considers choice from infinite sequences.
We show that bounded attention is due to the continuity of the choice functions with respect to a natural topology.
We introduce the notion of computability of a choice function using Turing machines and show that computable choice rules can be implemented by a finite automaton.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The standard economic model of choice assumes that a decision maker chooses
from sets of alternatives. A new branch of literature has considered the
problem of choosing from lists i.e. ordered sets. In this paper, we propose a
new framework that considers choice from infinite sequences. Our framework
provides a natural way to model decision making in settings where choice relies
on a string of recommendations. We introduce three broad classes of choice
rules in this framework. Our main result shows that bounded attention is due to
the continuity of the choice functions with respect to a natural topology. We
introduce some natural choice rules in this framework and provide their
axiomatic characterizations. Finally, we introduce the notion of computability
of a choice function using Turing machines and show that computable choice
rules can be implemented by a finite automaton.
Related papers
- A Unifying Framework for Online Optimization with Long-Term Constraints [62.35194099438855]
We study online learning problems in which a decision maker has to take a sequence of decisions subject to $m$ long-term constraints.
The goal is to maximize their total reward, while at the same time achieving small cumulative violation across the $T$ rounds.
We present the first best-of-both-world type algorithm for this general class problems, with no-regret guarantees both in the case in which rewards and constraints are selected according to an unknown model, and in the case in which they are selected at each round by an adversary.
arXiv Detail & Related papers (2022-09-15T16:59:19Z) - A Structured Span Selector [100.0808682810258]
We propose a novel grammar-based structured span selection model.
We evaluate our model on two popular span prediction tasks: coreference resolution and semantic role labeling.
arXiv Detail & Related papers (2022-05-08T23:58:40Z) - Decision-making with E-admissibility given a finite assessment of
choices [64.29961886833972]
We study the implications for decision-making with E-admissibility.
We use the mathematical framework of choice functions to specify choices and rejections.
We provide an algorithm that computes this extension by solving linear feasibility problems.
arXiv Detail & Related papers (2022-04-15T11:46:00Z) - Universal and data-adaptive algorithms for model selection in linear
contextual bandits [52.47796554359261]
We consider the simplest non-trivial instance of model-selection: distinguishing a simple multi-armed bandit problem from a linear contextual bandit problem.
We introduce new algorithms that explore in a data-adaptive manner and provide guarantees of the form $mathcalO(dalpha T1- alpha)$.
Our approach extends to model selection among nested linear contextual bandits under some additional assumptions.
arXiv Detail & Related papers (2021-11-08T18:05:35Z) - Temporal Abstraction in Reinforcement Learning with the Successor
Representation [65.69658154078007]
We argue that the successor representation (SR) can be seen as a natural substrate for the discovery and use of temporal abstractions.
We show how the SR can be used to discover options that facilitate either temporally-extended exploration or planning.
arXiv Detail & Related papers (2021-10-12T05:07:43Z) - Modularity in Reinforcement Learning via Algorithmic Independence in
Credit Assignment [79.5678820246642]
We show that certain action-value methods are more sample efficient than policy-gradient methods on transfer problems that require only sparse changes to a sequence of previously optimal decisions.
We generalize the recently proposed societal decision-making framework as a more granular formalism than the Markov decision process.
arXiv Detail & Related papers (2021-06-28T21:29:13Z) - Choice Set Confounding in Discrete Choice [29.25891648918572]
Existing learning methods overlook how choice set assignment affects the data.
We adapt methods from causal inference to the discrete choice setting.
We show that accounting for choice set confounding makes choices observed in hotel booking more consistent with rational utility-maximization.
arXiv Detail & Related papers (2021-05-17T15:39:02Z) - Learning Choice Functions via Pareto-Embeddings [3.1410342959104725]
We consider the problem of learning to choose from a given set of objects, where each object is represented by a feature vector.
We propose a learning algorithm that minimizes a differentiable loss function suitable for this task.
arXiv Detail & Related papers (2020-07-14T09:34:44Z) - Inference with Choice Functions Made Practical [1.1859913430860332]
We study how to infer new choices from previous choices in a conservative manner.
We use the theory of choice functions: a unifying mathematical framework for conservative decision making.
arXiv Detail & Related papers (2020-05-07T12:58:05Z) - Coherent and Archimedean choice in general Banach spaces [0.45687771576879593]
I introduce and study a new notion of Archimedeanity for binary and non-binary choice between options that live in an abstract Banach space.
The representation theorems proved here provide an axiomatic characterisation for, amongst many other choice methods, Levi's E-admissibility and Walley-Sen maximality.
arXiv Detail & Related papers (2020-02-13T11:57:50Z) - Choice Set Optimization Under Discrete Choice Models of Group Decisions [40.91593765662774]
We show how changing the choice set can be used to influence the preferences of a collection of decision-makers.
We use discrete choice modeling to develop an optimization framework for such interventions.
We show that these problems are NP-hard in general, but imposing restrictions reveals a fundamental boundary.
arXiv Detail & Related papers (2020-02-02T15:59:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.