Clusterability of groups and information exchange in group decision making with approval voting system.

DOI10.1016/S0096-3003(02)00008-5zbMath1042.91086MaRDI QIDQ1856012

Takehiro Inohara

Publication date: 28 January 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

ClusterabilitySigned graphsGroup decision makingApproval voting systemInformation exchange

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Decision theory (91B06) Voting theory (91B12)

Related Items (6)

An Agent-Based Approach to Stability of Complete, Directed, and Signed Social Networks with Loops ⋮ Quasi-clusterability of signed graphs with negative self evaluation ⋮ 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 ⋮ Relational Nash equilibrium and interrelationships among relational and rational equilibrium concepts ⋮ Signed graphs with negative self evaluation and clusterability of graphs

Cites Work

• On conditions for a meeting not to reach a deadlock
• Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
• n-person ‘soft’ games

This page was built for publication: Clusterability of groups and information exchange in group decision making with approval voting system.