Breaking a Negotiation Deadlock
Alan McCarthy, Steve Hay
Abstract
Alan McCarthy, Steve Hay
Abstract
At times, no matter how well you plan, the negotiation can seem to get into a deadlock where no progress appears to be possible. The main thing to remember is that both parties will lose if the deadlock is allowed to continue. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
At times, no matter how well you plan, the negotiation can seem to get into a deadlock where no progress appears to be possible. The main thing to remember is that both parties will lose if the deadlock is allowed to continue. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Key concepts: Deadlock, Negotiation, Computer science, Plan (archaeology), Computer security, Deadlock prevention algorithms, Political science, Distributed computing