Juan A. Rodríguez-Aguilar

Learn More
The allocation of resources within a system of autonomous agents, that not only have preferences over alternative allocations of resources but also actively participate in computing an allocation, is an exciting area of research at the interface of Computer Science and Economics. This paper is a survey of some of the most salient issues in Multiagent(More)
The design and development of open multi-agent systems (MAS) is a key aspect in agent research. We advocate that they can be realised as electronic institutions. In this paper we focus on the execution of electronic institutions by introducing AMELI, an infrastructure that mediates agentsý interactions while enforcing institutional rules. An innovative(More)
A combinatorial auction (CA) is an auction where bidders can buy (or sell) entire bundles of goods in a single transaction. Although computationally very complex, selling items in bundles has the great advantage of eliminating the risk for a bidder of not being able to obtain complementary items at a reasonable price in a follow-up auction (think of a(More)
Nowadays, with the expansion of Internet, there is a need of methodologies and software tools to ease the development of applications where distributed homogeneous entities can participate. Multiagent systems, and electronic institutions in particular , can play a main role on the development of this type of systems. Electronic institutions define the rules(More)
This paper addresses a simple but critical question: how can we create robust multi-agent systems out of the often unreliable agents and infrastructures we can expect to find in open systems contexts? We propose an approach to this problem based on distinct exception handling (EH) services that enact coordination protocol-specific but domain-independent(More)
In this paper we propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the generalized distributive law (GDL) to efficiently solve DCOPs. Action-GDL provides a unifying perspective of several dynamic programming DCOP algorithms that are based on GDL, such as DPOP and DCPOP algorithms. We empirically show how Action-GDL(More)
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinate (DaC) approach. Such approach amounts to solving a DCOP by iterating (1) a divide stage in which agents divide the DCOP into a set of simpler local subproblems and solve them;(More)
Ideally, open multi-agent systems (MAS) involve heterogeneous and autonomous agents whose interactions ought to conform to some shared conventions. The challenge is how to express and enforce such conditions so that truly autonomous agents can adscribe to them. One way of addressing this issue is to look at MAS as environments regulated by some sort of(More)
We introduce Normative Temporal Logic (NTL), a logic for reasoning about normative systems. NTL is a generalisation of the well-known branching-time temporal logic CTL, in which the path quan-tifiers A (" on all paths.. . ") and E (" on some path.. . ") are replaced by the indexed deontic operators O η and P η , where for example O η ϕ means " ϕ is(More)