User:Evolvedlight/Monotonic Concession Protocol

The monotonic concession protocol was invented by Rosenschein and Zlotkin in 1994

In the monotonic concession protocol, negotiation proceeds in a series of rounds. The protocol is verifiable - both agents can see that the rules of the protocol are being followed


 * The first round starts with both agents simultaneously proposing a deal from the negotiation set.
 * A deal is reached (an agreement) if the two agents with deals δ1 and δ2, and either 1) utility1(δ2) ≥ utility1(δ1) or 2) utility2(δ1) ≥ utility2(δ2). This means that an agreement is reached if one of the agents calculates that the deal proposed by the other in the first stage is as good or better than the deal it made.
 * If an agreement has been reached, then if both deals exceed or match those of the other agent then one deal is chosen at random, and if only one proposal exceeds or matches the other's proposal then that one is chosen, and this is the agreement deal
 * If no agreement is reached through agents making concessions, then after u rounds where u > 0, negotiation terminates with the conflict deal.