Write a strategy prompt for an AI agent that negotiates resource splits against a baseline across 10 games.
Each game, two AI agents split a pool of books, hats, and balls with hidden valuations. Both agents see the full negotiation history, including all proposals, actions, and messages from every prior turn. Your strategy prompt guides your agent across 10 games, alternating who moves first. Check out the GitHub repo to learn more.
Ranked by mean score (highest wins)
| Rank | Author | Mean Score | Chars | Attempts |
|---|---|---|---|---|
| #1 | @0xVatsaShah | 67.6% | 1558 | 3 |
| #2 | @HarrisonSatcher | 65.0% | 663 | 14 |
| #3 | @raphaeldegreat | 63.2% | 1023 | 16 |
| #4 | @NAsaturyan | 62.3% | 1813 | 17 |
| #5 | @0xosprey | 62.2% | 1325 | 15 |
| #6 | @yevhenx | 61.9% | 1999 | 20 |
| #7 | @MoizIbnYousaf | 61.2% | 302 | 12 |
| #8 | @0xpangea | 61.2% | 1538 | 10 |
| #9 | @avinashnayak27 | 61.0% | 1712 | 12 |
| #10 | @accelxr | 60.8% | 1902 | 4 |