Similar Search Results

Bayesian D-optimal choice designs for mixtures

Ruseckaite, Aiste; Goos, Peter; Fok, Dennis - 2014

algorithm to construct optimal experimental designs, assuming the multinomial logit model is used to analyze the choice data. To …

Persistent link: https://www.econbiz.de/10010350005

An integrated algorithm for the optimal design of stated choice experiments with partial profiles

Palhazi Cuervo, Daniel; Kessels, Roselinde; Goos, Peter; … - 2015

Persistent link: https://www.econbiz.de/10010486237

Fast Algorithms to Generate Individualized Designs for the Mixed Logit Choice Model

Crabbe, Marjolein - 2013

The mixed logit choice model has become the common standard to analyze transport behavior. Efficient design of the corresponding choice experiments is therefore indispensable to obtain precise knowledge of travelers' preferences. Accounting for the individual specific coefficients in the model,...

Persistent link: https://www.econbiz.de/10013083848

Optimal policy for dynamic assortment planning under multinomial logit models

Chen, Xi; Wang, Yining; Zhou, Yuan - In: Mathematics of operations research 46 (2021) 4, pp. 1639-1657

Persistent link: https://www.econbiz.de/10012796673

Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences

Aouad, Ali; Levi, Retsef; Segev, Danny - In: Operations research 66 (2018) 5, pp. 1321-1345

Persistent link: https://www.econbiz.de/10011932451

Estimating large-scale tree logit models

Jagabathula, Srikanth; Rusmevichientong, Paat; … - In: Operations research 72 (2024) 1, pp. 257-276

Persistent link: https://www.econbiz.de/10014505112

Undiscounted recursive path choice models : convergence properties and algorithms

Tien Mai; Frejinger, Emma - In: Transportation science 56 (2022) 6, pp. 1469-1482

Persistent link: https://www.econbiz.de/10014309379

Thompson Sampling for Online Personalized Assortment Optimization Problems with Multinomial Logit Choice Models

Cheung, Wang Chi - 2017

Motivated by online retail applications, we study the online personalized assortment optimization problem. A seller conducts sales by offering assortments of products to a stream of arriving customers. The customers' purchase behavior follows their respective personalized Multinomial Logit...

Persistent link: https://www.econbiz.de/10012943008

A divide and conquer algorithm for exploiting policy function monotonicity

Gordon, Grey; Qiu, Shi - In: Quantitative economics : QE ; journal of the … 9 (2018) 2, pp. 521-540

A divide and conquer algorithm for exploiting policy function monotonicity is proposed and analyzed. To solve a … discrete problem with n states and n choices, the algorithm requires at most nlog2(n)+5n objective function evaluations. In … technique can be combined with a method exploiting concavity to reduce evaluations to 14n+2log2(n). A version of the algorithm …

Persistent link: https://www.econbiz.de/10011994407

A Monte Carlo study of design-generating algorithms for the latent class mixed logit model

Falke, Andreas; Hruschka, Harald - In: OR spectrum : quantitative approaches in management 39 (2017) 4, pp. 1035-1053

Persistent link: https://www.econbiz.de/10011761306