A simple proof of the representation theorem for betweenness preferences
This paper presents a simple proof of Dekel (1986)'s representation theorem for betweenness preferences. The proof is based on the separation theorem.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Finding Proofs in Tarskian Geometry
We report on a project to use a theorem prover to find proofs of the theorems in Tarskian geometry. These theorems start with fundamental properties of betweenness, proceed through the derivations of several famous theor…
General Manipulability Theorem for a Matching Model
In a many-to-many matching model in which agents' preferences satisfy substitutability and the law of aggregate demand, we proof the General Manipulability Theorem. We result generalizes the presented in Sotomayor (1996 …
modelProving the Incompatibility of Efficiency and Strategyproofness via SMT Solving
Two important requirements when aggregating the preferences of multiple agents are that the outcome should be economically efficient and the aggregation mechanism should not be manipulable. In this paper, we provide a co…
Dynamic portfolio selection for nonlinear law-dependent preferences
This paper addresses the portfolio selection problem for nonlinear law-dependent preferences in continuous time, which inherently exhibit time inconsistency. Employing the method of stochastic maximum principle, we estab…
Characterizing the top trading cycles rule for housing markets with lexicographic preferences
We consider a housing market model with limited externalities where agents care both about their own consumption via demand preferences and about the agent who receives their endowment via supply preferences (we extend t…