Published February 1980
| Version Submitted
Working Paper
Open
Continuous-Valued Binary Decision Procedures
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.
Additional Information
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.Attached Files
Submitted - sswp214_-_revised_2.pdf
Files
sswp214_-_revised_2.pdf
Files
(294.5 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:72f8754bae9ea8a269fafd26a6666584
|
294.5 kB | Preview Download |
Additional details
Identifiers
- Eprint ID
- 82553
- Resolver ID
- CaltechAUTHORS:20171020-153538132
Related works
- Describes
- http://resolver.caltech.edu/CaltechAUTHORS:20171120-171500303 (URL)
Funding
- NSF
- SOC78-24787
- NSF
- SOC79-07366
Dates
- Created
-
2017-10-20Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
Caltech Custom Metadata
- Caltech groups
- Social Science Working Papers
- Series Name
- Social Science Working Paper
- Series Volume or Issue Number
- 214