chipfiring: A Python Package for Efficient Mathematical Analysis of Chip-Firing Games on Multigraphs

ACM Transactions on Algorithms (talg) Vol 22, Issue 3

ACM Transactions on Computation Theory (toct) Vol 18, Issue 2

Markets are competitive if and only if P != NP

I prove that competitive market outcomes require computational intractability. If P = NP, firms can efficiently solve the collusion detectio

Exploring the mathematical complexity of extended rock-paper-scissors games

Summary: People have tried extending rock-paper-scissors to more than 3 options, with some success. If you allow more pairings to be ties, t

ACM Transactions on Economics and Computation (teac) Vol 14, Issue 2

Specification gaming examples in AI - master list

Specification gaming examples in AI - master list : Sheet1

Specification gaming examples in AI - master list

Specification gaming examples in AI - master list : Sheet1