1 citations · 2 across the 4 of their papers we have counts for
4 papers
Existence of Richter-Peleg Representation for General Preferences
Leandro Gorno, Paulo Klinger Monteiro
We characterize the binary relations that admit a Richter-Peleg representation, imposing neither completeness nor transitivity. A relation admits such a representation if and only…
Connected Incomplete Preferences
Leandro Gorno, Alessandro Rivello
This paper explores a new class of incomplete preferences -- termed ``connected preferences'' -- in which maximal domains of comparability are topologically connected. We provide n…
A Maximum Theorem for Incomplete Preferences
Leandro Gorno, Alessandro Rivello
We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. The…
Learning from Manipulable Signals
Mehmet Ekmekci, Leandro Gorno, Lucas Maestri +2
We study a dynamic stopping game between a principal and an agent. The agent is privately informed about his type. The principal learns about the agent's type from a noisy performa…