Table of Contents
Fetching ...

Friend- and Enemy-oriented Hedonic Games With Strangers Full Version

TJ Schlueter, Makoto Yokoo

TL;DR

It is proved that necessarily internally stable partitions always exist and provide sufficient conditions for necessary contractual individual stability.

Abstract

We introduce friend- and enemy-oriented hedonic games with strangers (FOHGS and EOHGS respectively), two classes of hedonic games wherein agents are classified as friends, enemies, or strangers under the assumption that strangers will become either friends or enemies ex post facto. For several notions of stability in FOHGS and EOHGS, we characterize the hardness of verification for possible and necessary stability. We characterize the hardness of deciding whether possibly and necessarily X stable partitions exist for a given stability notion X. We prove that necessarily internally stable partitions always exist and provide sufficient conditions for necessary contractual individual stability.

Friend- and Enemy-oriented Hedonic Games With Strangers Full Version

TL;DR

It is proved that necessarily internally stable partitions always exist and provide sufficient conditions for necessary contractual individual stability.

Abstract

We introduce friend- and enemy-oriented hedonic games with strangers (FOHGS and EOHGS respectively), two classes of hedonic games wherein agents are classified as friends, enemies, or strangers under the assumption that strangers will become either friends or enemies ex post facto. For several notions of stability in FOHGS and EOHGS, we characterize the hardness of verification for possible and necessary stability. We characterize the hardness of deciding whether possibly and necessarily X stable partitions exist for a given stability notion X. We prove that necessarily internally stable partitions always exist and provide sufficient conditions for necessary contractual individual stability.
Paper Structure (9 sections, 24 theorems, 2 equations, 1 figure)

This paper contains 9 sections, 24 theorems, 2 equations, 1 figure.

Key Result

theorem thmcountertheorem

A coalition $C$ can be verified to possibly block a partition $\gamma$ for a FOHGS or EOHGS instance $G$ in P-time.

Figures (1)

  • Figure 1: No N-CS partition (a) FOHGS, (b) EOHGS

Theorems & Definitions (58)

  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • ...and 48 more