{"title":"Optimal sequential strategy to improve the precision of the estimators in a discrete choice experiment: A simulation study","authors":"Daniel Pérez-Troncoso","doi":"10.1016/j.jocm.2022.100357","DOIUrl":null,"url":null,"abstract":"<div><h3>Introduction</h3><p>In order to solve the problems related to prior parameter misspecification in DCEs, Bliemer and Rose (2010) proposed a sequential approach where the design is updated after each respondent. This paper tries to find a more efficient alternative sequential method since the original proposal could be very time-consuming and expensive under some circumstances.</p></div><div><h3>Methods</h3><p>11 different strategies were simulated using 8 to 16 choice sets following a Monte Carlo approach. The accuracy and bias of the estimates of each strategy were studied using the relative error and mean value of their estimates.</p></div><div><h3>Results</h3><p>The DCE performs similarly to the original strategy by updating the design after five respondents. Among the other strategies, we discovered that, under certain circumstances, updating the design after 20 or 10 respondents led to accurate and not significantly biased estimates.</p></div><div><h3>Conclusions</h3><p>For a strategy to be efficient it might not be necessary to update the DCE after each respondent, but we found that updating the prior information relatively often and regularly can be almost as efficient as the original sequential proposal (for example, updating after five respondents might be a good choice). In addition, our findings suggest that each DCE has different efficient strategies depending on the number of attributes, levels, sets, and alternatives, so it can be concluded that a universal “optimal sequential strategy” does not exist.</p></div>","PeriodicalId":46863,"journal":{"name":"Journal of Choice Modelling","volume":"43 ","pages":"Article 100357"},"PeriodicalIF":2.8000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S175553452200015X/pdfft?md5=676288b9384f83deabe39007200e5f1f&pid=1-s2.0-S175553452200015X-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Choice Modelling","FirstCategoryId":"96","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S175553452200015X","RegionNum":3,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0
Abstract
Introduction
In order to solve the problems related to prior parameter misspecification in DCEs, Bliemer and Rose (2010) proposed a sequential approach where the design is updated after each respondent. This paper tries to find a more efficient alternative sequential method since the original proposal could be very time-consuming and expensive under some circumstances.
Methods
11 different strategies were simulated using 8 to 16 choice sets following a Monte Carlo approach. The accuracy and bias of the estimates of each strategy were studied using the relative error and mean value of their estimates.
Results
The DCE performs similarly to the original strategy by updating the design after five respondents. Among the other strategies, we discovered that, under certain circumstances, updating the design after 20 or 10 respondents led to accurate and not significantly biased estimates.
Conclusions
For a strategy to be efficient it might not be necessary to update the DCE after each respondent, but we found that updating the prior information relatively often and regularly can be almost as efficient as the original sequential proposal (for example, updating after five respondents might be a good choice). In addition, our findings suggest that each DCE has different efficient strategies depending on the number of attributes, levels, sets, and alternatives, so it can be concluded that a universal “optimal sequential strategy” does not exist.