There is a broad literature on distributed card games over communications networks, collectively known as mental poker. Like in any distributed protocol, avoiding the need for a Tr...
— We consider a scenario where an application service provider (ASP) hires a network service provider (NSP) to deliver its service and pays for the employment of the NSP. We stud...
Although TD-Gammon is one of the major successes in machine learning, it has not led to similar impressive breakthroughs in temporal difference learning for other applications or ...
Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movement: A collection of anonymous ...
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...