볼드윈 규칙 공리화 노트
Goto and Nakada (2026)는 Neutrality, Bottom Consistency, Faithfulness, Cancellation, Bottom Independence를 사용하여 Baldwin rule을 특징짓는 방법을 제시했습니다. 기존의 증명은 linear algebra와 graph theory 기법에 의존하고 있습니다. 본 논문은 permutation과 amplified preference profiles에 기반한 순수하게 combinatorial한 논증을 사용하여 더 단순한 증명을 제공합니다.
arXiv:2606.31271v1 Announce Type: new Abstract: Goto and Nakada (2026) showed that the Baldwin rule can be characterized using Neutrality}, Bottom Consistency, Faithfulness, Cancellation and Bottom Independence. While their proof relies on the technique of linear algebra and graph theory, in this note, we provide a simpler proof using purely combinatorial arguments based on permutations and amplified preference profiles, thereby providing a more transparent proof of the characterization.