多离散需求的顺序选择模型

Sanghak Lee, Sunghoon Kim, Sungho Park
{"title":"多离散需求的顺序选择模型","authors":"Sanghak Lee, Sunghoon Kim, Sungho Park","doi":"10.1007/s11129-022-09250-9","DOIUrl":null,"url":null,"abstract":"<p>Consumer demand in a marketplace is often characterized to be multiple discrete in that discrete units of multiple products are chosen together. This paper develops a sequential choice model for such demand and its estimation technique. Given an inherently high-dimensional problem to solve, a consumer is assumed to simplify it to a sequence of one-unit choices, which eventually leads to a shopping basket of multiple discreteness. Our model and its estimation method are flexible enough to be extended to various contexts such as complementary demand, non-linear pricing, and multiple constraints. The sequential choice process generally finds an optimal solution of a convex problem (e.g., maximizing a concave utility function over a convex feasible set), while it might result in a sub-optimal solution for a non-convex problem. Therefore, in case of a convex optimization problem, the proposed model can be viewed as an econometrician’s means for establishing the optimality of observed demand, offering a practical estimation algorithm for discrete optimization models of consumer demand. We demonstrate the strengths of our model in a variety of simulation studies and an empirical application to consumer panel data of yogurt purchase.</p>","PeriodicalId":501397,"journal":{"name":"Quantitative Marketing and Economics","volume":"8 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A sequential choice model for multiple discrete demand\",\"authors\":\"Sanghak Lee, Sunghoon Kim, Sungho Park\",\"doi\":\"10.1007/s11129-022-09250-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Consumer demand in a marketplace is often characterized to be multiple discrete in that discrete units of multiple products are chosen together. This paper develops a sequential choice model for such demand and its estimation technique. Given an inherently high-dimensional problem to solve, a consumer is assumed to simplify it to a sequence of one-unit choices, which eventually leads to a shopping basket of multiple discreteness. Our model and its estimation method are flexible enough to be extended to various contexts such as complementary demand, non-linear pricing, and multiple constraints. The sequential choice process generally finds an optimal solution of a convex problem (e.g., maximizing a concave utility function over a convex feasible set), while it might result in a sub-optimal solution for a non-convex problem. Therefore, in case of a convex optimization problem, the proposed model can be viewed as an econometrician’s means for establishing the optimality of observed demand, offering a practical estimation algorithm for discrete optimization models of consumer demand. We demonstrate the strengths of our model in a variety of simulation studies and an empirical application to consumer panel data of yogurt purchase.</p>\",\"PeriodicalId\":501397,\"journal\":{\"name\":\"Quantitative Marketing and Economics\",\"volume\":\"8 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantitative Marketing and Economics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11129-022-09250-9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantitative Marketing and Economics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11129-022-09250-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

市场中的消费者需求通常具有多重离散的特征,因为多种产品的离散单元被选择在一起。本文建立了一种针对此类需求的顺序选择模型及其估计技术。给定一个固有的高维问题要解决,假设消费者将其简化为一个单单位选择序列,这最终导致了多个离散的购物篮。我们的模型及其估计方法足够灵活,可以扩展到各种情况下,如互补需求、非线性定价和多约束。顺序选择过程通常会找到凸问题的最优解(例如,在凸可行集上最大化凹效用函数),而它可能会导致非凸问题的次优解。因此,对于凸优化问题,所提出的模型可以看作是计量经济学家建立观察需求最优性的手段,为消费者需求的离散优化模型提供了一种实用的估计算法。我们在各种模拟研究和酸奶购买消费者面板数据的实证应用中证明了我们模型的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A sequential choice model for multiple discrete demand

A sequential choice model for multiple discrete demand

Consumer demand in a marketplace is often characterized to be multiple discrete in that discrete units of multiple products are chosen together. This paper develops a sequential choice model for such demand and its estimation technique. Given an inherently high-dimensional problem to solve, a consumer is assumed to simplify it to a sequence of one-unit choices, which eventually leads to a shopping basket of multiple discreteness. Our model and its estimation method are flexible enough to be extended to various contexts such as complementary demand, non-linear pricing, and multiple constraints. The sequential choice process generally finds an optimal solution of a convex problem (e.g., maximizing a concave utility function over a convex feasible set), while it might result in a sub-optimal solution for a non-convex problem. Therefore, in case of a convex optimization problem, the proposed model can be viewed as an econometrician’s means for establishing the optimality of observed demand, offering a practical estimation algorithm for discrete optimization models of consumer demand. We demonstrate the strengths of our model in a variety of simulation studies and an empirical application to consumer panel data of yogurt purchase.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信