Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

SAGETRACK

Sign In to gain access to subscriptions and/or personal tools.
Journal of Theoretical Politics
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Nurmi, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

Computational Approaches to Bargaining and Choice

Hannu Nurmi

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.

Key Words: computational complexity • NP-completeness • social choice function • cryptosystem • negotiation protocol • final-offer arbitration

Journal of Theoretical Politics, Vol. 1, No. 4, 407-426 (1989)
DOI: 10.1177/0951692889001004002
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?