Sciweavers

344 search results - page 44 / 69
» Banach-Mazur Games on Graphs
Sort
View
CSJM
2006
81views more  CSJM 2006»
13 years 8 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
LCC
1994
248views Algorithms» more  LCC 1994»
14 years 23 days ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
TCS
2008
13 years 8 months ago
Game chromatic index of graphs with given restrictions on degrees
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg...
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 14 days ago
Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge
— This paper describes the winning entry to the IJCNN 2011 Social Network Challenge run by Kaggle.com. The goal of the contest was to promote research on realworld link predictio...
Arvind Narayanan, Elaine Shi, Benjamin I. P. Rubin...
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 7 days ago
On the Windfall and Price of Friendship: Inoculation Strategies on Social Networks
This article investigates selfish behavior in games where players are embedded in a social context. A framework is presented which allows us to measure the Windfall of Friendship...
Dominic Meier, Yvonne Anne Pignolet, Stefan Schmid...