Minimal covering set solutions

被引：0
|
作者：
Michele Lombardi
机构：
[1] University of Warwick,Department of Economics
来源：
Social Choice and Welfare | 2009年 / 32卷
关键词：
Choice Function; Social Choice Function; Condorcet Winner; Social Choice Theory; Strict Partial Order;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study necessary and sufficient conditions for a multi-valued solution S to be rationalized in the following sense: there exists a complete asymmetric relation T (a tournament) such that, for each feasible (finite) set, the solution set of S coincides with the minimal covering set of T restricted to that feasible set. Our characterization result relies only on properties relating S across feasible choice sets.
引用
收藏
页码：687 / 695
页数：8
相关论文
共 50 条
  • [31] Simulation of random set covering problems with known optimal solutions and correlated coefficients
    Sapkota, Nabin
    Reilly, Charles H.
    WMSCI 2006: 10TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL VI, PROCEEDINGS, 2006, : 57 - 62
  • [32] Finding Solutions of the Set Covering Problem with an Artificial Fish Swarm Algorithm Optimization
    Crawford, Broderick
    Soto, Ricardo
    Olguin, Eduardo
    Misra, Sanjay
    Villablanca, Sebastian Mansilla
    Rubio, Alvaro Gomez
    Jaramillo, Adrian
    Salas, Juan
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2016, PT I, 2016, 9786 : 166 - 181
  • [33] Function of One Regular Separable Relation Set Decided for the Minimal Covering in Multiple Valued Logic
    Liu, Yu Zhen
    Liu, Min
    Liu, Xing Bao
    Zhang, Xin Fen
    2016 INTERNATIONAL CONFERENCE ON MECHATRONICS, MANUFACTURING AND MATERIALS ENGINEERING (MMME 2016), 2016, 63
  • [34] Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem
    Chinaie, M.
    Fakhar, F.
    Fakhar, M.
    Hajisharifi, H. R.
    JOURNAL OF GLOBAL OPTIMIZATION, 2019, 75 (01) : 131 - 141
  • [35] Covering groups of minimal exponent
    Sambonet, Nicola
    QUARTERLY JOURNAL OF MATHEMATICS, 2025, 76 (01): : 195 - 216
  • [36] ON THE MINIMAL COVERING OF INFINITE SETS
    KLIMO, J
    DISCRETE APPLIED MATHEMATICS, 1993, 45 (02) : 161 - 168
  • [37] A MINIMAL LEBESGUE COVERING EXISTS
    KOVALEV, MD
    MATHEMATICAL NOTES, 1986, 40 (3-4) : 736 - 739
  • [38] Are covering (enveloping) morphisms minimal?
    Enochs, EE
    Rozas, JRG
    Oyonarte, L
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2000, 128 (10) : 2863 - 2868
  • [39] Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem
    M. Chinaie
    F. Fakhar
    M. Fakhar
    H. R. Hajisharifi
    Journal of Global Optimization, 2019, 75 : 131 - 141
  • [40] Limit theorems for a random covering of a finite set and for the number of solutions of a system of random equations
    Mikhailov, VG
    THEORY OF PROBABILITY AND ITS APPLICATIONS, 1997, 41 (02) : 265 - 274
12345