I will describe a game: There are 2 players and 4 items. The players like the items in following order: [a,b,c,d] and [b,d,a,c]. The orderings are strict and additive. That is, player 2 likes b over d over a over, and b+d over a+c or b+a over d+c, etc. (We can't say about b+d versus d+a or b vs d+a+c.) Player 1 picks an item of his choice, then player 2 picks one of the remaining object, player 1 now comes back to pick the third object and 2 then automatically gets the last object. I want to solve for the subgame perfect nash equilibria using backward induction. However, I am unable to find an article that deals with games of this sort. If I can get some idea, maybe that will help me get a start. Continue reading...
