The profile structure for Luce’s choice axiom.pdfVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
The profile structure for Luce’s choice axiom

ARTICLE IN PRESS Journal of Mathematical Psychology 49 (2005) 226–253 /locate/jmp The profile structure for Luce’s choice axiom Donald G. Saari Department of Economics, University of California, 3151 Social Science Plaza, Irvine CA 92697-5100, USA Received 30 May 2003; received in revised form 17 July 2004 Abstract A geometric approach is introduced to explain phenomena that can arise with Luce’s choice axiom; e.g., differences occur when determining the likelihood of a ranking by starting with the ‘‘best-first,’’ or ‘‘worst-first’’ alternative. As shown, the problem is caused by the way we compute pairwise probabilities: it forces ‘‘best-first’’ and ‘‘worst-first’’ computations to use different information from a profile. Thus agreement holds only should the different information agree: this happens only with complete indifference. An alternative ‘‘best-first’’ and ‘‘worst-first’’ comparison, which always holds, is developed. Ways to increase the applicability of the choice axiom are introduced; e.g., profiles admitted by Luce’s formulation for ten alternatives have nine degrees of freedom; the approach described here allows millions of degrees of freedom. New ways to compute probabilities, which combine ‘‘best-first’’ and ‘‘worst-first’’ computations, are given: their properties are identified with a profile decomposition. A new way to compute pairwise probabilities, which eliminates all profile restrictions and problems associated with the choice axiom, is introduced; e.g., ‘‘best-first’’ and ‘‘worst-first’’ computations now agree.

文档评论(0)

xy88118 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档