OPTIMAL PULLOUT GAME FOR PROOF-OF-STAKE BLOCKCHAINS: A MECHANISM DESIGN APPROACH

Summary from the TLDR Crypto newsletter

Designing proof of stake exit queues requires proper optimization of security and flexibility with the intent of satisfying time constraints while minimizing disutility from waiting. When stakers have the same time sensitivity, a dynamic capacity first come first serve queue is ideal. When stakers have different time sensitivities, protocols should use a dynamic capacity protocol queue.