Results 1 to 10 of about 14,372 (94)
Efficient computation of the Shapley value for game-theoretic network centrality [PDF]
, 2013 The Shapley value—probably the most important normative payoff division scheme in coalitional games—has recently been advocated as a useful measure of centrality in networks.
Aaditha, K. V. +4 more
core +3 more sources
Game theoretic controller synthesis for multi-robot motion planning Part I : Trajectory based algorithms [PDF]
, 2014 We consider a class of multi-robot motion planning problems where each robot is associated with multiple objectives and decoupled task specifications. The problems are formulated as an open-loop non-cooperative differential game.
Chaudhari, Pratik +3 more
core +1 more source
, 2013 This paper concerns the analysis of the Shapley value in matching games. Matching games constitute a fundamental class of cooperative games which help understand and model auctions and assignments. In a matching game, the value of a coalition of vertices
Aziz, Haris, de Keijzer, Bart
core +2 more sources
Packing a bin online to maximize the total number of items [PDF]
, 1996 A bin of capacity 1 and a nite sequence of items of\ud sizes a1; a2; : : : are considered, where the items are given one by one\ud without information about the future.
Faigle, Ulrich, Kern, Walter
core +3 more sources
Solving Parity Games in Scala [PDF]
, 2015 Parity games are two-player games, played on directed graphs, whose nodes are labeled with priorities. Along a play, the maximal priority occurring infinitely often determines the winner.
Aniello, Murano +3 more
core +1 more source
The Price of Anarchy for Network Formation in an Adversary Model [PDF]
, 2011 We study network formation with n players and link cost \alpha > 0. After the network is built, an adversary randomly deletes one link according to a certain probability distribution. Cost for player v incorporates the expected number of players to which
Kliemann, Lasse
core +4 more sources
Undirected Graphs of Entanglement Two [PDF]
, 2007 Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems.
A. Arnold +16 more
core +6 more sources
A Comprehensive Survey of Potential Game Approaches to Wireless Networks [PDF]
, 2015 Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a ...
Yamamoto, Koji
core +2 more sources
On the Sample Complexity of Learning Graphical Games
, 2017 We analyze the sample complexity of learning graphical games from purely behavioral data. We assume that we can only observe the players' joint actions and not their payoffs.
Honorio, Jean
core +1 more source
On the Structure of Equilibria in Basic Network Formation [PDF]
, 2013 We study network connection games where the nodes of a network perform edge swaps in order to improve their communication costs. For the model proposed by Alon et al.
D. Monderer +8 more
core +1 more source