In the classical cake-cutting problem, strategy-proofness is a very costly requirement in terms of fairness: for n=2 it implies a dictatorial allocation, whereas for n ≥ 3 it implies that one agent receives no…
Using two lab experiments, we investigate the real-life performance of envy-free and proportional cake-cutting procedures with respect to fairness and preference manipulation. Although the observed subjects'…
We study mechanism design with flexible but costly information acquisition. There is a principal and four or more agents, sharing a common prior over the set of payoff-relevant states. The principal proposes a…
Die Energiewende steht ganz oben auf der politischen Agenda. Stand jetzt ist es aber mehr als ungewiss, ob die Politik auch ihre ambitionierten Ausbauziele erreicht. Auf der Angebotsseite, aber auch beim…
In auctions bidders are usually assumed to have rational expectations with regards to their winning probability. However, experimental and empirical evidence suggests that agent's expectations depend on direct…
This paper proposes a game-theoretic model to analyze the strategic behavior of inc-dec gaming in market-based congestion management (redispatch). We extend existing models by considering incomplete information…
Although blockchain technology and cryptocurrencies have grown in popularity over the past years, there does not seem to be a consensus if they bring any value to economic interactions. In this paper, I argue…
