We consider a network of sellers, each selling a single product, where the graph structure represents pair-wise complementarities between products. We study how the network structure affects revenue and social welfare of equilibria of the pricing game between the sellers. We prove positive and negative results, both of “Price of Anarchy” and of “Price of Stability” type, for simple graphs (line...

We consider non-cooperative unsplittable congestion games where players share resources, and each player’s strategy is pure and consists of a subset of the resources on which it applies a fixed weight. Such games represent unsplittable routing flow games and also job allocation games. The congestion of a resource is the sum of the weights of the players that use it and the player’s cost functio...

In this paper, we study two models of resource allocation games: the classical load balancing game and its new variant involving resource activation costs. The resources we consider are identical and the social costs of the games are utilitarian, which are the average of all individual players’ costs. Using the social costs we assess the quality of pure Nash equilibria in terms of the price of ...

Garing et al [3] is the first paper in which Bayesian Nash equilibrium is treated. They analysis Bayesian extension of routing game specified by the type-space model of Harsanyi [4] as information structure, and they collected several results: (1) the existence and computability of pure Nash equilibrium, (2) the property of the set of fully mixes Bayesian Nash equilibria and (3) the upper bound...

The comparative approach regarding the ethics of surrogacy from the Western secular and Islamic bioethical view reveals both commensurable and incommensurable relationship. Both are eager to achieve the welfare of the mother, child and society as a whole but the approaches are not always the same. Islamic bioethics is straightforward in prohibiting surrogacy by highlighting the lineage problem ...

This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifies how well subsets of agents respond to their environments. We then show several methods of bounding the global price of anarchy of a game in terms of the local price of anarchy. All our bounds are essentially tight.

We introduce and study a congestion game having max sat as an underlying structure and show that its price of anarchy is 1/2. The main result is a redesign of the game leading to an improved price of anarchy of 2/3 from which we derive a non oblivious local search algorithm for max sat with locality gap 2/3. A similar congestion min sat game is also studied. keywords: price of anarchy, non obli...

Social choice theory is concerned with collective decision making under different, possibly contrasting opinions and has been part of the core of society since ancient times. The goal is to implement some socially desired objective while at the same time accounting for the fact that people will act strategically, in order to manipulate the outcomes in their favor. In this thesis, we consider th...