Taquilla urbana

Proposta presentada al Concurso internacional de ideas sobre un entorno urbano con perspectiva de género

Centre de referència de la meteorologia de Catalunya a la muntanya del "Turó de l’Home", Barcelona

Award-winning

Biblioteca Municipal als Barris de Canyadó i Casagemes, Badalona

Award-winning

Això no costa res

Postprint (published version)

Parc de la Prehistòria Sis a Sidi Abderrahmane

Award-winning

Cruïlla 0

Postprint (published version)

Ciutat de Xamfrans

Postprint (published version)

Tres cartes

Postprint (published version)

Moral Hazard in Repeated Procurement of Services

This paper analyzes repeated procurement of services as a four-stage game divided into two periods. In each period there is (1) a contest stage à la Tullock in which the principal selects an agent and (2) a service stage in which the selected agent provides a service. Since this service effort is non-verifiable, the principal faces a moral hazard problem at the service stages. This work considers how the principal should design the period-two contest to mitigate the moral hazard problem in the period-one service stage and to maximize total service and contest efforts. It is shown that the principal must take account of the agent's past service effort in the period-two contest success function. The results indicate that the optimal way to introduce this `bias' is to choose a certain degree of complementarity between past service and current contest efforts. This result shows that contests with `additive bias' (`multiplicative bias') are optimal in incentive problems when effort cost is low (high). Furthermore, it is shown that the severity of the moral hazard problem increases with the cost of service effort (compared to the cost of contest effort) and the number of agents. Finally, the results are extended to more general contest success functions. JEL classification: C72; D82 Key words: Biased contests; Moral Hazard; Repeated Game; Incentives.

How hard is a commercial puzzle: the eternity II challenge

Recently, edge matching puzzles, an NP-complete problem, have received, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.

Edge matching puzzles as hard SAT/CSP benchmarks

Recently, edge matching puzzles, an NP-complete problem, have rececived, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.

Oficines Heineken

Award-winning

Arcàdia

Postprint (published version)

UMBRA

Postprint (published version)

Llum dins la Capsa

Postprint (published version)