A paper and pencil game where players take the part of traders dealing in tins of tuna. Each starts with a fixed sum of money and then buys and sells tins of the product with the object of ending the game with more money than his or her competitors.

There are a lot of games which simulate market demand and supply, but this is the only one I know of that achieves this in a way that will satisfy paper & pencil purists. Middleman's designer Eric Solomon wrote in "Games With Pencil And Paper".

Since dice are not acceptable in true pencil-and-paper games the market figures are decided by adding together numbers privately chosen by the players at the start of the game.

An interesting feature of this is that a certain amount of prediction is possible on the basis of the order of the numbers (the digits 0 to 9 can be used once each) you have selected and those revealed so far by your opponents. This opens the way for skillful players to recognise which rounds provide buyer's markets and which provide seller's markets, and trade accordingly.

Players take the part of traders dealing in tins of some worthy commodity, say tuna. Each starts with a fixed sum of money and then buys and sells tins of the product with the object of ending the game with more money than his or her competitors.

- Players
Two or more

- Pencils
Each player needs one, plus a sheet of paper marked up as a Game Sheet

- Paper
Game Sheets are made of ordinary lined paper with rows and columns labeled as in the picture above. Use the password worksheets.site to open the file.

Starting capital for each player is ten times the number of participants. This figure is written into the first **Cash Held** box in the first column of each player's Game Sheet.

*For example, if there are two players, each starts with 20. If there are three, each starts with 30, and so on.*

Players start with zero **Tins Held**.

Each player writes the numbers 0 to 9 into the boxes on the row marked **A in any desired order.**

Next, players write 0 to 9 in a different order into the boxes on the row marked **D**.

All the players first visit an auction to buy tins. Each player privately writes the number of tins desired into the **Tins Wanted** box of the column of their Game Sheet corresponding to the current turn.

Next, players write the amount of money they are prepared to pay per in the **Offer/Tin** box. These two numbers constitute each player's order.

After players have written their order, the auctioneer - who is not one of the player but purely conceptual - reveals how many tins are for sale. Players call out their **A** for the turn, and the total gives the number of tins available on the market.

Because our notional auctioneer wants to maximise profit, players are served according to their willingness to pay the highest price. If the player who offered the most has his or her order satisfied and there are still tins available, the player who bid the next highest offer price has his or her order dealt with. This procedure continues until all orders are met or there are no tins left to be sold.

Players write the number of tins they succeeded acquiring in the **Tins Bought** box of the Game Sheet.

Jane | Fred | Mary | |
---|---|---|---|

Tins Wanted | 6 | 5 | 9 |

Offer/Tin | 5 | 4 | 2 |

A | 8 | 0 | 2 |

Available Tins | 10 | 10 | 10 |

Tins Bought | 6 | 4 | 0 |

*Three players - Jane, Fred, and Mary - fill in their Game Sheets as shown above. Jane has offered the most per tin, Fred is the next and Mary has tried to get her tins too cheap with the result that she gets none at all.*

When two or more players make identical offers per tin, and no other player with a higher offer is still waiting for his or her order to be met, the tie is resolved by satisfying their orders equally until one of the following situations occurs:

- The tieing orders are completeley satisfied, in which case the auction continues.
- The market runs out of sufficient tins to give each of the remaining unsatisfied tieing-orders one tin each. In this case, the players with tieing-orders drop out of the auction and the remaining tins are offered to the next highest bidder.
- There are not tins left to be sold, at which point the auction stage is ended.

Here are two more examples showing what happens when there are players offering the same amount for tins:

Jane | Fred | Mary | |
---|---|---|---|

Tins Wanted | 6 | 5 | 9 |

Offer/Tin | 5 | 3 | 3 |

A | 7 | 3 | 1 |

Available Tins | 11 | 11 | 11 |

Tins Bought | 6 | 2 | 2 |

*One tin remains unsold because it cannot be shared equally between Fred and Mary adn there is no other buyer remaining.*

Jane | Fred | Mary | |
---|---|---|---|

Tins Wanted | 3 | 9 | 2 |

Offer/Tin | 4 | 4 | 3 |

A | 3 | 1 | 7 |

Available Tins | 11 | 11 | 11 |

Tins Bought | 3 | 8 | 0 |

When all players have filled in their **Tins Bought** boxes they proceed to fill the **Cash Held** and **Tins Held** above the **Selling Phase** of the Game Sheets. In the **Cash Held** box players write a sum equal to the cash in hand minus the money he has just spent in acquiring new tins (the number of tins bought multiplied by the offer price per tin).

Players who err in placing orders by not having the funds to pay for their tins are out of the game.

Everyone privately decides how many tins to put on the market and the asking price per tin. These numbers are written in the **For Sale** and the **Price/Tin** boxes.

The market never pays more than 10 per tin.

The **D** numbers are then added together to the give the numbers tins that the market demands This is written in every player's **Demand** box.

The method of discovering how many tins each player manages to sell is identical to that used in the buying phase - except that whereas the Auctioneer favours players offering the **highest** price per tin, the market favours those asking the **lowest** price per tin. The player asking the lowest price sells all his or her marketed tins unless the market wants less.

Jane | Fred | Mary | |
---|---|---|---|

For Sale | 3 | 5 | 4 |

Price/Tin | 5 | 9 | 10 |

D | 6 | 1 | 3 |

Demand | 10 | 10 | 10 |

Tins Sold | 3 | 5 | 2 |

*Mary is left with two unsold tins*

When two or more players ask the same price for their tins, and no other player with a lower asking price still has unsold tins, the tie is resolved by allowing them to sell tins equally until one of the following situations occurs:

- The tieing players sell all tins and the auction continues.
- The market wants less tins than than would enable each of the tieing players sell one. The tieing players withdraw their unsold tins and the next cheapest tins are sold.
- The market requires no more tins, at which point the sale is closed.

Jane | Fred | Mary | |
---|---|---|---|

For Sale | 6 | 6 | 9 |

Price/Tin | 7 | 7 | 10 |

D | 1 | 6 | 4 |

Demand | 11 | 11 | 11 |

Tins Sold | 5 | 5 | 1 |

The remaining tin demanded by the market Jane and Fred have sold five tins each cannot be provided equally by both Jane and Fred, so Mary is allowed to provide it.

Jane | Fred | Mary | |
---|---|---|---|

For Sale | 3 | 4 | 22 |

Price/Tin | 5 | 9 | 9 |

D | 6 | 1 | 4 |

Demand | 11 | 11 | 11 |

Tins Sold | 3 | 4 | 4 |

*The market demand has been satisfied, leaving Mary with 18 unsold tins.*

When everyone has recorded the number of tins sold in the **Tins Sold** box the round is finished and the **Cash Held** and **Tins Held** boxes at the head of the next column can be filled in. In the **Cash Held** box goes the amount in the previous Cash Held box plus the revenue from sales. The latter quantity is the product of the number of tins sold and the asking price per tin. The **Tins Held** box contains the number of tins held at the start of the selling stage minus the number of tins actually sold.

The winner is the person with the most money in the **Cash Held** box at the head of column 11. The number of tins still held does not enter the reckoning.