I examine sequential round-robin tournaments with three and four symmetric players. Each player is matched once with each other player. If the matches are organized as Tullock contests (all-pay auctions), the tournament will be almost fair (highly discriminatory): subject to the position of...

I propose a simple model of signed network formation, where agents make friends to extract payoffs from weaker enemies. The model thereby accounts for the interplay between friendship and alliance on one hand and enmity and antagonism on the other. Nash equilibrium configurations are such that...

I examine sequential round-robin tournaments with three and four symmetric players. Each player is matched once with each other player. If the matches are organized as Tullock contests (all-pay auctions), the tournament will be almost fair (highly discriminatory): subject to the position of...

I examine sequential round-robin tournaments with three and four symmetric players. Each player is matched once with each other player. If the matches are organized as Tullock contests (all-pay auctions), the tournament will be almost fair (highly discriminatory): subject to the position of...

A four period game between two firms and two hackers is analyzed. The firms first defend and the hackers thereafter attack and share information. Each hacker seeks financial gain, beneficial information exchange, and reputation gain. The two hackers’ attacks and the firms’ defenses are...

We study from both a theoretical and an empirical perspective how a network of military alliances and enmities affects the intensity of a conflict. The model combines elements from network theory and from the politico-economic theory of conflict. We obtain a closed-form characterization of the...