paper-with-me

홈 › Papers

Multinomial logit processes and preference discovery: inside and outside the black box

2020-04-28 · Simone Cerreia-Vioglio, Fabio Maccheroni, Massimo Marinacci, Aldo Rustichini

We provide two characterizations, one axiomatic and the other neuro-computational, of the dependence of choice probabilities on deadlines, within the widely used softmax representation \[ p_{t}\left( a,A\right) =\dfrac{e^{\frac{u\left( a\right) }{\lambda \left( t\right) }+\alpha \left( a\right) }}{\sum_{b\in A}e^{\frac{u\left( b\right) }{\lambda \left( t\right) }+\alpha \left( b\right) }}% \] where $p_{t}\left( a,A\right) $ is the probability that alternative $a$ is selected from the set $A$ of feasible alternatives if $t$ is the time available to decide, $\lambda$ is a time dependent noise parameter measuring the unit cost of information, $u$ is a time independent utility function, and $\alpha$ is an alternative-specific bias that determines the initial choice probabilities reflecting prior information and memory anchoring. Our axiomatic analysis provides a behavioral foundation of softmax (also known as Multinomial Logit Model when $\alpha$ is constant). Our neuro-computational derivation provides a biologically inspired algorithm that may explain the emergence of softmax in choice behavior. Jointly, the two approaches provide a thorough understanding of soft-maximization in terms of internal causes (neurophysiological mechanisms) and external effects (testable implications).

📄 PDF Abstract BibTeX arXiv:2004.13376

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

Similar Papers 제목 키워드 기반

Context-aware Bayesian Mixed Multinomial Logit Model

2022-10-11 · Mirosława Łukawska, Anders Fjendbo Jensen, Filipe Rodrigues

The mixed multinomial logit model assumes constant preference parameters of a decision-maker throughout different choice situations, which may be considered too strong for certain choice modelling applications. This pape…

model

Embedding Foundation Model Predictions in Discrete-Choice Models with Structural Guarantees

2026-06-24 · Yingshuo Wang, Xian Sun, Yanhang Li, Zhichao Fan 외 arxiv

Tabular foundation models achieve strong accuracy on choice prediction tasks, but their predictions often violate the economic logic those tasks require: raising a price can increase predicted demand, implied willingness…

Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problem

2019-04-29 · Junyu Cao, Wei Sun

Motivated by the phenomenon that companies introduce new products to keep abreast with customers' rapidly changing tastes, we consider a novel online learning setting where a profit-maximizing seller needs to learn custo…

Product Recommendation

Enhancing Discrete Choice Models with Representation Learning

2018-12-23 · Brian Sifringer, Virginie Lurkin, Alexandre Alahi

In discrete choice modeling (DCM), model misspecifications may lead to limited predictability and biased parameter estimates. In this paper, we propose a new approach for estimating choice models in which we divide the s…

Discrete Choice Modelsparameter estimationRepresentation Learning

A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model

2017-07-25 · Xi Chen, Yuanzhi Li, Jieming Mao

We study the active learning problem of top-$k$ ranking from multi-wise comparisons under the popular multinomial logit model. Our goal is to identify the top-$k$ items with high probability by adaptively querying sets f…

Active Learning