This paper studies optimal task assignments in a setting where agents are expectation-based loss averse according to KoszegiRabin (2006) and KoszegiRabin (2007) and are compensated according to an aggregated performance measure in which tasks are technologically independent. We show that the...

We present a new way to solve generalized Nash equilibrium problems. We assume the feasible set to be compact. Furthermore all functions are assumed to be polynomials. However we do not need any convexity assumptions on either the utility functions or the action sets. The key idea is to use...

Conventional data envelopment analysis (DEA) for measuring the relative efficiency of a set of decision-making units (DMUs) requires the observations to have precise values. When observations are imprecise and represented by interval values, the efficiencies are also expected to reflect interval...

The sum of a supermodular function, assumed nondecreasing in the choice variable, and of a 'concavely supermodularizable' function, assumed nonincreasing in the parameter variable, satisfies the Milgrom- Shannon (1994, Monotone comparative statics, Econometrica 62, 157-180) single crossing...

We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...

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...

This paper studies a general class of time-inconsistent stochastic control problems under ambiguous covariance matrix. The time-inconsistency is caused in various ways by a general objective functional and thus the associated control problem does not admit Bellman's principle of optimality....

We describe a 3-person, 2-cut envy-free cake-cutting algorithm, inspired by a continuous moving-knife procedure, that does not require that the players continuously move knifes across the cake. By having the players submit their value functions over the cake to a referee—rather than move...

Algorithms play an increasingly important role in economic situations. Often these situations are strategic, where the artificial intelligence may or may not be cooperative. We study the determinants and forms of algorithmic cooperation in the infinitely repeated prisoner's dilemma. We run a...

Purpose: We aim to generalize the continuous-time principal-agent problem to incorporate time-inconsistent utility functions, such as those of mean-variance type, which are prevalent in risk management and finance. Design/methodology/approach: We use recent advancements of the Pontryagin maximum...