The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
—We consider a cognitive radio network with distributed multiple secondary users, where each user independently searches for spectrum opportunities in multiple channels without e...
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
Abstract. In this chapter we survey the most recent proposals for modelling user mobility in mobile pervasive networks, and specifically in opportunistic networks. We identify two...
Agent-based approaches to manufacturing scheduling and control have gained increasing attention in recent years. Such approaches are attractive because they o er increased robustn...