Computational Approaches to Bargaining and Choice

Hannu Nurmi

Journal of Theoretical Politics, 1989, vol. 1, issue 4, 407-426

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: computational complexity; NP-completeness; social choice function; cryptosystem; negotiation protocol; final-offer arbitration (search for similar items in EconPapers)
Date: 1989
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/0951692889001004002 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:jothpo:v:1:y:1989:i:4:p:407-426

DOI: 10.1177/0951692889001004002

Access Statistics for this article

More articles in Journal of Theoretical Politics
Bibliographic data for series maintained by SAGE Publications ().