Scheduling jobs of decentralized decision makers that are in competition will usually lead to cost inefficiencies. This cost inefficiency is studied using the Price of Anarchy (PoA), i.e., the ratio between the worst Nash equilibrium cost and the cost attained at the centralized optimum. First,...

Minority reserves are an affirmative action policy proposed by Hafalir et al. (2013) in the context of school choice. We study in the laboratory the effect of minority reserves on the outcomes of two prominent matching mechanisms, the Gale-Shapley and the Top Trading Cycles mechanisms. Our first...

We consider a Cournot oligopoly model where multiple suppliers (oligopolists) compete by choosing quantities. We compare the social welfare achieved at a Cournot equilibrium to the maximum possible, for the case where the inverse market demand function is convex. We establish a lower bound on...

This paper studies competition for shelf space in a multi-supplier retail point. We consider a retailer that seeks to allocate her shelf space to maximize her profit. Because products associated with larger profit margin are granted more shelf space, suppliers can offer the retailer financial...

Der vorliegende Diskussionsbeitrag entstand im Rahmen eines Forschungsprojektes über die monetäre Integration von fünf mittel- und osteuropäischen EU-Beitrittskandidaten (Polen, Tschechische Republik, Ungarn, Slowenien und Estland). Das hier vorgestellte Kapitel geht auf die...

Despite descriptive empirical evidence on start-up numbers and survival rates of young firms, the interaction of market entry decisions and reactions of incumbent competitors is still insufficiently understood in the entrepreneurship literature. Repeated games offer a suitable theoretical...

This paper concerns the asymmetric atomic selfish routing game for load balancing in ring networks. In the selfish routing, each player selects a path in the ring network to route one unit traffic between its source and destination nodes, aiming at a minimum maximum link load along its own path....

We study network formation with <em>n players</em> and link cost <em>α </em> 0. After the network is built, an adversary randomly deletes one link according to a certain probability distribution. Cost for player <em>ν</em> incorporates the expected number of players to which <em>ν</em> will become disconnected. We focus on...</em>