Roles and Teams Hedonic Game

Roles and Teams Hedonic Game. Spradling, M., Goldsmith, J., Liu, X., Dadi, C., & Li, Z. In Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT), Also presented at the IJCAI the 7th Multidisciplinary Workshop on Advances in Preference Handling (MPREF), volume 8176, pages 351-362, 2013. Springer (Acceptance rate: <font color="red">44%</font>).

Paper abstract bibtex 2 downloads

We introduce a new variant of hedonic coalition formation games in which agents have two levels of preference on their own coalitions: preference on the set of ``roles" that makes up the coalition, and preference on their own role within the coalition. We define several stability notions and optimization problems for this model. We prove the hardness of the decision problems related to our optimization criteria and show easiness of finding individually stable partitions. We introduce a heuristic optimizer for coalition formation in this setting. We evaluate results of the heuristic optimizer and the results of local search for individually stable partitions with respect to brute-force MaxSum and MaxMin solvers.

@inproceedings{conf/adt13/Spradling,
  author = {Matthew Spradling and Judy Goldsmith and Xudong Liu and Chandrima Dadi and Zhiyu Li},
  booktitle = {Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT),
		Also presented at the IJCAI the 7th Multidisciplinary Workshop on Advances in Preference Handling (MPREF)},
  isbn = {978-3-642-41574-6},
  pages = {351-362},
  publisher = {Springer (Acceptance rate: <font color="red">44%</font>)},
  %publisher = {Springer},
  title = {Roles and Teams Hedonic Game},
  volume = 8176,
  url_Paper = {http://xudongliu.domains.unf.edu/resources/rthgp_adt13.pdf},
  abstract = {We introduce a new variant of hedonic coalition formation
	games in which agents have two levels of preference on their own coalitions:
	preference on the set of ``roles" that makes up the coalition, and
	preference on their own role within the coalition. We define several stability
	notions and optimization problems for this model. We prove the
	hardness of the decision problems related to our optimization criteria
	and show easiness of finding individually stable partitions. We introduce
	a heuristic optimizer for coalition formation in this setting. We evaluate
	results of the heuristic optimizer and the results of local search for
	individually stable partitions with respect to brute-force MaxSum and
	MaxMin solvers.},
  year = 2013
}

%@inproceedings{wsh/mpref13/LiuT,
%  author = {Xudong Liu and Miroslaw Truszczynski},
%  booktitle = {the IJCAI Multidisciplinary Workshop on Advances in Preference Handling (MPREF)},
%  title = {Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers},
%  url_Paper = {http://xudongliu.domains.unf.edu/resources/aggLPASP_mpref13.pdf},
%  year = 2013
%}
%
%@inproceedings{wsh/mpref13/Spradling,
%  author = {Matthew Spradling and Judy Goldsmith and Xudong Liu and Chandrima Dadi and Zhiyu Li},
%  booktitle = {the IJCAI Multidisciplinary Workshop on Advances in Preference Handling (MPREF)},
%  title = {Roles and Teams Hedonic Game},
%  url_Paper = {http://xudongliu.domains.unf.edu/resources/rthgp_mpref13.pdf},
%  year = 2013
%}

Downloads: 2