IDEAS home Printed from https://ideas.repec.org/a/spr/grdene/v17y2008i2d10.1007_s10726-007-9078-6.html
   My bibliography  Save this article

An organizational model for transitional negotiations: concepts, design and applications

Author

Listed:
  • Siva Sankaran

    (California State University Northridge)

  • Tung Bui

    (University of Hawaii, Manoa)

Abstract

Negotiations generally tend to focus efforts on attaining optimality in single-problem contexts that are ad hoc, disparate and temporary in nature. Once negotiators reach agreement, the process usually attains closure and the long-term impact of the outcome is rarely considered. In organizational settings, decisions involving quid pro quos are, however, made on a continuous basis. Since organizational environments are constantly in flux, negotiated solutions that appeared successful on a given problem at first might no longer work out to be effective in the long run. We postulate that organizations evolve from one state to another and negotiations play an important part in these transitions. From this perspective, decision-making in organizations or between them can be modeled using sequential Markov chains that converge on homeostasis. This leads to a prescriptive approach for transitional negotiations that allow for assessment of the long-term impact of decisions and suggest acceptance of possible short-term losses in favor of the better payoffs that are to come. We provide a hydraulic dam example to illustrate the transitional aspect of decision-making over time. Based on earlier successful GDSS, we also suggest a software architecture that would allow the proposed theoretical model to be implemented as an organization negotiation support system with practical benefits.

