A polynomial-time algorithm for computing the yolk in fixed dimension
From MaRDI portal
Publication:687092
DOI10.1007/BF01581084zbMATH Open0796.90010MaRDI QIDQ687092FDOQ687092
Authors: Craig A. Tovey 
Publication date: 20 December 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1538128
- scientific article; zbMATH DE number 3945871
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
- Polynomial-time algorithm for fixed points of nontrivial morphisms
- An algorithm of polynomial order for computing the covering dimension of a finite space
- A Polynomial Time Complexity Bound for Computations on Curves
- scientific article; zbMATH DE number 819105
- scientific article; zbMATH DE number 69493
- The Polya algorithm on cylindrical sets
- A non-NP-complete algorithm for a quasi-fixed polynomial problem
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Voting theory (91B12)
Cites Work
- Title not available (Why is that?)
- Recognizing majority-rule equilibrium in spatial voting games
- Title not available (Why is that?)
- The uncovered set in spatial voting games
- Instability of Simple Dynamic Games
- General Conditions for Global Intransitivities in Formal Voting Models
- Advances in the spatial theory of voting.
- Optimal location of candidates in ideological space
- The densest hemisphere problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Limiting distributions for continuous state Markov voting models
- On the number of line separations of a finite set in the plane
- A Note about the "Nowhere Denseness" of Societies Having an Equilibrium under Majority Rule
- Limits on agenda control in spatial voting games
- Polygonal intersection searching
- Limiting median lines do not suffice to determine the yolk
- Probability and convergence for supra-majority rule with Euclidean preferences
- The almost surely shrinking yolk
- The size of the yolk: Computations for odd and even-numbered committees
- A theorem connecting Shapley-Owen power scores and the radius of the yolk in two dimensions
Cited In (9)
- On the uniqueness of the yolk
- The size of the yolk: Computations for odd and even-numbered committees
- Generalized medians and a political center
- Optimal algorithms for geometric centers and depth
- A finite exact algorithm for epsilon-core membership in two dimensions
- Approximation of the yolk by the LP yolk
- The instability of instability of centered distributions
- A bird's eye-view of min-max and max-min functionals
- The generalized yolk point
This page was built for publication: A polynomial-time algorithm for computing the yolk in fixed dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687092)
