Presentation is loading. Please wait.

Presentation is loading. Please wait.

Human-Computer Negotiation in Three-Player Market Settings

Similar presentations


Presentation on theme: "Human-Computer Negotiation in Three-Player Market Settings"— Presentation transcript:

1 Human-Computer Negotiation in Three-Player Market Settings
Galit Haim, Ya'akov Gal, Bo An and Sarit Kraus

2 Interactive Negotiation with Three Players
The SPs Goal: to become the CS’s exclusive provider

3 The Contract Game Using the Colored Trails: An Infrastructure for Agent Design, Implementation and Evaluation for Open Environments (Gal et al AIJ 2010) Main parts: negotiation movement Incomplete information Automatically exchange Game ends: The CS reached one of the SPs Did not move for two consecutive rounds

4 Negotiation Odd Rounds   Even Rounds Accept/Reject????
To which SP to propose??? Which proposal to propose???  Even Rounds

5 Movement Only the CS can move Chip with the same square-color
150 points bonus: both the CS and the SPg 5 points: for each chip left Only the CS can move Chip with the same square-color Visible movements Path to path More than one square

6 The Challenge: Building an Agent that Can Play One of the Roles with People
Sub-Game Perfect Equilibrium Machine Learning + Human Behavior

7 Why not Equilibrium Agents? No Need for Culture Consideration
Nash equilibrium: stable strategies; no agent has an incentive to deviate. Results from the social sciences suggest people do not follow equilibrium strategies: Equilibrium based agents played against people failed. People do not build agents that follow equilibrium strategies. Aumann Kahneman

8 Sub-Game-Perfect-Equilibrium Agent
Commitment offer: bind the customer to one of the SP for the duration of the game Example: CS proposes 11 grays for 33 red and 7 purple chips

9 Extensive Empirical Study: Israel, U.S.A and China
530 students: Israel: 238 students U.S.A: 149 students China: 143 students Baseline: 3 human players One agent vs 2 human players Lab conditions Instructions in the local language: Hebrew, English and Chinese

10 EQ CS Player’s Performance

11 EQ SPy Player’s Performance

12 Human are Bounded Rational: Do not Reach the Goal

13 SPy EQ Agent Improvement
Assumption – When a human player attempt to go to the goal, there is some probability p that he will fail Risk-Averse Agent – With respect to probability failure

14 Risk Averse Agent Results

15 Conclusions Define and analyze a complex three-players negotiation game successfully Equilibrium agents can work well: CS EQ agent outperformed the CS human player SP EQ agent outperformed the SP human player (using the probability to fail)

16 Thank you


Download ppt "Human-Computer Negotiation in Three-Player Market Settings"

Similar presentations


Ads by Google