Institute for Logic, Language and Computation

5 October 2012, Computational Social Choice Seminar, Krzysztof Apt

Speaker: Krzysztof Apt
Title: A Classification of Weakly Acyclic Games
Date: Friday 5 October 2012
Time: 16:00
Location: Room B0.203, Science Park 904, Amsterdam


Given a strategic game, when we allow the players to improve their choices on a unilateral basis, we are naturally brought to the concept of an improvement path, in which at each stage a single player who did not select a best response is allowed to select a better strategy. By definition each finite improvement path ends in a Nash equilibrium. This leads to the concept of a weakly acyclic game in which one stipulates that from any initial joint strategy some finite improvement path exists. In this talk we provide a natural classification of weakly acyclic games using the concept of a scheduler. This is a joint work with Sunil Simon.

For more information, see or contact Ulle Endriss ().

The websites of the UvA make use of cookiesThis site uses cookies More informationMore info Hide this message XHide X