2024/09/25 by TJ Schlueter, Schlueter, TJ, Makoto Yokoo +1
Computer Science · Decision Sciences · #Artificial Intelligence in Games #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Applications #Peer-to-Peer Network Technologies
paper · pdf · doi:10.48550/arxiv.2409.16579
openalex publication_date 2024/09/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.