: Consider a game where a referee chooses (x,y) according to a publicly known distribution, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds wi...
We introduce optimistic weighted Shapley rules in minimum cost spanning tree problems. We dene them as the weighted Shapley values of the optimistic game v+ introduced in Berganti
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Networked value constellations are collections of enterprises that jointly satify complex consumer needs. Increasingly, such needs are satisfied by e-services, i.e. commercial ser...
Jaap Gordijn, Hans Weigand, Manfred Reichert, Roel...
Background: In gene expression analysis, statistical tests for differential gene expression provide lists of candidate genes having, individually, a sufficiently low p-value. Howe...
Stefano Moretti, Danitsja van Leeuwen, Hans Gmuend...