Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A Hamilton-Jacobi formalism for higher order implicit Lagrangians

  • Esen, Oğul
  • León, Manuel de
  • Sardón, Cristina
In this paper, we present a generalization of the Hamilton-Jacobi theory for higher order implicit Lagrangian systems. We propose two different backgrounds to deal with higher order implicit Lagrangian theories: the Ostrogradski approach and the Schmidt transform, which convert a higher order Lagrangian into a first order one. The Ostrogradski approach involves the addition of new independent variables to account for higher order derivatives, whilst the Schmidt transform adds gauge invariant terms to the Lagrangian function. In these two settings, the implicit character of the resulting equations will be treated in two different ways in order to provide a Hamilton-Jacobi equation. On one hand, the implicit Lagrangian system will be realized as a Lagrangian submanifold of a higher order tangent bundle that is generated by a Morse family. On the other hand, we will rely on the existence of an auxiliary section of a certain bundle that allows the construction of local vector fields, even if the differential equations are implicit. We will illustrate some examples of our proposed schemes, and discuss the applicability of the proposal., This work has been partially supported by MINECO Grants MTM2016- 76-072-P and the ICMAT Severo Ochoa projects SEV-2011-0087 and SEV-2015-0554. C Sardón wishes to acknowledge Juan de la Cierva Formación financial support.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

On the probability of the Condorcet Jury theorem or the miracle of aggregation

  • Romaniega Sancho, Álvaro
The Condorcet Jury Theorem or the Miracle of Aggregation are frequently invoked to ensure the competence of some aggregate decision-making processes. In this article we explore the probability of the thesis predicted by the theorem (if there are enough voters, majority rule is a competent decision procedure) in different settings. We use tools from measure theory to conclude that it will happen almost surely or almost never, depending on the probability measure. In particular, it will fail almost surely for measures estimating the prior probability. To update this prior either more evidence in favor of competence would be needed (so that a large likelihood term compensates a small prior term in Bayes' Theorem) or a modification of the decision rule. The former includes the case of (rational) agents reversing their vote if its probability of voting the right option is less than 1/2. Following the latter, we investigate how to obtain an almost sure competent information aggregation mechanism for almost any evidence on voter competence (including the less favorable ones). To do so, we substitute simple majority rule by weighted majority rule based on some stochastic weights correlated with epistemic rationality such that every voter is guaranteed a minimal weight equal to one. We also explore how to obtain these weights in a real setting., The author would like to thank C. Romaniega for valuable comments which help to improve the manuscript and an anonymous referee for the valuable suggestions. The author is supported by the grant MTM2016-76072-P (MICINN, Spain). This work is supported in part by the ICMAT–Severo Ochoa, Spain grant CEX2019- 000904-S. The author is also a postgraduate fellow of the City Council of Madrid at the Residencia de Estudiantes (2020–2022).