Decomposition of Utility Functions on Subsets of Product Sets
✍ Scribed by François Sainfort and Jean M. Deichtmann
- Book ID
- 123687806
- Publisher
- INFORMS
- Year
- 1996
- Tongue
- English
- Weight
- 321 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0030-364X
- DOI
- 10.2307/172003
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
+ 1 and no more than for all i. Moreover, these bounds cannot "t be improved. Identical bounds for the spanning number ' f :i no:mal product of graphs are also obtained. . Let S be a collection of subsets of a set X such that their union is X. Define c(X;S), the covering number of X wi;h rLhspect
Let G be a finite group of order v. A k-element subset D of G is called a (v, k, I, p)-partial difference set in G if the expressions gh-', for g and h in D with g # h, represent each nonidentity element contained in D exactly i times and represent each nonidentity element not contained in D exactly