2023-11-19 00:50:53 +00:00
|
|
|
package main
|
|
|
|
|
|
|
|
import (
|
|
|
|
"fmt"
|
2023-11-19 00:51:19 +00:00
|
|
|
"git.chromaticdragon.app/kistaro/auctionsim/auctionsim"
|
2023-11-19 00:50:53 +00:00
|
|
|
"log"
|
2023-11-19 01:27:50 +00:00
|
|
|
"math"
|
2023-11-19 00:50:53 +00:00
|
|
|
"os"
|
|
|
|
"strconv"
|
|
|
|
)
|
|
|
|
|
2023-11-19 01:27:50 +00:00
|
|
|
func deltaStr(delta float64) string {
|
|
|
|
if delta > 0 {
|
|
|
|
return fmt.Sprintf("gained ¤%f", delta)
|
|
|
|
}
|
|
|
|
if delta < 0 {
|
|
|
|
return fmt.Sprintf("lost ¤%f", -delta)
|
|
|
|
}
|
|
|
|
return "broken even"
|
|
|
|
}
|
|
|
|
|
2023-11-19 00:50:53 +00:00
|
|
|
func main() {
|
2023-11-19 00:52:22 +00:00
|
|
|
num := int64(1000)
|
2023-11-19 00:50:53 +00:00
|
|
|
if len(os.Args) > 1 {
|
|
|
|
n, err := strconv.ParseInt(os.Args[1], 0, 64)
|
|
|
|
if err != nil {
|
|
|
|
log.Fatalf("can't parse %q as a number of bidders: %v", os.Args[1], err)
|
|
|
|
}
|
|
|
|
num = n
|
|
|
|
}
|
|
|
|
if num <= 1 {
|
|
|
|
log.Fatalf("can't run an auction with %d bidders", num)
|
|
|
|
}
|
|
|
|
|
2023-11-19 01:27:50 +00:00
|
|
|
price, allBidders := auctionsim.RunAuctionVerbosely(
|
2023-11-19 00:52:22 +00:00
|
|
|
&auctionsim.CappedBidderGenerator{
|
2023-11-19 00:51:19 +00:00
|
|
|
G: auctionsim.NormalestBidderGenerator(),
|
2023-11-19 00:50:53 +00:00
|
|
|
Lim: num,
|
|
|
|
},
|
|
|
|
)
|
2023-11-19 01:27:50 +00:00
|
|
|
bidder := allBidders[len(allBidders)-1]
|
2023-11-19 00:50:53 +00:00
|
|
|
|
2023-11-19 01:27:50 +00:00
|
|
|
fmt.Printf("The auction winner paid ¤%f. They have %s.\n", price, deltaStr(bidder.Value-price))
|
|
|
|
fmt.Printf("The item was worth ¤%f to them.\n", bidder.Value)
|
|
|
|
fmt.Printf("They would have paid up to ¤%f for it.\n", bidder.BidCeiling())
|
|
|
|
|
|
|
|
fmt.Println()
|
|
|
|
i := len(allBidders) - 2
|
|
|
|
for i >= 0 && allBidders[i].Value < price {
|
|
|
|
i--
|
2023-11-19 00:50:53 +00:00
|
|
|
}
|
2023-11-19 01:27:50 +00:00
|
|
|
|
|
|
|
if i < 0 {
|
|
|
|
fmt.Printf("The item was not worth that to anybody.\n")
|
|
|
|
} else {
|
|
|
|
rube := allBidders[i]
|
|
|
|
fmt.Printf("The highest bidder who would have made a profit at that price stopped bidding at ¤%f.\n", rube.BidCeiling())
|
|
|
|
fmt.Printf("They should have kept bidding until ¤%f.\n", rube.Value)
|
|
|
|
if rankDelta := len(allBidders) - i - 1; rankDelta == 1 {
|
|
|
|
fmt.Println("They were outbid by 1 bidder.")
|
|
|
|
} else {
|
|
|
|
fmt.Printf("They were outbid by %d bidders.\n", rankDelta)
|
|
|
|
}
|
|
|
|
fmt.Printf("If they had paid the amount of the winning bid, they would have %s.\n", deltaStr(rube.Value-price))
|
2023-11-19 00:50:53 +00:00
|
|
|
}
|
|
|
|
|
2023-11-19 01:27:50 +00:00
|
|
|
fmt.Println()
|
|
|
|
maxValue := math.Inf(-1)
|
|
|
|
maxIdx := -1
|
|
|
|
for i, b := range allBidders {
|
|
|
|
if b.Value > maxValue {
|
|
|
|
maxValue = b.Value
|
|
|
|
maxIdx = i
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if maxIdx == -1 {
|
|
|
|
fmt.Println("Wow! It was infinitely beyond worthless to everybody.")
|
|
|
|
} else {
|
|
|
|
fmt.Printf("The bidder who would have gotten the most value was outbid by %d bidders.\n", len(allBidders)-maxIdx-1)
|
|
|
|
rube := allBidders[maxIdx]
|
|
|
|
fmt.Printf("The item was worth at most ¤%f to them. Their maximum bid was ¤%f.\n", rube.Value, rube.BidCeiling())
|
|
|
|
fmt.Printf("If they had paid the winning bid, they would have %s.\n", deltaStr(rube.Value-price))
|
|
|
|
}
|
2023-11-19 00:50:59 +00:00
|
|
|
}
|