Note: Computing the nucleolus of min-cost spanning tree games is NP-hard.
- Published in:
- International Journal of Game Theory, 1998, v. 27, n. 3, p. 443, doi. 10.1007/s001820050083
- By:
- Publication type:
- Article
Works matching IS 00207276 AND DT 1998 AND VI 27 AND IP 3
Results: 10
1
2
Note: On the core of a collection of coalitions.
- Published in:
- International Journal of Game Theory, 1998, v. 27, n. 3, p. 451, doi. 10.1007/s001820050084
- By:
- Publication type:
- Article
3
On the impact of an event.
- Published in:
- International Journal of Game Theory, 1998, v. 27, n. 3, p. 315, doi. 10.1007/s001820050075
- By:
- Publication type:
- Article
4
Mixing weighted values of non-atomic games.
- Published in:
- International Journal of Game Theory, 1998, v. 27, n. 3, p. 331, doi. 10.1007/s001820050076
- By:
- Publication type:
- Article
5
The speed of convergence in repeated games with incomplete information on one side.
- Published in:
- International Journal of Game Theory, 1998, v. 27, n. 3, p. 343, doi. 10.1007/s001820050077
- By:
- Publication type:
- Article
6
Characterization sets for the nucleolus.
- Published in:
- International Journal of Game Theory, 1998, v. 27, n. 3, p. 359, doi. 10.1007/s001820050078
- By:
- Publication type:
- Article
7
Population uncertainty and Poisson games.
- Published in:
- International Journal of Game Theory, 1998, v. 27, n. 3, p. 375, doi. 10.1007/s001820050079
- By:
- Publication type:
- Article
8
Paths leading to the Nash set for nonsmooth games.
- Published in:
- International Journal of Game Theory, 1998, v. 27, n. 3, p. 393
- By:
- Publication type:
- Article
9
Home-grown values and incentive compatible auction design.
- Published in:
- International Journal of Game Theory, 1998, v. 27, n. 3, p. 427
- By:
- Publication type:
- Article
10
Dominance or maximin: How to solve an English auction.
- Published in:
- International Journal of Game Theory, 1998, v. 27, n. 3, p. 407, doi. 10.1007/s001820050081
- By:
- Publication type:
- Article