Sciweavers

60 search results - page 3 / 12
» Gaming on the edge: using seams in ubicomp games
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 1 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
DIGRA
2005
Springer
13 years 11 months ago
Early Games Production in New Zealand
This illustrated paper reports on the early digital games industry in New Zealand, during the late 1970s and 80s. It presents an overview of this largely unknown history, drawing ...
Melanie Swalwell
ICALP
2010
Springer
13 years 8 months ago
The Cooperative Game Theory Foundations of Network Bargaining Games
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, ...
TCS
2008
13 years 6 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...
TCS
2008
13 years 6 months ago
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Genev...