Extended partial orders: A unifying structure for abstract choice theory

被引:6
|
作者
Nehring, K [1 ]
Puppe, C
机构
[1] Univ Calif Davis, Dept Econ, Davis, CA 95616 USA
[2] Univ Vienna, Dept Econ, A-1010 Vienna, Austria
关键词
partial orders; extended partial orders; choice functions; path-independence; opportunities;
D O I
10.1023/A:1018924200436
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The concept of a strict extended partial order (SEPO) has turned out to be very useful in explaining (resp. rationalizing) non-binary choice functions. The present paper provides a general account of the concept of extended binary relations, i.e, relations between subsets and elements of a given universal set of alternatives. In particular, we define the concept of a weak extended partial order (WEPO) and show how it can be used in order to represent rankings of opportunity sets that display a "preference for opportunities". We also clarify the relationship between SEPOs and WEPOs, which involves a non-trivial condition, called "strict properness". Several characterizations of strict (and weak) properness are provided, based on which we argue for properness as an appropriate condition demarcating "choice based" preference.
引用
收藏
页码:27 / 48
页数:22
相关论文
共 50 条
  • [31] Formal Language Theory for Practical Security - Extended Abstract -
    Jakoby, Andreas
    Leuther, Jannis
    Lucks, Stefan
    2021 IEEE SYMPOSIUM ON SECURITY AND PRIVACY WORKSHOPS (SPW 2021), 2021, : 101 - 110
  • [32] On the Observational Theory of the CPS-calculus (Extended Abstract)
    Merro, Massimo
    Biasi, Corrado
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 158 : 307 - 330
  • [33] An overview of the isoperimetric method in coding theory (extended abstract)
    Tillich, JP
    Zémor, G
    CRYPTOGRAPHY AND CODING, 1999, 1746 : 129 - 134
  • [34] A type theory for cartesian closed bicategories (Extended Abstract)
    Fiore, Marcelo
    Saville, Philip
    2019 34TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2019,
  • [35] Analysis of a guard condition in type theory (extended abstract)
    Amadio, RM
    Coupet-Grimal, S
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, 1998, 1378 : 48 - 62
  • [36] Type theory via exact categories extended abstract
    Birkedal, L
    Carboni, A
    Rosolini, G
    Scott, DS
    THIRTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1998, : 188 - 198
  • [37] On the competitive theory and practice of portfolio selection - (Extended abstract)
    Borodin, A
    El-Yaniv, R
    Gogan, V
    LATIN 2000: THEORETICAL INFORMATICS, 2000, 1776 : 173 - 196
  • [38] MODAL-THEORY, PARTIAL ORDERS, AND DIGITAL GEOMETRY
    SMITH, JDH
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 239 : 308 - 323
  • [39] ON THE SEMANTICS OF ATOMIZED STATEMENTS - THE PARALLEL-CHOICE OPTION - (EXTENDED ABSTRACT)
    KNIJNENBURG, P
    KOK, JN
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 297 - 306
  • [40] The First Door: Gender, Authority and Choice in The Stanley Parable Extended Abstract
    Scanlon, Mike
    Swanson, Tom
    Darvasi, Paul
    Jenson, Jen
    PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON THE FOUNDATIONS OF DIGITAL GAMES (FDG'17), 2017,