Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper we present relational models of simple games and develop relational algorithms for solving some game-theoretic basic problems. The algorithms immediately can be...

Most allocation rules for network games presented in the literature assume that the network structure is fixed. We put explicit emphasis on the construction of networks and examine the dynamic formation of networks whose evolution across time periods is stochastic. Time-series of networks are...

We consider a model of influence with a set of non-strategic agents and two strategic agents. The non-strategic agents have initial opinions and are linked through a simply connected network. They update their opinions as in the DeGroot model. The two strategic agents have fixed opinions, 1 and...