Abstract For the problem to find an m -clique in -partite graph, staircase compatibility has recently been introduced as a polynomial-time solvable special case. It is property of graph together with -partition vertex set and total orders on each subset partition. In optimization problems involving -cliques graphs subproblem, it allows for totally unimodular linear programming formulations, whi...

This paper analyzes an agency model of crisis bargaining where two states have private information about war payoffs. In the model, leaders bargain on behalf their own states. Importantly, owing to political bias and audience costs, a leader’s payoff peace differ from those her state at large. I establish general results leaders’ strategies possibility peaceful resolution. By examining incentiv...