Showing 1 - 10 of 12
Persistent link: https://www.econbiz.de/10011593386
Persistent link: https://www.econbiz.de/10012174464
Persistent link: https://www.econbiz.de/10012288383
Persistent link: https://www.econbiz.de/10013365846
We consider the following abstraction of competing publications. There are n players in the game. Each player i chooses a point xi in the interval [0,1], and a player's payoff is the distance from its point xi to the next larger point, or to 1 if xi is the largest. For this game, we give a...
Persistent link: https://www.econbiz.de/10005413940
Persistent link: https://www.econbiz.de/10012172308
A strong equilibrium is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy (SPoA) to be the ratio of the worst strong equilibrium to the social optimum. Differently from the Price of Anarchy (defined as the ratio of the worst Nash...
Persistent link: https://www.econbiz.de/10005409394
AbstractWe study the question of how long it takes players to reach a Nash equilibrium in uncoupled setups, where each player initially knows only his own payoff function. We derive lower bounds on the communication complexity of reaching a Nash equilibrium, i.e., on the number of bits that need...
Persistent link: https://www.econbiz.de/10011206487
We study a novel mechanism design model in which agents each arrive sequentially and choose one action from a set of actions with unknown rewards. The information revealed by the principal affects the incentives of the agents to explore and generate new information. We characterize the optimal...
Persistent link: https://www.econbiz.de/10011010624
We study network games in which each player wishes to connect his source and sink, and the cost of each edge is shared among its users either equally (in Fair Connection Games--FCG's) or arbitrarily (in General Connection Games--GCG's). We study the existence and quality of strong equilibria...
Persistent link: https://www.econbiz.de/10005066700