Suggested Citation

  • Siva Sankaran & Tung Bui, 2008. "An organizational model for transitional negotiations: concepts, design and applications," Group Decision and Negotiation, Springer, vol. 17(2), pages 157-173, March.
    • Handle: RePEc:spr:grdene:v:17:y:2008:i:2:d:10.1007_s10726-007-9078-6
    DOI: 10.1007/s10726-007-9078-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10726-007-9078-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10726-007-9078-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Harri Ehtamo & Raimo P. Hämäläinen, 2001. "Interactive Multiple‐Criteria Methods for Reaching Pareto Optimal Agreements in Negotiations," Group Decision and Negotiation, Springer, vol. 10(6), pages 475-491, November.
    2. Philip Anderson, 1999. "Perspective: Complexity Theory and Organization Science," Organization Science, INFORMS, vol. 10(3), pages 216-232, June.
    3. John R. Birge, 1997. "State-of-the-Art-Survey---Stochastic Programming: Computation and Applications," INFORMS Journal on Computing, INFORMS, vol. 9(2), pages 111-133, May.
    4. Sheila C. Dow & Peter E. Earl (ed.), 1999. "Contingency, Complexity and the Theory of the Firm," Books, Edward Elgar Publishing, number 1884.
    5. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    6. Soren S. Nielsen & Stavros A. Zenios, 1993. "A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems," Operations Research, INFORMS, vol. 41(2), pages 319-337, April.
    7. John M. Mulvey & Andrzej Ruszczyński, 1995. "A New Scenario Decomposition Method for Large-Scale Stochastic Optimization," Operations Research, INFORMS, vol. 43(3), pages 477-490, June.
    8. Hsiangchu Lai & Her-Sen Doong & Chi-Chung Kao & Gregory E. Kersten, 2006. "Negotiators' Communication, Perception of Their Counterparts, and Performance in Dyadic E-negotiations," Group Decision and Negotiation, Springer, vol. 15(5), pages 429-447, September.
    9. Bui, Tung, 2000. "Building agent-based corporate information systems: An application to telemedicine," European Journal of Operational Research, Elsevier, vol. 122(2), pages 242-257, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sodhi, ManMohan S. & Tang, Christopher S., 2009. "Modeling supply-chain planning under demand uncertainty using stochastic programming: A survey motivated by asset-liability management," International Journal of Production Economics, Elsevier, vol. 121(2), pages 728-738, October.
    2. Panos Parpas & Berç Rustem, 2007. "Computational Assessment of Nested Benders and Augmented Lagrangian Decomposition for Mean-Variance Multistage Stochastic Problems," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 239-247, May.
    3. V.I. Norkin & G.C. Pflug & A. Ruszczynski, 1996. "A Branch and Bound Method for Stochastic Global Optimization," Working Papers wp96065, International Institute for Applied Systems Analysis.
    4. Cooper, W. W. & Hemphill, H. & Huang, Z. & Li, S. & Lelas, V. & Sullivan, D. W., 1997. "Survey of mathematical programming models in air pollution management," European Journal of Operational Research, Elsevier, vol. 96(1), pages 1-35, January.
    5. Jesús Latorre & Santiago Cerisola & Andrés Ramos & Rafael Palacios, 2009. "Analysis of stochastic problem decomposition algorithms in computational grids," Annals of Operations Research, Springer, vol. 166(1), pages 355-373, February.
    6. Julia Higle & Suvrajeet Sen, 2006. "Multistage stochastic convex programs: Duality and its implications," Annals of Operations Research, Springer, vol. 142(1), pages 129-146, February.
    7. Og[caron]uzsoy, Cemal Berk & Güven, Sibel, 2007. "Robust portfolio planning in the presence of market anomalies," Omega, Elsevier, vol. 35(1), pages 1-6, February.
    8. Z. L. Chen & W. B. Powell, 1999. "Convergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse," Journal of Optimization Theory and Applications, Springer, vol. 102(3), pages 497-524, September.
    9. Manuel Laguna, 1998. "Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty," Management Science, INFORMS, vol. 44(11-Part-2), pages 101-110, November.
    10. Jie Sun & Xinwei Liu, 2006. "Scenario Formulation of Stochastic Linear Programs and the Homogeneous Self-Dual Interior-Point Method," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 444-454, November.
    11. Diana Barro & Elio Canestrelli, 2005. "Time and nodal decomposition with implicit non-anticipativity constraints in dynamic portfolio optimization," GE, Growth, Math methods 0510011, University Library of Munich, Germany.
    12. Dimitris Bertsimas & Omid Nohadani & Kwong Meng Teo, 2010. "Robust Optimization for Unconstrained Simulation-Based Problems," Operations Research, INFORMS, vol. 58(1), pages 161-178, February.
    13. Boris Defourny & Damien Ernst & Louis Wehenkel, 2013. "Scenario Trees and Policy Selection for Multistage Stochastic Programming Using Machine Learning," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 488-501, August.
    14. K. Kiwiel & C.H. Rosa & A. Ruszczynski, 1995. "Decomposition via Alternating Linearization," Working Papers wp95051, International Institute for Applied Systems Analysis.
    15. Yan, Yongze & Hong, Liu & He, Xiaozheng & Ouyang, Min & Peeta, Srinivas & Chen, Xueguang, 2017. "Pre-disaster investment decisions for strengthening the Chinese railway system under earthquakes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 39-59.
    16. Semih Atakan & Suvrajeet Sen, 2018. "A Progressive Hedging based branch-and-bound algorithm for mixed-integer stochastic programs," Computational Management Science, Springer, vol. 15(3), pages 501-540, October.
    17. Lee, Chungmok, 2022. "A robust optimization approach with probe-able uncertainty," European Journal of Operational Research, Elsevier, vol. 296(1), pages 218-239.
    18. Samer Takriti & John R. Birge, 2000. "Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs," Operations Research, INFORMS, vol. 48(1), pages 91-98, February.
    19. X. W. Liu & M. Fukushima, 2006. "Parallelizable Preprocessing Method for Multistage Stochastic Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 327-346, December.
    20. Chia-Hung Chen & Shangyao Yan & Miawjane Chen, 2010. "Short-term manpower planning for MRT carriage maintenance under mixed deterministic and stochastic demands," Annals of Operations Research, Springer, vol. 181(1), pages 67-88, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:grdene:v:17:y:2008:i:2:d:10.1007_s10726-007-9078-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.