Zeuthen strategy

The Zeuthen strategy is a negotiation strategy used by some artificial agents. Its purpose is to measure the willingness to risk conflict.[1] An agent will be more willing to risk conflict if it does not have much to lose in case that the negotiation fails. In contrast, an agent is less willing to risk conflict when it has more to lose. The value of a deal is expressed in its utility. An agent has much to lose when the difference between the utility of its current proposal and the conflict deal is high.

When both agents use the monotonic concession protocol, the Zeuthen strategy leads them to agree upon a deal in the negotiation set. This set consists of all conflict free deals, which are individually rational and Pareto optimal, and the conflict deal, which maximizes the Nash product.

The strategy was introduced in 1930 by the Danish economist Frederik Zeuthen.[2]

Three key questions

The Zeuthen strategy answers three open questions that arise when using the monotonic concession protocol, namely:

  1. Which deal should be proposed at first?
  2. On any given round, who should concede?
  3. In case of a concession, how much should the agent concede?

The answer to the first question is that any agent should start with its most preferred deal, because that deal has the highest utility for that agent.[3] The second answer is that the agent with the smallest value of Risk(i,t) concedes, because the agent with the lowest utility for the conflict deal profits most from avoiding conflict. To the third question, the Zeuthen strategy suggests that the conceding agent should concede just enough raise its value of Risk(i,t) just above that of the other agent. This prevents the conceding agent to have to concede again in the next round.

Risk


Risk(i,t) is a measurement of agent i's willingness to risk conflict. The risk function formalizes the notion that an agent's willingness to risk conflict is the ratio of the utility that agent would lose by accepting the other agent's proposal to the utility that agent would lose by causing a conflict. Agent i is said to be using a rational negotiation strategy if at any step t + 1 that agent i sticks to his last proposal, Risk(i,t) > Risk(j,t).

Sufficient concession

If agent i makes a sufficient concession in the next step, then, assuming that agent j is using a rational negotiation strategy, if agent j does not concede in the next step, he must do so in the step after that. The set of all sufficient concessions of agent i at step t is denoted SC(i, t).

Minimal sufficient concession

is the minimal sufficient concession of agent A in step t.

Agent A begins the negotiation by proposing

and will make the minimal sufficient concession in step t + 1 if and only if Risk(A,t) ≤ Risk(B,t).

Theorem If both agents are using Zeuthen strategies, then they will agree on

that is, the deal which maximizes the Nash product.[4]

Proof Let δA = δ(A,t). Let δB = δ(B,t). According to the Zeuthen strategy, agent A will concede at step if and only if

That is, if and only if

Thus, Agent A will concede if and only if does not yield the larger product of utilities.

Therefore, the Zeuthen strategy guarantees a final agreement that maximizes the Nash Product.

References

  1. Wooldridge, Michael (2009). An Introduction to MultiAgent Systems (2nd ed.). John Wiley & Sons Ltd. pp. 327–329. ISBN 9780470519462.
  2. Fatima, Shaheen; Kraus, Sarit; Wooldridge, Michael (2014). Principles of automated negotiation. Cambridge University Press. pp. 14–15. ISBN 9781316060582.
  3. Rosenschein, Jeffrey S.; Zlotkin, Gilad (Fall 1994). "Designing Conventions for Automated Negotiation". AI Magazine. AAAI. 15: 29–46. doi:10.1609/aimag.v15i3.1098.
  4. Harsanyi, John C. (April 1956). "Approaches to the Bargaining Problem Before and After the Theory of Games: A Critical Discussion of Zeuthen's, Hicks', and Nash's Theories". Econometrica. 24 (2): 144–157. doi:10.2307/1905748. JSTOR 1905748.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.