Computational Approaches to Bargaining and Choice
Year of publication: |
1989
|
---|---|
Authors: | Nurmi, Hannu |
Published in: |
Journal of Theoretical Politics. - Vol. 1.1989, 4, p. 407-426
|
Subject: | computational complexity | NP-completeness | social choice function | cryptosystem | negotiation protocol | final-offer arbitration |
-
Computational complexity in the design of voting systems
Takamiya, Koji, (2006)
-
The computational complexity of rationalizing boundedly rational choice behavior
Demuynck, Thomas, (2011)
-
Computing equilibria: a computational complexity perspective
Roughgarden, Tim, (2010)
- More ...
-
Holler, Manfred J., (2011)
-
The F-Twist and the Evaluation of Political Institutions
Nurmi, Hannu, (1983)
-
Assessing Borda's Rule and Its Modifications
Nurmi, Hannu, (2007)
- More ...