A computing theory for collaborative and transparent decision making under time constraint

In this paper, we present a computing theory on the accelerated critical point of selection of proper strategies between collaboration and competition and its mathematical analysis for collaborative and transparent decision making under “time constraint”, i.e., cost of time pressure, which decision makers face in negotiation. Web 2.0 provides a useful digital environment to support various time-stressed human behaviors for collaborative decision making. However, little research has examined the collaborative behavior under time constraint on the Internet in its designs and implementations on electronically supported decision making. Those systems are implemented in black boxes so that we need transparent designs of decision support systems to promote collaboration by time-stressed decision makers. The essential problem on collaborative decision making under time constraint is the discovery and evaluation on the critical point of selection of proper strategies between collaboration and competition. Most of the current decision support systems accept the half of maximum acceptable time for negotiation as a critical point, a priori, though that conventional point is often late for proper decision making. The proposed theory shows that a critical point is to be accelerated at the one-third of maximum acceptable time for negotiation. We have formulated the proposed computing theory based on mathematical formulation, and checked its feasibility in its applications to a case study. The proposed theory promotes collaborative and transparent decision making in consideration of the properties of stakes under time pressure by selecting the strategy of collaboration or competition at the much earlier stage.