Multinomial models with linear inequality constraints: Overview and improvements of computational methods for Bayesian inference
Many psychological theories can be operationalized as linear inequality constraints on the
parameters of multinomial distributions (eg, discrete choice analysis). These constraints can …
parameters of multinomial distributions (eg, discrete choice analysis). These constraints can …
Testing the foundations of signal detection theory in recognition memory.
Signal detection theory (SDT) plays a central role in the characterization of human
judgments in a wide range of domains, most prominently in recognition memory. But despite …
judgments in a wide range of domains, most prominently in recognition memory. But despite …
Are you an exception to your favorite decision theory? Behavioral decision research is a linda problem!
Stylized characteristics, such as loss aversion, risk aversion for gains, risk seeking for
losses, overweighting of small probabilities, and diminishing sensitivity permeate both …
losses, overweighting of small probabilities, and diminishing sensitivity permeate both …
Nonparametric analysis of random utility models: computational tools for statistical testing
Kitamura and Stoye (2018) recently proposed a nonparametric statistical test for random
utility models of consumer behavior. The test is formulated in terms of linear inequality …
utility models of consumer behavior. The test is formulated in terms of linear inequality …
Ising formulations of some graph-theoretic problems in psychological research: models and methods
It has been established in the fields of computer science and physics that many NP-hard and
NP-complete graph-theoretic problems can be formulated and solved as Ising spin models …
NP-complete graph-theoretic problems can be formulated and solved as Ising spin models …
Probabilistic Choice Induced by Strength of Preference
Just as we formulate detailed theories of utility or preference, so too should we theorize
carefully about strength of preference. Likewise, because behavior is inherently uncertain …
carefully about strength of preference. Likewise, because behavior is inherently uncertain …
Block-insertion-based algorithms for the linear ordering problem
The linear ordering problem (LOP) is an NP-hard combinatorial optimization problem with
wide applications. As the problem is computationally intractable, the only practical …
wide applications. As the problem is computationally intractable, the only practical …
Future Trends in the Design of Memetic Algorithms: the Case of the Linear Ordering Problem
The way heuristic optimizers are designed has evolved over the decades, as computing
power has increased. Initially, trajectory metaheuristics used to shape the state of the art in …
power has increased. Initially, trajectory metaheuristics used to shape the state of the art in …
(Ir) rationality of animal choice? A guide to testing transitivity
Testing rationality of decision-making and choice by evaluating the mathematical property of
transitivity has a long tradition in biology, economics, psychology, and zoology. This …
transitivity has a long tradition in biology, economics, psychology, and zoology. This …
Column Generation Algorithms for Nonparametric Analysis of Random Utility Models
B Smeulders - arxiv preprint arxiv:1812.01400, 2018 - arxiv.org
Kitamura and Stoye (2014) develop a nonparametric test for linear inequality constraints,
when these are are represented as vertices of a polyhedron instead of its faces. They …
when these are are represented as vertices of a polyhedron instead of its faces. They …