DCG
1999
13 years 4 months ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
DCG
1999
13 years 4 months ago
1999
Westudycomplexhyperplanearrangementswhoseintersectionlattices,known as the Dowling lattices, are a natural generalization of the partition lattice. We give a combinatorial descript...
DCG
1999
13 years 4 months ago
1999
DCG
1999
13 years 4 months ago
1999
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
DCG
1999
13 years 4 months ago
1999
A spherical -design on Sn-1 is a finite set such that, for all polynomials f of degree at most , the average of f over the set is equal to the average of f over the sphere Sn-1 . ...
DCG
1999
13 years 4 months ago
1999
DCG
1999
13 years 4 months ago
1999
We show how to color the tiles in a heirarchical tiling system so that the resulting system is not only repetitive (i.e., has the local isomorphism property) but has prescribed col...
DCG
1999
13 years 4 months ago
1999
Monotone path polytopes arise as a special case of the construction of fiber polytopes, introduced by Billera and Sturmfels. A simple example is provided by the permutahedron, whic...