Some remarks on the class of continuous (Semi-) strictcly quasiconvex functions

Vegeu el resum a l'inici del document del fitxer adjunt

Elicited bid functions in (a)symmetric first-price auctions

We report on a series of experiments that examine bidding behavior in first-price sealed bid auctions with symmetric and asymmetric bidders. To study the extent of strategic behavior, we use an experimental design that elicits bidders' complete bid functions in each round (auction) of the experiment. In the aggregate, behavior is consistent with the basic equilibrium predictions for risk neutral or homogenous risk averse bidders (extent of bid shading, average seller's revenues and deviations from equilibrium). However, when we look at the extent of best reply behavior and the shape of bid functions, we find that individual behavior is not in line with the received equilibrium models, although it exhibits strategic sophistication.

A mixed finite element method for nonlinear diffusion equations

We propose a mixed finite element method for a class of nonlinear diffusion equations, which is based on their interpretation as gradient flows in optimal transportation metrics. We introduce an appropriate linearization of the optimal transport problem, which leads to a mixed symmetric formulation. This formulation preserves the maximum principle in case of the semi-discrete scheme as well as the fully discrete scheme for a certain class of problems. In addition solutions of the mixed formulation maintain exponential convergence in the relative entropy towards the steady state in case of a nonlinear Fokker-Planck equation with uniformly convex potential. We demonstrate the behavior of the proposed scheme with 2D simulations of the porous medium equations and blow-up questions in the Patlak-Keller-Segel model.

Symmetric planar central configurations of five bodies: Euler plus two

We study planar central configurations of the five-body problem where three of the bodies are collinear, forming an Euler central configuration of the three-body problem, and the two other bodies together with the collinear configuration are in the same plane. The problem considered here assumes certain symmetries. From the three bodies in the collinear configuration, the two bodies at the extremities have equal masses and the third one is at the middle point between the two. The fourth and fifth bodies are placed in a symmetric way: either with respect to the line containing the three bodies, or with respect to the middle body in the collinear configuration, or with respect to the perpendicular bisector of the segment containing the three bodies. The possible stacked five-body central configurations satisfying these types of symmetries are: a rhombus with four masses at the vertices and a fifth mass in the center, and a trapezoid with four masses at the vertices and a fifth mass at the midpoint of one of the parallel sides.

On Strategy-proofness and symmetric single-peakedness

We characterize the class of strategy-proof social choice functions on the domain of symmetric single-peaked preferences. This class is strictly larger than the set of generalized median voter schemes (the class of strategy-proof and tops-only social choice functions on the domain of single-peaked preferences characterized by Moulin (1980)) since, under the domain of symmetric single-peaked preferences, generalized median voter schemes can be disturbed by discontinuity points and remain strategy-proof on the smaller domain. Our result identifies the specific nature of these discontinuities which allow to design non-onto social choice functions to deal with feasibility constraints.

Integral formulae for a Riemannian manifold with a distribution

We obtain a new series of integral formulae for symmetric functions of curvature of a distribution of arbitrary codimension (an its orthogonal complement) given on a compact Riemannian manifold, which start from known formula by P.Walczak (1990) and generalize ones for foliations by several authors: Asimov (1978), Brito, Langevin and Rosenberg (1981), Brito and Naveira (2000), Andrzejewski and Walczak (2010), etc. Our integral formulae involve the co-nullity tensor, certain component of the curvature tensor and their products. The formulae also deal with a number of arbitrary functions depending on the scalar invariants of the co-nullity tensor. For foliated manifolds of constant curvature the obtained formulae give us the classical type formulae. For a special choice of functions our formulae reduce to ones with Newton transformations of the co-nullity tensor.

A model structure for coloured operads in symmetric spectra

We describe a model structure for coloured operads with values in the category of symmetric spectra (with the positive model structure), in which fibrations and weak equivalences are defined at the level of the underlying collections. This allows us to treat R-module spectra (where R is a cofibrant ring spectrum) as algebras over a cofibrant spectrum-valued operad with R as its first term. Using this model structure, we give sufficient conditions for homotopical localizations in the category of symmetric spectra to preserve module structures.

Generic optimality conditions for semi-algebraic convex programs

We consider linear optimization over a nonempty convex semi-algebraic feasible region F. Semidefinite programming is an example. If F is compact, then for almost every linear objective there is a unique optimal solution, lying on a unique \active" manifold, around which F is \partly smooth", and the second-order sufficient conditions hold. Perturbing the objective results in smooth variation of the optimal solution. The active manifold consists, locally, of these perturbed optimal solutions; it is independent of the representation of F, and is eventually identified by a variety of iterative algorithms such as proximal and projected gradient schemes. These results extend to unbounded sets F.

An algorithm for semi-infinite polynomial optimization

"Vegeu el resum a l'inici del document del fitxer adjunt."

Discrete time Non-homogeneous Semi-Markov Processes applied to Models for Disability Insurance

In this paper, we present a stochastic model for disability insurance contracts. The model is based on a discrete time non-homogeneous semi-Markov process (DTNHSMP) to which the backward recurrence time process is introduced. This permits a more exhaustive study of disability evolution and a more efficient approach to the duration problem. The use of semi-Markov reward processes facilitates the possibility of deriving equations of the prospective and retrospective mathematical reserves. The model is applied to a sample of contracts drawn at random from a mutual insurance company.

Semi-online neural-Q_leaming for real-time robot learning

Reinforcement learning (RL) is a very suitable technique for robot learning, as it can learn in unknown environments and in real-time computation. The main difficulties in adapting classic RL algorithms to robotic systems are the generalization problem and the correct observation of the Markovian state. This paper attempts to solve the generalization problem by proposing the semi-online neural-Q_learning algorithm (SONQL). The algorithm uses the classic Q_learning technique with two modifications. First, a neural network (NN) approximates the Q_function allowing the use of continuous states and actions. Second, a database of the most representative learning samples accelerates and stabilizes the convergence. The term semi-online is referred to the fact that the algorithm uses the current but also past learning samples. However, the algorithm is able to learn in real-time while the robot is interacting with the environment. The paper shows simulated results with the "mountain-car" benchmark and, also, real results with an underwater robot in a target following behavior

Generació semi-automàtica de façanes procedurals

L’objectiu d’aquest PFC és desenvolupar una eina d’edició de façanes procedural apartir d’una imatge d’una façana real. L’aplicació generarà les regles procedurals de lafaçana a partir de dades adquirides del model que es vol representar, com unafotografia. L’usuari de l’aplicació generarà de forma semi-automàtica i interactiva lesregles de subdivisió i repetició, especificant també la inserció de elementsarquitectònics (portes, finestres), que podran ser instanciats a partir d’una llibreria. Uncop generades, les regles s’escriuran en el format del sistema BuildingEngine perintegrar-se completament dins el procés de modelatge urbà.Aquest projecte es desenvoluparà en Matlab