Extensions to Tiered Coalition Formation Games

Nathan Arnold; Judy Goldsmith; Sarah Snider

doi:10.32473/flairs.v35i.130708

Extensions to Tiered Coalition Formation Games

Nathan Arnold, Judy Goldsmith, Sarah Snider

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

In 2017, Siler introduced Tiered Coalition Formation Games (TCFGs), inspired by the tiered organization of Pokémon characters on a fan-based website, Smogon. Siler showed that, for a natural notion of agent preferences, the Nash table tier lists were precisely the core stable tier lists, and provided a polynomial-time algorithm to find a Nash stable tier list. However, the tiers in that list had size one, which eliminated the intra-tier competitions that make tier lists meaningful. We extend Siler’s definition to allow for win probabilities, examine k-tier TCFGs, and provide a heuristic algorithm for finding good k-tier partitions that allow intra-tier competition.

Original language	English
Journal	Proceedings of the International Florida Artificial Intelligence Research Society Conference, FLAIRS
Volume	35
DOIs	https://doi.org/10.32473/flairs.v35i.130708
State	Published - 2022
Event	35th International Florida Artificial Intelligence Research Society Conference, FLAIRS-35 2022 - Jensen Beach, United States Duration: May 15 2022 → May 18 2022

Bibliographical note

Publisher Copyright:
© 2022 by the authors. All rights reserved.

Keywords

coalition formation games
cooperative game theory
pokemon

ASJC Scopus subject areas

Artificial Intelligence
Software

Access to Document

10.32473/flairs.v35i.130708

Cite this

@article{f2970db1ed8044ecaacfc2304a8a79d6,

title = "Extensions to Tiered Coalition Formation Games",

abstract = "In 2017, Siler introduced Tiered Coalition Formation Games (TCFGs), inspired by the tiered organization of Pok{\'e}mon characters on a fan-based website, Smogon. Siler showed that, for a natural notion of agent preferences, the Nash table tier lists were precisely the core stable tier lists, and provided a polynomial-time algorithm to find a Nash stable tier list. However, the tiers in that list had size one, which eliminated the intra-tier competitions that make tier lists meaningful. We extend Siler{\textquoteright}s definition to allow for win probabilities, examine k-tier TCFGs, and provide a heuristic algorithm for finding good k-tier partitions that allow intra-tier competition.",

keywords = "coalition formation games, cooperative game theory, pokemon",

author = "Nathan Arnold and Judy Goldsmith and Sarah Snider",

note = "Publisher Copyright: {\textcopyright} 2022 by the authors. All rights reserved.; 35th International Florida Artificial Intelligence Research Society Conference, FLAIRS-35 2022 ; Conference date: 15-05-2022 Through 18-05-2022",

year = "2022",

doi = "10.32473/flairs.v35i.130708",

language = "English",

volume = "35",

}

TY - JOUR

T1 - Extensions to Tiered Coalition Formation Games

AU - Arnold, Nathan

AU - Goldsmith, Judy

AU - Snider, Sarah

PY - 2022

Y1 - 2022

N2 - In 2017, Siler introduced Tiered Coalition Formation Games (TCFGs), inspired by the tiered organization of Pokémon characters on a fan-based website, Smogon. Siler showed that, for a natural notion of agent preferences, the Nash table tier lists were precisely the core stable tier lists, and provided a polynomial-time algorithm to find a Nash stable tier list. However, the tiers in that list had size one, which eliminated the intra-tier competitions that make tier lists meaningful. We extend Siler’s definition to allow for win probabilities, examine k-tier TCFGs, and provide a heuristic algorithm for finding good k-tier partitions that allow intra-tier competition.

AB - In 2017, Siler introduced Tiered Coalition Formation Games (TCFGs), inspired by the tiered organization of Pokémon characters on a fan-based website, Smogon. Siler showed that, for a natural notion of agent preferences, the Nash table tier lists were precisely the core stable tier lists, and provided a polynomial-time algorithm to find a Nash stable tier list. However, the tiers in that list had size one, which eliminated the intra-tier competitions that make tier lists meaningful. We extend Siler’s definition to allow for win probabilities, examine k-tier TCFGs, and provide a heuristic algorithm for finding good k-tier partitions that allow intra-tier competition.

KW - coalition formation games

KW - cooperative game theory

KW - pokemon

UR - http://www.scopus.com/inward/record.url?scp=85131120847&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85131120847&partnerID=8YFLogxK

U2 - 10.32473/flairs.v35i.130708

DO - 10.32473/flairs.v35i.130708

M3 - Conference article

AN - SCOPUS:85131120847

SN - 2334-0754

VL - 35

JO - Proceedings of the International Florida Artificial Intelligence Research Society Conference, FLAIRS

JF - Proceedings of the International Florida Artificial Intelligence Research Society Conference, FLAIRS

T2 - 35th International Florida Artificial Intelligence Research Society Conference, FLAIRS-35 2022

Y2 - 15 May 2022 through 18 May 2022

ER -

Extensions to Tiered Coalition Formation Games

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this