Speaker: |
Phani Raj Lolakapuri |

Organiser: |
Umang Bhaskar |

Date: |
Wednesday, 14 Sep 2016, 14:00 to 15:30 |

Venue: |
AG-80 |

(Scan to add to calendar)

We give an algorithm for computing an equilibrium in the case of parallel-edge graphs with quadratic cost functions and two players. Our algorithm is obtained by using support enumeration, along with convex programming and results about the structure of equilibrium with quadratic cost functions. We also present some obstacles to generalizing our algorithm to more general cases.

Finally, we present some hardness results regarding equilibrium computation in more general games, when different players may experience different delays on an edge.