Computational Approaches to Bargaining and Choice
- 1 October 1989
- journal article
- research article
- Published by SAGE Publications in Journal of Theoretical Politics
- Vol. 1 (4) , 407-426
- https://doi.org/10.1177/0951692889001004002
Abstract
The theory of computation and automata has occasionally aroused some interest among political scientists. The article outlines some early applications, although the main emphasis is on the most recent ones. We concentrate on the applications to bargaining and negotiation procedures. It is argued that many existing bargaining procedures can be essentially improved by resorting to cryptographic protocols.Keywords
This publication has 17 references indexed in Scilit:
- Condorcet's Theory of VotingAmerican Political Science Review, 1988
- Empirical Models of Arbitrator Behavior under Conventional ArbitrationThe Review of Economics and Statistics, 1986
- Finite automata play the repeated prisoner's dilemmaJournal of Economic Theory, 1986
- On effectively computable realizations of choice functions: Dedicated to Professors Kenneth J. Arrow and Anil NerodeMathematical Social Sciences, 1985
- Candidate Motivation: A Synthesis of Alternative TheoriesAmerican Political Science Review, 1983
- A comparative analysis of social choice functions, IVBehavioral Science, 1981
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Realization of Choice FunctionsEconometrica, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Axiomatic Social Choice Theory: An Overview and InterpretationAmerican Journal of Political Science, 1976