Note on an Axiomatization of the Baldwin Rule

Leo Goto and Satoshi Nakada

Papers from arXiv.org

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.

Date: 2026-06
References: Add references at CitEc
Citations:

Downloads: (external link)
https://arxiv.org/pdf/2606.31271 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2606.31271

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().