A polynomial-time algorithm for computing the yolk in fixed dimension
By: Craig A. Tovey
Contributors: Naval Postgraduate School (U.S.). Dept. of Operations Research
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1991
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 23
Subjects: Mathematical models; Algorithms; Polynomials
Other titles: NPS-OR-91-024.
Description: The yolk developed in (16,22), is a key solution concept in the Euclidean spatial model as the region of policies where a dynamic voting game will tend to reside. However, determining the yolk is NP-hard for arbitrary dimension. This paper derives an algorithm to compute the yolk in polynomial time for any fixed dimension.
Notes: Title from cover.

"NPS-OR-91-024."

"August 1991."

AD A240 060.

Includes bibliographical references (p. 20-23).

aq/  /aq cc:9116 01/15/98