5,147 research outputs found
Social Dilemmas and Cooperation in Complex Networks
In this paper we extend the investigation of cooperation in some classical
evolutionary games on populations were the network of interactions among
individuals is of the scale-free type. We show that the update rule, the payoff
computation and, to some extent the timing of the operations, have a marked
influence on the transient dynamics and on the amount of cooperation that can
be established at equilibrium. We also study the dynamical behavior of the
populations and their evolutionary stability.Comment: 12 pages, 7 figures. to appea
Hawks and Doves on Small-World Networks
We explore the Hawk-Dove game on networks with topologies ranging from
regular lattices to random graphs with small-world networks in between. This is
done by means of computer simulations using several update rules for the
population evolutionary dynamics. We find the overall result that cooperation
is sometimes inhibited and sometimes enhanced in those network structures, with
respect to the mixing population case. The differences are due to different
update rules and depend on the gain-to-cost ratio. We analyse and qualitatively
explain this behavior by using local topological arguments.Comment: 12 pages, 8 figure
VNect: Real-time 3D Human Pose Estimation with a Single RGB Camera
We present the first real-time method to capture the full global 3D skeletal
pose of a human in a stable, temporally consistent manner using a single RGB
camera. Our method combines a new convolutional neural network (CNN) based pose
regressor with kinematic skeleton fitting. Our novel fully-convolutional pose
formulation regresses 2D and 3D joint positions jointly in real time and does
not require tightly cropped input frames. A real-time kinematic skeleton
fitting method uses the CNN output to yield temporally stable 3D global pose
reconstructions on the basis of a coherent kinematic skeleton. This makes our
approach the first monocular RGB method usable in real-time applications such
as 3D character control---thus far, the only monocular methods for such
applications employed specialized RGB-D cameras. Our method's accuracy is
quantitatively on par with the best offline 3D monocular RGB pose estimation
methods. Our results are qualitatively comparable to, and sometimes better
than, results from monocular RGB-D approaches, such as the Kinect. However, we
show that our approach is more broadly applicable than RGB-D solutions, i.e. it
works for outdoor scenes, community videos, and low quality commodity RGB
cameras.Comment: Accepted to SIGGRAPH 201
Learning Cooperative Games
This paper explores a PAC (probably approximately correct) learning model in
cooperative games. Specifically, we are given random samples of coalitions
and their values, taken from some unknown cooperative game; can we predict the
values of unseen coalitions? We study the PAC learnability of several
well-known classes of cooperative games, such as network flow games, threshold
task games, and induced subgraph games. We also establish a novel connection
between PAC learnability and core stability: for games that are efficiently
learnable, it is possible to find payoff divisions that are likely to be stable
using a polynomial number of samples.Comment: accepted to IJCAI 201
Forming Probably Stable Communities with Limited Interactions
A community needs to be partitioned into disjoint groups; each community
member has an underlying preference over the groups that they would want to be
a member of. We are interested in finding a stable community structure: one
where no subset of members wants to deviate from the current structure. We
model this setting as a hedonic game, where players are connected by an
underlying interaction network, and can only consider joining groups that are
connected subgraphs of the underlying graph. We analyze the relation between
network structure, and one's capability to infer statistically stable (also
known as PAC stable) player partitions from data. We show that when the
interaction network is a forest, one can efficiently infer PAC stable coalition
structures. Furthermore, when the underlying interaction graph is not a forest,
efficient PAC stabilizability is no longer achievable. Thus, our results
completely characterize when one can leverage the underlying graph structure in
order to compute PAC stable outcomes for hedonic games. Finally, given an
unknown underlying interaction network, we show that it is NP-hard to decide
whether there exists a forest consistent with data samples from the network.Comment: 11 pages, full version of accepted AAAI-19 pape
Connectivity and equilibrium in random games
We study how the structure of the interaction graph of a game affects the
existence of pure Nash equilibria. In particular, for a fixed interaction
graph, we are interested in whether there are pure Nash equilibria arising when
random utility tables are assigned to the players. We provide conditions for
the structure of the graph under which equilibria are likely to exist and
complementary conditions which make the existence of equilibria highly
unlikely. Our results have immediate implications for many deterministic graphs
and generalize known results for random games on the complete graph. In
particular, our results imply that the probability that bounded degree graphs
have pure Nash equilibria is exponentially small in the size of the graph and
yield a simple algorithm that finds small nonexistence certificates for a large
family of graphs. Then we show that in any strongly connected graph of n
vertices with expansion the distribution of the number
of equilibria approaches the Poisson distribution with parameter 1,
asymptotically as .Comment: Published in at http://dx.doi.org/10.1214/10-AAP715 the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
- …