Document Type

Article

Publication Date

2024

DOI

10.3390/axioms13090641

Publication Title

Axioms

Volume

13

Issue

9

Pages

641 (1-13)

Abstract

There has been increasing interest in best–worst discrete choice experiments (BWDCEs) in health economics, transportation research, and other fields over the last few years. BWDCEs have distinct advantages compared to other measurement approaches in discrete choice experiments (DCEs). A systematic study of best–worst (BW) choice pairs can be traced back to the 1990s. Recently, new ideas have been introduced to the subject. Calculating utility helps measure the attractiveness of BW choices. The goal of this paper is twofold. First, we extend the idea of the BW choice pair to include dynamic, time-dependent transition probability and capture utility at each time and for each choice pair. Second, we used the geometry of BW choice pairs to capture the correlations among them and to characterize and clarify the BW choice pairs in the network, where properties can be derived within each class. This paper discusses BWDCEs, the probability transition matrix of choices over time, and the utility function. The proposed network classification for BW choice pairs is laid out. A detailed simulated example is presented, and the results are compared with the classical K-means classification.

Rights

© 2024 by the authors.

This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution 4.0 International (CC BY 4.0) License.

Data Availability

Article states: "The data presented in this study are available upon request from the corresponding author. Please note that the data are not publicly accessible as they are simulated."

Original Publication Citation

Adikari, S., Diawara, N., & Bar, H. (2024). The geometry of dynamic time-dependent best–worst choice pairs. Axioms, 13(9), 1-13, Article 641. https://doi.org/10.3390/axioms13090641

ORCID

0000-0001-6006-1591 (Adikari), 0000-0002-8403-6793 (Diawara)

Download

Share

COinS