The speed of convergence in repeated games with incomplete information on one side Jean-François Mertens Pages: 343 - 357
Note Computing the nucleolus of min-cost spanning tree games is NP-hard Ulrich FaigleWalter KernJeroen Kuipers Pages: 443 - 450