In this paper, we study the formation of endogenous social storage cloud in a dynamic setting, where rational agents build their data backup connections strategically. We propose a degree-distance-based utility model, which is a combination of benefit and cost functions. The benefit function of...

A new model of strategic networking is developed and analyzed, where an agent’s investment in links is nonspecific. The model comprises a large class of games which are both potential and super- or submodular games. We obtain comparative statics results for Nash equilibria with respect to...

In this paper, we study the formation of endogenous social storage cloud in a dynamic setting, where rational agents build their data backup connections strategically. We propose a degree-distance-based utility model, which is a combination of benefit and cost functions. The benefit function of...

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

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

We present a model where each of two players chooses between remuneration based on either private or team effort. Although at least one of the players has the equilibrium strategy to choose private remuneration, we frequently observe both players to choose team remuneration in a series of...

In this paper, we study the Nash implementation in an allocation problem with single-dipped preferences. We show that, with at least three agents, Maskin monotonicity is necessary and sufficient for implementation. We examine the implementability of various social choice correspondences (SCCs)...

The paper presents a complete information model of bidding in second price sealed-bid and ascending-bid (English) auctions, in which potential buyers know the unit valuation of other bidders and may spitefully prefer that their rivals earn a lower surplus. Bidders with spiteful preferences...

In an incomplete information setting, we analyze the sealed bid auction proposed by Knaster (cf. Steinhaus (1948)). This procedure was designed to efficiently and fairly allocate multiple indivisible items when participants report their valuations truthfully. In equilibrium, players do not...

This paper deals with the effects of different modes of communication in a costless information transmission environment with multiple senders. To this aim, we present a theoretical and experimental study of three Cheap Talk games, each having two senders and one receiver. The communication of...