Payoff-dependent balancedness and cores (revised version)

We prove the non-emptiness of the core of an NTU game satisfying a condition of payoff-dependent balancedness, based on transfer rate mappings. We also define a new equilibrium condition on transfer rates and we prove the existence of core payoff vectors satisfying this condition. The additional requirement of transfer rate equilibrium refines the core concept and allows the selection of specific core payoff vectors. Lastly, the class of parametrized cooperative games is introduced. This new setting and its associated equilibrium-core solution extend the usual cooperative game framework and core solution to situations depending on an exogenous environment. A non-emptiness result for the equilibrium-core is also provided in the context of a parametrized cooperative game. Our proofs borrow mathematical tools and geometric constructions from general equilibrium theory with non convexities. Applications to extant results taken from game theory and economic theory are given.

Inverse problems for invariant algebraic curves: explicit computations

Given an algebraic curve in the complex affine plane, we describe how to determine all planar polynomial vector fields which leave this curve invariant. If all (finite) singular points of the curve are nondegenerate, we give an explicit expression for these vector fields. In the general setting we provide an algorithmic approach, and as an alternative we discuss sigma processes.

Quantum symmetries for exceptional SU(4) modular invariants associated with conformal embeddings

Three exceptional modular invariants of SU(4) exist at levels 4, 6 and 8. They can be obtained from appropriate conformal embeddings and the corresponding graphs have self-fusion. From these embeddings, or from their associated modular invariants, we determine the algebras of quantum symmetries, obtain their generators,and, as a by-product, recover the known graphs E4, E6 and E8 describing exceptional quantum subgroups of type SU(4). We also obtain characteristic numbers (quantum cardinalities, dimensions) for each of them and for their associated quantum groupoïds.

Positive solutions of nonlinear problems involving the square root of the Laplacian

We consider nonlinear elliptic problems involving a nonlocal operator: the square root of the Laplacian in a bounded domain with zero Dirichlet boundary conditions. For positive solutions to problems with power nonlinearities, we establish existence and regularity results, as well as a priori estimates of Gidas-Spruck type. In addition, among other results, we prove a symmetry theorem of Gidas-Ni-Nirenberg type.

The Commons and anti-commons problems in the tourism economy

Countries specialised in tourism tend to face two problems with contradictory effects: the commons and the anti-commons, which lead to tourism over- and under-production, respectively. This paper develops a two-period model to analyse the joint effects of both problems on a small and remote tourism economy. Congestion and the complementariness between foreign transport and local tourism services are key features in this type of markets. As a result, direct selling and the presence of foreign tour-operators emerge as possible market arrangements with different implications in terms of welfare and public intervention. Four main results are obtained. First, in the direct selling situation the optimal policy depends on the relative importance of the problems. Second, the existence of tour-operators always leads to tourism over-production. Third, the presence of a single tour-operator does not solve the congestion problem. Lastly, the switch from several tour-operators to a single one is welfare reducing.

Some variational problems from image processing

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

The analysis of approximate quickselect and related problems

Approximate Quickselect, a simple modification of the well known Quickselect algorithm for selection, can be used to efficiently find an element with rank k in a given range [i..j], out of n given elements. We study basic cost measures of Approximate Quickselect by computing exact and asymptotic results for the expected number of passes, comparisons and data moves during the execution of this algorithm. The key element appearing in the analysis of Approximate Quickselect is a trivariate recurrence that we solve in full generality. The general solution of the recurrence proves to be very useful, as it allows us to tackle several related problems, besides the analysis that originally motivated us. In particular, we have been able to carry out a precise analysis of the expected number of moves of the ith element when selecting the jth smallest element with standard Quickselect, where we are able to give both exact and asymptotic results. Moreover, we can apply our general results to obtain exact and asymptotic results for several parameters in binary search trees, namely the expected number of common ancestors of the nodes with rank i and j, the expected size of the subtree rooted at the least common ancestor of the nodes with rank i and j, and the expected distance between the nodes of ranks i and j.