In hedonic games, a set of n agents, having preferences over all possible coalition structures, needs to agree on a stable outcome. In this work, we initiate the study of hedonic …
W Wang, Z He, P Shi, W Wu, Y Jiang… - IEEE Transactions …, 2018 - ieeexplore.ieee.org
With the increasing complexity of tasks that are crowdsourced, requesters need to form teams of professional workers that can satisfy complex task skill requirements. Team …
Matchmaking is a core problem for the e-sports and online games, which determines the player satisfaction and further influences the life cycle of the gaming products. Most of …
In coalition formation games self-organized coalitions are created as a result of the strategic interactions of independent agents. In this paper we assume that for each couple of agents …
Additively separable hedonic games and fractional hedonic games have received considerable attention in the literature. They are coalition formation games among selfish …
Match outcome prediction in group comparison setting is a challenging but important task. Existing works mainly focus on learning individual effects or mining limited interactions …
Approximate Competitive Equilibrium from Equal Incomes (A-CEEI) is an equilibrium-based solution concept for fair division of discrete items to agents with combinatorial demands. In …
M McKay, D Manlove - International Symposium on Algorithmic Game …, 2021 - Springer
Abstract The Stable Roommates problem involves matching a set of agents into pairs based on the agents' strict ordinal preference lists. The matching must be stable, meaning that no …
J Chen, S Roy - arXiv preprint arXiv:2108.03868, 2021 - arxiv.org
We investigate the Euclidean $ d $-Dimensional Stable Roommates problem, which asks whether a given set~ $ V $ of $ d\cdot n $ points from the 2-dimensional Euclidean space …