Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Monotonic Stable Solutions for Minimum Coloring Games

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • المؤلفون: Hamers, H.J.M.; Miquel, S.; Norde, H.W.
  • المصدر:
    CentER Discussion Paper, (2011)
  • نوع التسجيلة:
    Electronic Resource
  • الدخول الالكتروني :
    https://research.tilburguniversity.edu/en/publications/efae8d09-83e6-4fe4-9623-e8a7c2ab6642
    https://pure.uvt.nl/ws/files/1311870/2011-016.pdf
    https://pure.uvt.nl/ws/files/1311870/2011-016.pdf
  • معلومة اضافية
    • Publisher Information:
      Organisation 2011
    • نبذة مختصرة :
      For the class of minimum coloring games (introduced by Deng et al. (1999)) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont (1990)). We show that a minimum coloring game on a graph G has a population monotonic allocation scheme if and only if G is (P4, 2K2)-free (or, equivalently, if its complement graph G is quasi-threshold). Moreover, we provide a procedure that for these graphs always selects an integer population monotonic allocation scheme.
    • الموضوع:
      Minimum coloring game; population monotonic allocation scheme; (P4; 2K2)-free graph; quasi-threshold graph; Discussion paper
    • Availability:
      Open access content. Open access content
      info:eu-repo/semantics/restrictedAccess
      (c) Universiteit van Tilburg
    • Note:
      CentER Discussion Paper, (2011)
      English
    • Other Numbers:
      GRG oai:tilburguniversity.edu:publications/efae8d09-83e6-4fe4-9623-e8a7c2ab6642
      https://research.tilburguniversity.edu/en/publications/efae8d09-83e6-4fe4-9623-e8a7c2ab6642
      1066336223
    • Contributing Source:
      TILBURG UNIV
      From OAIster®, provided by the OCLC Cooperative.
    • الرقم المعرف:
      edsoai.on1066336223
HoldingsOnline