An uninformed sender designs a mechanism that discloses information about her type to a privately informed receiver, who then decides whether to act. I impose a single-crossing assumption, so that the receiver with a higher type is more willing to act. Using a linear programming approach, I...

We explore reinforcement learning methods for finding the optimal policy in the linear quadratic regulator (LQR) problem. In particular we consider the convergence of policy gradient methods in the setting of known and unknown parameters. We are able to produce a global linear convergence...

We consider a “tenure-clock problem” in which a principal may set a deadline by which she needs to evaluate an agent's ability and decides whether to promote him or not. We embed this problem in a continuous-time model with both hidden action and hidden information, where the principal must...

We study divisor methods, the primary class to solve apportionment problems, based upon Stolarsky means S(alphabeta). These encompass the five traditional methods. We disclose a one-to-one relation between methods of the form S(alpha1) and aggregate measures of seat/vote disproportionality of...

Purpose: To estimate the transition rates corresponding to the 2010 and 2012 elections to the Catalan Parliament for the four constituencies in which Catalonia is divided for this purpose. The main features of the results, which are obtained by means of mathematical programming, are commented....

For any linear transformation and two convex closed sets, we provide necessary and sufficient conditions for when the transformation of the intersection of the sets coincides with the intersection of their images. We also identify analogous conditions for non-convex sets, general...