A Polynomial-Time Algorithm for Computing the Yolk in Fixed Dimension
Abstract
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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1991
- Accession Number
- ADA240060
Entities
People
- Craig A. Tovey
Organizations
- Naval Postgraduate School