Sciweavers

102 search results - page 15 / 21
» On Acyclicity of Games with Cycles
Sort
View
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
14 years 8 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
SIAMDM
2010
131views more  SIAMDM 2010»
13 years 2 months ago
On Optimal Strategies for a Hat Game on Graphs
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
Uriel Feige
AIED
2005
Springer
14 years 28 days ago
Iterative Evaluation of a Large-Scale, Intelligent Game for Language Learning
Educational content developers, including AIED developers, traditionally make a distinction between formative evaluation and summative evaluation of learning materials. Although th...
W. Lewis Johnson, Carole R. Beal
GECCO
2003
Springer
283views Optimization» more  GECCO 2003»
14 years 17 days ago
A Game-Theoretic Memory Mechanism for Coevolution
One problem associated with coevolutionary algorithms is that of forgetting, where one or more previously acquired traits are lost only to be needed later. We introduce a new coevo...
Sevan G. Ficici, Jordan B. Pollack
COMBINATORICA
2010
13 years 4 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel