Negotiation games

Tool implemented by François Schwarzentruber using the algorithm of Valentin Goranko in his LOFT 2016 paper.

Input

/** We give an example of a full negociation. Players are R and C.**/

g = [ [   [2, 10],  [10, 4],    [5, 1] ],
      [   [6, 0], [4, 4],   [6, 3]   ]];
      
showFullNegotiation(g, R, maxminvalue);
      
      
      
      
/**
Now, the rest is commented and gives some possible examples of use of functions.

g = [ [   [1, 8], [10, 4] ],
      [  [4, 10], [1, 11] ],
      [  [4, 0],    [2,2]]];
      
o = bestoffer(g, C, R);
g = transformedGame(g, o);
showOffer(o);
showGame(g);

o = bestoffer(g, R, C);
g = transformedGame(g, o);
showOffer(o);
showGame(g);

o = bestoffer(g, C, R);
g = transformedGame(g, o);
showOffer(o);
showGame(g);

o = bestoffer(g, R, C);
g = transformedGame(g, o);
showOffer(o);
showGame(g);

initialGame = [  [    [4, 5],   [0, 6]   ],
                     [    [6, 0],   [1, 1]   ]];
showGame(initialGame);                
showNashEquilibrium(initialGame);

game2 = transformedGame(initialGame, {offerer: R, receiver: C, payment: 2, receiveraction: 0});

showGame(game2);

showNashEquilibrium(game2);

game3 = transformedGame(initialGame, {offerer: C, receiver: R, payment: 2, receiveraction: 0});

showGame(game3);
showNashEquilibrium(game3);**/

Negotiation games

Input Run

Output

Input