Online decision problems with large strategy sets
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005. === Includes bibliographical references (p. 165-171). === In an online decision problem, an algorithm performs a sequence of trials, each of which involves selecting one element from a fixed set of alternatives (the...
Main Author: | Kleinberg, Robert David |
---|---|
Other Authors: | F. Thomson Leighton. |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2006
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/33092 |
Similar Items
-
Decision problems concerning sets of equations
by: Kalfa, Kornilia
Published: (1980) -
The INDEPENDENT SET Decision Problem is NP-complete
by: Bristow, Andrew, IV
Published: (2011) -
Extermal problems in dimension theory for partially ordered sets
by: Kimble, Robert J., 1948-
Published: (2013) -
Large sets of disjoint t-(v,k,[lambda]) designs /
by: Yeh, Jieh-Shan George
Published: (1999) -
Contributions on secretary problems, independent sets of rectangles and related problems
by: Soto, José Antonio, Ph. D. Massachusetts Institute of Technology
Published: (2011)