Our good friend Paul Lurie advises of new frontiers for his capable dispute resolution approach, “Guided Choice”:<\/p>\n
On January 12, 2016, AAA is releasing \u00a0our first of several 2016 on demand, online programs. It is a 1.6 hour audio and slide program on how the principles of Guided Choice are actually used in practice to reduce the time and expense of settlement.<\/p>\n
The webinar, “Using Guided Choice to Increase Satisfaction with the Value of Mediators”<\/strong>\u00a0will begin your re-education. Instructors include Paul Lurie, Adrian Bastianelli, Steve Paul, Paul Van Osselaer, Michael Leech, Karl Bayer and Denise Madigan.<\/p>\n
The program can be viewed at your convenience. It can be viewed on a PC, tablet or smartphone. \u00a0A special price of $50 is available. \u00a0https:\/\/www.aaau.org\/courses\/using-guided-choice-to-increase-satisfaction-with-the-value-of-mediators\/15prw042\/<\/a><\/p>\n
Also on January 12th, \u00a0the Guided Choice Dispute Resolution website is being launched to serve as an electronic hornbook \u00a0of information about early dispute resolution and how it is implemented using the tools of Guided Choice and other innovations. The website is\u00a0www.gcdisputeresolution.com<\/a>. \u00a0It is accessible on tablets and smartphones and will be a great reference tool since it will be continually updated. There is no access cost nor passwords. From there you can sign up for email updates.<\/p>\n
<\/p><\/blockquote>\n","protected":false},"excerpt":{"rendered":"
“Guided Choice” takes several steps forward.<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[11,24],"tags":[10,38,23],"class_list":["post-1681","post","type-post","status-publish","format-standard","hentry","category-conflict-resolution","category-systems-design","tag-conflict-management","tag-lawyers","tag-systems-design"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t