Looks like my incorrect speculations on the exact models were likely not helpful, I also did not expect the 1 bidders (fine strategy against real duplicates like in the scenario given, but we’re trying to have a competition here!).
It* requires less effort because ‘cooperation’ reduces effort, while ‘competition’ increases it**.
In general, one would define cooperation in games as strategies that lead to better overall gains, and ignore effort involved in thinking up the strategy. In this case, there was an easy cooperative strategy, but it’s not in general true, for example, in the Darwin Game designing a cooperative strategy was more complicated than a simple 3-bot defect strategy. 3-bot didn’t do well but possibly could have if there were a lot of non-punishing simulators submitted (there weren’t).
Also, even in this particular case, you could have had better results if you had taken the effort to get more to follow the same strategy. The rules did not explicitly forbid coordination, even by non-Lesswrongers, so you could have recruited a horde of acquaintances to spam 1-bids. (that might have been against the spirit of the rules, but you could have asked abstractapplic about it first I, I guess).
In general, one would define cooperation in games as strategies that lead to better overall gains, and ignore effort involved in thinking up the strategy.
You should change your username to ‘one’ then.*
Imagine a game where the ‘optimal strategy’ is more difficult to calculate than the optimal strategy in chess. Or, suppose you’re playing a chess game. You know how to calculate the optimal strategy. Unfortunately, it will take 10 years to calculate on your supercomputer, and you can’t take 10 years to make the first move. To neglect time as a resource is to neglect that ‘the optimal strategy’ must be executed after it is formulated, not before.
The rules did not explicitly forbid coordination, even by non-Lesswrongers, so you could have recruited a horde of acquaintances to spam 1-bids. (that might have been against the spirit of the rules, but you could have asked abstractapplic about it first I, I guess).
Do you want to make a bet concerning abstractapplic’s response to this question?
Vague price sense > guessing how others might bid > guarding against someone aiming for significantly higher ROI than you did > exact price sense, I think?
Yeah, and actually 1-bidding can be a good strategy even from a selfish perspective if you can get enough people to coordinate on it, since a small enough number of high bidders will run out of money and the 1-bidders make a large profit on what they do win, though it’s not stable against defection (2-bidders win in the 1-bidder-filled environment).
Of course not, they lose to 3-bidders. I wouldn’t consider that “defection” in the same way though, since the 1-bidding is presumably an attempt at coordination and the 2-bidding would be exploiting that coordination and not directly a coordination attempt.
There weren’t any 2-bidders.
Sure, but if 1-bidding were to become popular in similar problems, there would start to be 2-bidders.
Bidder G reporting in…
Looks like my incorrect speculations on the exact models were likely not helpful, I also did not expect the 1 bidders (fine strategy against real duplicates like in the scenario given, but we’re trying to have a competition here!).
How much time did you spend coming up with that strategy?
Good point. I should have anticipated strategies that require less effort to be more popular.
Returns on time aside (I meant that question seriously—plotting out a returns on compute versus compute (time) curve sounds interesting***):
It* requires less effort because ‘cooperation’ reduces effort, while ‘competition’ increases it**.
(This is also measurable in the split between the traveler and the players.)
*The strategy
**effort
***In particular, getting a sense for something like the marginal returns on time invested, and then comparing it across problems.
In general, one would define cooperation in games as strategies that lead to better overall gains, and ignore effort involved in thinking up the strategy. In this case, there was an easy cooperative strategy, but it’s not in general true, for example, in the Darwin Game designing a cooperative strategy was more complicated than a simple 3-bot defect strategy. 3-bot didn’t do well but possibly could have if there were a lot of non-punishing simulators submitted (there weren’t).
Also, even in this particular case, you could have had better results if you had taken the effort to get more to follow the same strategy. The rules did not explicitly forbid coordination, even by non-Lesswrongers, so you could have recruited a horde of acquaintances to spam 1-bids. (that might have been against the spirit of the rules, but you could have asked abstractapplic about it first I, I guess).
You should change your username to ‘one’ then.*
Imagine a game where the ‘optimal strategy’ is more difficult to calculate than the optimal strategy in chess. Or, suppose you’re playing a chess game. You know how to calculate the optimal strategy. Unfortunately, it will take 10 years to calculate on your supercomputer, and you can’t take 10 years to make the first move. To neglect time as a resource is to neglect that ‘the optimal strategy’ must be executed after it is formulated, not before.
Do you want to make a bet concerning abstractapplic’s response to this question?
*I expect
Neo hasn’t been taken yet.
What I wrote to abstractapplic:
Yeah, and actually 1-bidding can be a good strategy even from a selfish perspective if you can get enough people to coordinate on it, since a small enough number of high bidders will run out of money and the 1-bidders make a large profit on what they do win, though it’s not stable against defection (2-bidders win in the 1-bidder-filled environment).
But:
are the 2-bidders stable against ‘defection’?
There weren’t any 2-bidders.
Of course not, they lose to 3-bidders. I wouldn’t consider that “defection” in the same way though, since the 1-bidding is presumably an attempt at coordination and the 2-bidding would be exploiting that coordination and not directly a coordination attempt.
Sure, but if 1-bidding were to become popular in similar problems, there would start to be 2-bidders.