Calculus of Bargaining Solution on Boolean Tables

This article reports not only theoretical solution of bargaining problem as used by game theoreticians but also an adequate calculus. By adequate calculus we understand an algorithm that can lead us to the result within reasonable timetable using either the computing power of nowadays computers or widely accepted classical Hamiltonian 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.game, bargaining, algorithm

Induced Layered Clusters, Hereditary Mappings and Convex Geometries

A method for structural clustering proposed by the authors is extended to the case when there are externally defined restrictions on the relations between sets and their elements. This framework appears to be related to order-theoretic concepts of the hereditary mappings and convex geometries, which enables us to givecharacterizations of those in terms of the monotone linkage functions. Key words: layered cluster, monotone linkage, greedy optimization, convex geometry, hereditary mapping.