Results 61 to 70 of about 125,860 (118)
Perfection and Stability of Stationary Points with Applications in Noncooperative Games [PDF]
It is well known that an upper semi-continuous compact- and convex-valued mapping ö from a nonempty compact and convex set X to the Euclidean space of which X is a subset has at least one stationary point, being a point in X at which the image ö (x)has a
Laan, G. van der +2 more
core +1 more source
Imperfect-Recall Abstractions with Bounds in Games
, 2016 Imperfect-recall abstraction has emerged as the leading paradigm for practical large-scale equilibrium computation in incomplete-information games. However, imperfect-recall abstractions are poorly understood, and only weak algorithm-specific guarantees ...
Kroer, Christian, Sandholm, Tuomas
core +1 more source
Orders of limits for stationary distributions, stochastic dominance, and stochastic stability [PDF]
A population of agents recurrently plays a two-strategy population game. When an agent receives a revision opportunity, he chooses a new strategy using a noisy best response rule that satisfies mild regularity conditions; best response with mutations ...
Sandholm, William H.
core +1 more source
Interface Simulation Distances
, 2012 The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance.
Chmelík, Martin +3 more
core +2 more sources
Default and Punishment in General Equilibrium [PDF]
We extend the standard model of general equilibrium with incomplete markets to allow for default and punishment. The equilibrating variables include expected delivery rates, along with the usual prices of assets and commodities.
John Geanakoplos +2 more
core
Persistence of power: Repeated multilateral bargaining with endogenous agenda setting authority [PDF]
, 2019 We extend a simple repeated, multilateral bargaining model to allow successful agenda setters to hold on to power as long as they maintain the support of a majority of other committee members.
Agranov, Marina +2 more
core
An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism
, 2017 The individualization-refinement paradigm provides a strong toolbox for testing isomorphism of two graphs and indeed, the currently fastest implementations of isomorphism solvers all follow this approach.
Babai László +6 more
core +1 more source
Cooperative Games in Graph Structure [PDF]
By a cooperative game in coalitional structure or shortly coalitional game we mean the standard cooperative non-transferable utility game described by a set of payoffs for each coalition that is a nonempty subset of the grand coalition of all players.It ...
Herings, P.J.J. +2 more
core +1 more source
Game Refinement Theory and Multiplayer Games: Case Study Using UNO
Game Refinement Theory and Multiplayer Games: Case Study Using UNOGame refinement theory has started to provide some interesting tools to measure sophistication of board games, sport games, and video games. In this paper, we apply game refinement theory to UNO(R) card game, from which we identify valuable aspects regarding multiplayer and incomplete information game.
openaire