Sciweavers

94 search results - page 2 / 19
» Non-clairvoyant Scheduling Games
Sort
View
VMCAI
2009
Springer
14 years 12 days ago
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability r...
Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
IDC
2009
Springer
14 years 6 days ago
Cost of Cooperation for Scheduling Meetings
Scheduling meetings among agents can be represented as a game - the Meetings Scheduling Game (MSG). In its simplest form, the two-person MSG is shown to have a price of anarchy (Po...
Alon Grubshtein, Amnon Meisels
SOFSEM
2009
Springer
14 years 2 months ago
Epistemic Strategies and Games on Concurrent Processes
We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the int...
Konstantinos Chatzikokolakis, Sophia Knight, Praka...
NETGAMES
2005
ACM
13 years 11 months ago
Patch scheduling for on-line games
One of the challenges facing the on-line gaming community is the delivery of new content to players. While the initial distribution of a game is typically done via large media for...
Chris Chambers, Wu-chang Feng
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 5 days ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang