GitHub

@@ -424,13 +424,14 @@ def evaluate_largest(v_hat, array, order=1):

424424425425

We can check the accuracy of our `evaluate_largest` method by comparing it with an analytical solution.

426426427-

We find that despite small discrepancy, the evaluate_largest method functions well.

428-429-

Furthermore, if we take a very large number of auctions, say 1 million, the discrepancy disappears.

427+

We find that the `evaluate_largest` method functions well

430428431429

```{code-cell} ipython3

432-

v_grid = np.linspace(0.3,1,8)

433-

bid_analytical = b_star(v_grid,N)

430+

v_grid = np.linspace(0.3, 1, 8)

431+

bid_analytical = b_star(v_grid, N)

432+433+

# Redraw valuations

434+

v = np.random.uniform(0, 1, (N, R))

434435

bid_simulated = [evaluate_largest(ii, v) for ii in v_grid]

435436436437

fig, ax = plt.subplots(figsize=(6, 4))

Read the original on github.com ↗