A polynomial-time algorithm for computing the yolk in fixed dimension

A polynomial-time algorithm for computing the yolk in fixed dimension

0.00 Avg rating0 Votes
Article ID: iaor19931431
Country: Netherlands
Volume: 57
Issue: 2
Start Page Number: 259
End Page Number: 277
Publication Date: Nov 1992
Journal: Mathematical Programming
Authors:
Keywords: NP-hard
Abstract:

The yolk, developed by Ferejohn, McKelvey and Packel and McKelvey, 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.

Reviews

Required fields are marked *. Your email address will not be published.