Sciweavers

35 search results - page 3 / 7
» Routing games with an unknown set of active players
Sort
View
ISPAN
2008
IEEE
14 years 1 months ago
An Expedite State Dissemination Mechanism for MMOGs
Massively Multiuser Online Game, i.e. MMOG, is an active research especially to integrate players to perform routing task with the intention of keeping the game deployment cost to...
Dewan Tanvir Ahmed, Shervin Shirmohammadi
ESA
2007
Springer
120views Algorithms» more  ESA 2007»
14 years 1 months ago
Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation
Abstract. In this paper we consider Nash Equilibria for the selfish routing model proposed in [12], where a set of n users with tasks of different size try to access m parallel l...
Petra Berenbrink, Oliver Schulte
ALT
2009
Springer
14 years 4 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
JUCS
2008
281views more  JUCS 2008»
13 years 7 months ago
Creating Adaptive e-Learning Board Games for School Settings Using the ELG Environment
: The use of digital games in education is well documented in the literature. They have been used in preschool, K-12, the university. A specific type of digital games is board game...
Symeon Retalis
ICTAI
2008
IEEE
14 years 1 months ago
A Model for Multiple Outcomes Games
We introduce and study qualitative multiple outcomes games. These games are noncooperative games with qualitative utilities (i.e., values over an ordinal scale), strictly qualitat...
Ramzi Ben Larbi, Sébastien Konieczny, Pierr...