### Citations

1210 |
The bargaining problem
- Nash
- 1950
(Show Context)
Citation Context ...s for 4 We recall the main regulation that none club members, inclusive the moderator, receive their awards if certain club member participates in less than k activities. 11/27stheir components,” se=-=e Nash 1950-=-, p. 157, Sen Axiom 8*1, p. 127 or sets of axioms, see also Luce and Raifa 1958, p.25, G. Owen 1968, section VII.2 , or von Neumann and Morgenstern 1947, utility index interpretation. Rigorously speak... |

819 | Lattice Theory - Birkhoff - 1967 |

784 | Games with Incomplete Information Played by ‘Bayesian’Players - Harsanyi - 1967 |

750 | An analysis of approximations for maximizing submodular set functions—I - Nemhauser, Wolsey, et al. - 1978 |

396 | Manipulation of Voting Schemes: A General Result". - Gibbard - 1973 |

154 | Matroids and the greedy algorithm. - Edmonds - 1971 |

50 | Generalized median voter schemes and committees,Journal of Economic Theory 61 - Barberà, Gul, et al. - 1993 |

14 | Layered clusters of tightness set functions - Mirkin, Muchnik |

12 | Fixed points approach to clustering - Genkin - 1993 |

9 | Extremal subsystems of monotone systems: I, II, - Mullat - 1976 |

6 | A fast algorithm for finding matching responses in survey data table,
- Mullat
- 1995
(Show Context)
Citation Context ... an algorithm for that purpose. We will first comment the algorithm in lines with the definitions. K The algorithm’s very last pass, see below, through the step T detects the largest kernel ∗ = S =-=8 , Mullat 1995-=-. The original version (Mullat, 1971) of the algorithm to detect the largest kernel looks like a greedy inverse serialization procedure, see Edmonts, 1971. Original version of the algorithm produces a... |

5 | Contramonotonic Systems in the Analysis of the Structure of Multivariate Distributions - MULLAT - 1981 |

5 | An improvement of Train Gathering Plans Design Methods,” Zheleznodorozhnyi Transport 3 - Petrov, Cherenin - 1948 |

5 | Quasilinear monotone systems, Automation and Remote Control 50 - Libkin, Muchnik, et al. - 1990 |

4 |
On certain maximum principle for certain set-valued functions
- Mullat
- 1971
(Show Context)
Citation Context ...will first comment the algorithm in lines with the definitions. K The algorithm’s very last pass, see below, through the step T detects the largest kernel ∗ = S 8 , Mullat 1995. The original versi=-=on (Mullat, 1971-=-) of the algorithm to detect the largest kernel looks like a greedy inverse serialization procedure, see Edmonts, 1971. Original version of the algorithm produces a complete defining sequence, what is... |

2 | Monotone Linkage Clustering and Quasi-Convex Set Functions - Kempner, Mirkin, et al. |

2 | Submodular set functions and Monotonic Systems in aggregation, I,II”Translated from Avtomatika - Muchnik, Shvartser - 1987 |

1 | Axiomatic approaches to coalitional bargaining - Hart - 1985 |

1 | Towards a focal-point of bargaining - Roth - 1985 |