All Rights Reserved
AccessEcon LLC 2006, 2008.
Powered by MinhViet JSC
ralph lauren polo

Joseph Mullat
''Calculus of Bargaining Solution on Boolean Tables''
( 2001, Vol. 28 No.15 )
This article reports an “acceptable calculus” of the bargaining problem solution as used by game theoreticians. By an acceptable calculus we understand an algorithm which can lead us to the result in an acceptable time either using the computing power of nowadays computers or a known classical model, like LaGrange method of function maximization with constraints. Our motive is quite difficult to meet, but we hope to move in this direction in order to close the gap at least for one nontrivial situation on Boolean tables.
Manuscript Received : Jul 12 2001 Manuscript Accepted : Jul 17 2001

  This abstract has been downloaded 606 times                The Full PDF of this paper has been downloaded 99688 times