Abstract

Conditions have been given elsewhere which guarantee that binary decision procedures have a simple structure. Here we show that a continuity requirement together with some weak algebraic regularity conditions ensures that a binary procedure is locally simple. Additional topological assumptions are given which require that the binary procedure is a simple game.

Second revision. First revised in September 1979. Originally dated to May 1978.
The authors would like to thank Peter Hammond and an anonymous referee for their helpful comments. Support from National Science Foundation Grants SOC78-24787 and SOC79-07366 is gratefully acknowledged.
Published as Ferejohn, John A., et al. "Continuous-valued binary decision procedures." The Review of Economic Studies 47.4 (1980): 787-796.