Sciweavers

449 search results - page 83 / 90
» Cooperative Boolean games
Sort
View
ML
2006
ACM
113views Machine Learning» more  ML 2006»
13 years 7 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
IJNSEC
2007
144views more  IJNSEC 2007»
13 years 7 months ago
IPLess Stochastic Anonymous Routing Algorithm Using Multi-Agent Systems
The ability of communicating with a selected party anonymously is an important aspect of network security. Communicating anonymously means that no adversary can discern who is com...
Magdy Saeb, Meer Hamza, Ahmed El-Shikh
INFOCOM
2010
IEEE
13 years 6 months ago
Fair Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles
—We consider the problem of ’fair’ scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking d...
Veeraruna Kavitha, Eitan Altman, Rachid El Azouzi,...
CORR
2011
Springer
230views Education» more  CORR 2011»
13 years 2 months ago
Computational Rationalization: The Inverse Equilibrium Problem
Modeling the behavior of imperfect agents from a small number of observations is a difficult, but important task. In the singleagent decision-theoretic setting, inverse optimal co...
Kevin Waugh, Brian Ziebart, J. Andrew Bagnell
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 2 months ago
Designing Incentive Schemes Based on Intervention: The Case of Imperfect Monitoring
In this paper, we propose a class of incentive schemes based on intervention. We develop a general game-theoretic framework for the design of intervention schemes under imperfect m...
Jaeok Park, Mihaela van der Schaar