On conditions for a meeting not to reach a deadlock
From MaRDI portal
Publication:1126661
DOI10.1016/S0096-3003(96)00333-5zbMath0907.90014MaRDI QIDQ1126661
Takehiro Inohara, Shingo Takahashi, Bunpei Nakano
Publication date: 2 March 1999
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Related Items (10)
Relational dominant strategy equilibrium as a generalization of dominant strategy equilibrium in terms of a social psychological aspect of decision making ⋮ A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph ⋮ Approximation algorithms on \(k\)-correlation clustering ⋮ Relational Nash equilibrium and interrelationships among relational and rational equilibrium concepts ⋮ Meetings in deadlock and decision makers with interperception. ⋮ On conditions for a meeting not to reach a recurrent argument ⋮ Generalizations of the concept of core of simple games and their characterization in terms of permission of voters. ⋮ Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments ⋮ Clusterability of groups and information exchange in group decision making with approval voting system. ⋮ The maximum balanced subgraph of a signed graph: applications and solution approaches
Cites Work
This page was built for publication: On conditions for a meeting not to reach a deadlock
