Diversity-seeking Swap Games in Networks

Yaqiao Li (Faculty of Comp. Sci. and Control Eng., Shenzhen University of Advanced Technology), Lata Narayanan (Dept of Computer Science and Software Engineering, Concordia University), Jaroslav Opatrny (Dept of Computer Science and Software Engineering, Concordia University), Yi Tian Xu (Independent Researcher)

Abstract

Schelling games use a game-theoretic approach to study the phenomenon of residential segregation. We consider four global measures of diversity, and prove asymptotically tight or almost tight bounds on the price of anarchy with respect to these measures on both general graphs and common specific graphs. In addition we did simulations of our swap games.