Negotiation
Registrations Have Closed
Negotiations Training Workshop
Thurs 18 August (2-4pm) at the moot court
For those who have the gift of the gab, this competition is for you! Facing an opposing team who represents a client that is causing your client to worry, you will be required to negotiate a deal in your client’s best interests. Keep your cards close to you- the other side cannot find out your client’s secrets. But what is their client hiding? You will find out during an intense battle of careful investigation and sometimes hardball negotiation tactics.
The Negotiation competition is designed to test and refine legal negotiation skills. As over eighty-percent of disputes are settled outside of Court in New South Wales, all students will find these skills useful when communicating with other lawyers and third parties.
Two teams (of two members each) come together to negotiate a settlement that shall satisfy both of their fictional client’s needs. Each team receives a series of common facts and some exclusive material prior to the negotiation. A 40-minute negotiation takes place once both teams have had time to prepare and analyse the needs of their client.
In 2010, the competition was won by Reece Corbett-Wilkins and Nicholas Ferrari, with runners up Jenny Altherr and Luke Wilson.
Key Dates:
Friday 12 August: Applications close
Week 2: Negotiations Workshop
Tuesday 30 August: Round 1 Pool A
Thursday 1 September: Round 1 Pool B
Tuesday 13 September: Round 2 Pool A
Thursday 15 September: Round 2 Pool B
Tuesday 4 October: Round 3 Pool A
Thursday 6 October: Round 3 Pool B
Thursday 20 October: Quarter Final Round
Thursday 27 October: Semi Final Round
Tuesday 8 November: Grand Final Round (TBC)
2011_MULS_Appeals_and_Forfeiture_Policy
The Negotiations Competition will be held in Semester Two. More information about workshops, key dates, and registration will be provided in due course.
For more information, please contact Reece Corbett-Wilkins (competitions@muls.org) and Elysse Lloyd (competitionsofficer@muls.org).
