A characterization of two-agent Pareto representable orderings

被引:1
|
作者
Candeal, Juan C. [1 ,2 ]
机构
[1] Univ Zaragoza, Fac Econ & Empresa, Dept Anal Econ, Zaragoza, Spain
[2] Univ Zaragoza, Fac Econ & Empresa, Dept Anal Econ, Gran Via 2, Zaragoza 50005, Spain
关键词
Pareto preferences; Multi-utility representation; Poset dimension; UTILITY REPRESENTATION;
D O I
10.1016/j.jmp.2023.102806
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Partial orders defined on a nonempty set X admitting a two-agent Pareto representation are characterized. The characterization is based upon the fulfillment of two axioms. The first one entails the existence, for any point x & ISIN; X, of a very particular decomposition of the points which are incomparable to x. The second one encodes a separability condition. Our approach is then applied to show that if the cardinality of X is, at most, 5, then a two-agent Pareto representation always exists whereas this need not be the case otherwise. The connection with the concept of the dimension of a poset is also discussed. Certain examples are also presented that illustrate the scope of our tools.& COPY; 2023 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
引用
收藏
页数:6
相关论文
共 50 条
  • [41] Two-agent formation control of magnetic microrobots in two dimensions
    Salehizadeh M.
    Diller E.
    Journal of Micro-Bio Robotics, 2017, 12 (1-4) : 9 - 19
  • [42] Two-agent scheduling in a two-machine open shop
    Liu, Peihai
    Gu, Manzhan
    Lu, Xiwen
    ANNALS OF OPERATIONS RESEARCH, 2024, 333 (01) : 275 - 301
  • [43] CONTINUOUS PREFERENCE ORDERINGS REPRESENTABLE BY UTILITY FUNCTIONS
    Herves-Beloso, Carlos
    Cruces, Hugo del Valle-Inclan
    JOURNAL OF ECONOMIC SURVEYS, 2019, 33 (01) : 179 - 194
  • [44] A two-agent scheduling problem in a two-machine flowshop
    Ahmadi-Darani, Mohammad-Hasan
    Moslehi, Ghasem
    Reisi-Nafchi, Mohammad
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2018, 9 (03) : 289 - 306
  • [45] Two-agent scheduling in a two-machine open shop
    Peihai Liu
    Manzhan Gu
    Xiwen Lu
    Annals of Operations Research, 2024, 333 : 275 - 301
  • [46] Two-agent scheduling on a single machine with release dates
    Liu, Peihai
    Gu, Manzhan
    Li, Ganggang
    COMPUTERS & OPERATIONS RESEARCH, 2019, 111 : 35 - 42
  • [47] Erratum to "Competitive Two-Agent Scheduling and Its Applications"
    Koulamas, Christos
    Kyparisis, George
    Pinedo, Michael
    Wan, Guohua
    OPERATIONS RESEARCH, 2024, 72 (04) : 1749 - 1750
  • [48] Two-Agent Scheduling with Resource Augmentation on Multiple Machines
    Fagnon, Vincent
    Lucarelli, Giorgio
    Mommessin, Clement
    Trystram, Denis
    EURO-PAR 2022: PARALLEL PROCESSING, 2022, 13440 : 253 - 267
  • [49] A Minimax Framework for Two-Agent Scheduling With Inertial Constraints
    Yang, Feihong
    Shen, Yuan
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (12) : 24401 - 24413
  • [50] Spatial distribution of two-agent clusters for efficient navigation
    De Mot, J
    Feron, E
    42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, 2003, : 1029 - 1034