نتایج جستجو برای: win win relationship

تعداد نتایج: 561633  

Journal: :Journal of Computer and System Sciences 2016

Journal: :IDS Bulletin 2023

This article argues that there is nothing inherently bad about power over others – it depends on how used; in many ways does not have to be a zero-sum game; and perspectives strategies for transforming from below, vital as they are, should distract the potentials transformations above. Power can used empower. requires changes mindsets behaviour, with actions like convening, catalysing, facilita...

Journal: :Information Management and Business Review 2021

This paper builds an automated negotiation process model for integrative negotiations. The defines and automates the necessary phases activities along with approach principles to create win-win outcomes that mutually satisfy negotiating parties. However, realize this objective, literature theories are reviewed determine relevant negotiations help develop form basis of model. After investigation...

Journal: :International Journal of Engineering and Management Research 2021

Creating shared value is a framework created for enhancing economic the organization while simultaneously meeting needs of society and its challenges. This paper aims in providing structural values also key measures taken by various organization. articles emphasis on adoption impact environmental performance, Stakeholder’s health, nutrition, affordability basic requirements stake holders improv...

Journal: :Discrete Mathematics 2017
Anthony Bonato Przemyslaw Gordinowicz Gena Hahn

A relational characterization of cop-win graphs was provided by Nowakowski and Winkler in their seminal paper on the game of Cops and Robbers. As a by-product of that characterization, each cop-win graph is assigned a unique ordinal, which we refer to as a CRordinal. For finite graphs, CR-ordinals correspond to the length of the game assuming optimal play, with the cop beginning the game in a l...

Journal: :Australasian J. Combinatorics 2015
Ben Cameron Shannon L. Fitzpatrick

The problem is to determine the number of ‘cops’ needed to capture a ‘robber’ where the game is played with perfect information, the different sides moving alternately. The cops capture the robber when one of them occupies the same vertex as the robber at any time in the game. A copwin graph is one in which one cop can always capture the robber. A graph is cop-win edge-critical with respect to ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید