Two new combinatorial problems involving dominating sets for lottery schemes
Date
2004-12
Authors
Grundlingh, Werner R.
Journal Title
Journal ISSN
Volume Title
Publisher
Stellenbosch : University of Stellenbosch
Abstract
Suppose a lottery scheme consists of randomly selecting an unordered winning n-subset from a universal
set of m numbers, while a player participates in the scheme by purchasing a playing set of any number of unordered n-subsets from the same universal set prior to a winning draw, and is awarded a prize if ...
Description
Thesis (PhD (Mathematical Sciences. Applied Mathematics))--University of Stellenbosch, 2004.
Keywords
Combinatorial optimization, Games of chance (Mathematics), Lotteries -- Mathematics, Domination (Graph theory), Dissertations -- Applied mathematics, Theses -- Applied mathematics