{"id":18,"date":"2017-10-06T07:52:19","date_gmt":"2017-10-06T07:52:19","guid":{"rendered":"http:\/\/dke.maastrichtuniversity.nl\/f.thuijsman\/site\/?page_id=18"},"modified":"2017-10-10T12:47:37","modified_gmt":"2017-10-10T12:47:37","slug":"usefull-programs","status":"publish","type":"page","link":"https:\/\/dke.maastrichtuniversity.nl\/f.thuijsman\/site\/?page_id=18","title":{"rendered":"Usefull Programs"},"content":{"rendered":"

This page contains a few programs about Game Theory, written by students of Frank Thuijsman.<\/span>
\n These programs are able to solve various types of games.<\/span><\/p>\n

    \n
  1. This\u00a0program<\/a>, written by\u00a0Max Buegler\u00a0(2009), can be used to calculate value and optimal strategies from matrix games as well as equilibria in bimatrix games by means of the Lemke-Howson algorithm. Fictitious play and regret matching are implemented as well. The program can also be used to calculate the Shapley value for cooperative games and, using input form\u00a0Robbert Harms, it is also possible to examine several types of solutions for bankruptcy problems.<\/span><\/li>\n
  2. This\u00a0program<\/a>, written by\u00a0Robbert Harms\u00a0(2009), can be used to calculate “contested-garment-consistent” solutions to solve bankruptcy problems by means of the method of communicating vessels. A short explanation of this issue can be found in my booklets: “Spelen en Delen” (look\u00a0here<\/a>) and in the lecture notes “Introduction to Game Theory” (not yet published).<\/span>
    \n Relevant original publications on this topic are the following ones:<\/span><\/p>\n