- document
-
Planken, L.R. (author), De Weerdt, M.M. (author), Yorke-Smith, N. (author)Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constraints are added and existing constraints may be tightened; the consistency of the whole temporal network is frequently checked; and results of constraint propagation...conference paper 2010
- document
-
Planken, L.R. (author), De Weerdt, M.M. (author), Witteveen, C. (author)When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents may lose some flexibility, but their course of action will be more predictable and often also more efficient, obtaining a socially optimal outcome instead of a local...conference paper 2010
- document
- Wu, M. (author), De Weerdt, M.M. (author), La Poutré, H. (author), Yadati, C. (author), Zhang, Y. (author), Witteveen, C. (author) conference paper 2009
- document
-
Hindriks, K.V. (author), Tykhonov, D. (author), De Weerdt, M.M. (author)Some auction mechanisms can be shown to be efficient and strategy-proof. However, they generally require that the preferences of at least one side of the auction are publicly known. However, sometimes it is very costly, impossible, or undesirable to publicly announce such preferences. It thus is interesting to find methods that do not impose...conference paper 2009
- document
-
Zhang, Y. (author), De Weerdt, M.M. (author)When information or control in a multiagent system is private to the agents, they may misreport this information or refuse to execute an agreed outcome, in order to change the resulting end state of such a system to their benefit. This may result in execution failures. When only information is private, mechanisms such as VCG use payments to...conference paper 2009
- document
-
Harrenstein, B.P. (author), De Weerdt, M.M. (author), Conitzer, V. (author)Restricting the preferences of the agents by assuming that their utility functions linearly depend on a payment allows for the positive results of the Vickrey auction and the Vickrey-Clarke-Groves mechanism. These results, however, are limited to settings where there is some commonly desired commodity or numeraire|money, shells, beads, etcetera...conference paper 2009
- document
-
Zhang, Y. (author), De Weerdt, M.M. (author)When information or control in a multiagent system is private to the agents, they may misreport this information or refuse to execute an agreed outcome, in order to change the resulting end state of such a system to their benefit. In some domains this may result in an execution failure. We show that in such settings VCG mechanisms lose...conference paper 2009
- document
-
Hindriks, K.V. (author), Tykhonov, D. (author), De Weerdt, M.M. (author)The main question addressed in this paper is whether a theoretical outcome determined by an auction mechanism can be reasonably approximated by negotiation among agents in order to drop some of the unrealistic constraints or assumptions presupposed by the mechanism. In particular, we are interested in whether the assumption that a buyer publicly...conference paper 2008
- document
- Van der Krogt, R.P.J. (author), De Weerdt, M.M. (author), Zhang, Y. (author) conference paper 2008
- document
- Verwer, S. (author), De Weerdt, M.M. (author), Witteveen, C. (author) conference paper 2008
- document
-
Mahr, T. (author), Srour, J. (author), De Weerdt, M.M. (author), Zuidwijk, R. (author)In this paper we investigate whether a distributed agent-based planning approach indeed suffers less from job arrival uncertainty than a centralized optimization-based approach. In order to compare the two different approaches, we use the best available algorithms for both sides.conference paper 2008
- document
-
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)We describe an efficient algorithm for learning deterministic real-time automata (DRTA) from positive data. This data can be obtained from observations of the process to be modeled. The DRTA model we learn from such data can be used reason and gain knowledge about realtime systems such as network protocols, business processes, reactive systems,...conference paper 2008
- document
-
Planken, L. (author), De Weerdt, M.M. (author), Van der Krogt, R.P.J. (author)The Simple Temporal Problem (STP) is a sub-problem of almost any planning or scheduling problem involving time constraints. An existing efficient method to solve the STP, called ?STP, is based on partial path consistency and starts from a chordal constraint graph. In this paper, we analyse this algorithm and show that there exist instances for...conference paper 2008
- document
-
Harrenstein, P. (author), Máhr, T. (author), De Weerdt, M.M. (author)The negative conclusions of the Gibbard-Satterthwaite theorem|that only dictatorial social choice functions are non-manipulable|can be overcome by restricting the class of admissible preference profiles. A common approach is to assume that the preferences of the agents can be represented by quasilinear utility functions. This restriction allows...conference paper 2008
- document
-
Van der Krogt, R.P.J. (author), De Weerdt, M.M. (author), Zhang, Y. (author)Multiagent planning methods are concerned with planning by and for a group of agents. If the agents are selfinterested, they may be tempted to lie in order to obtain an outcome that is more rewarding for them. We therefore study the multiagent planning problem from a mechanism design perspective, showing how to incentivise agents to be truthful....conference paper 2008
- document
-
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)This paper describes an efficient algorithm for learning a timed model from observations. The algorithm is based on the state merging method for learning a deterministic finite state automaton (DFA). This method and its problem have been the subject of many studies within the grammatical inference field, see e.g. (de la Higuera, 2005)....conference paper 2008
- document
-
Mahr, T. (author), De Weerdt, M.M. (author), Srour, J. (author), Zuidwijk, R. (author)While intermodal transport has the potential to introduce efficiency to the transport network, this transport environment also suffers from a lot of uncertainty at the interface of modes. For example, trucks moving containers to and from a port terminal are often uncertain as to when exactly their container will be released from the ship, from...conference paper 2008
- document
-
Zhang, Y. (author), De Weerdt, M.M. (author)In many applications of the task allocation problem such as peer-topeer and grid computing, and virtual organizations, the (social or business) relations between the participating agents play an important role, and thus they should be taken into account. Furthermore, in such applications, agents providing the resources usually act self...conference paper 2007
- document
-
De Weerdt, M.M. (author), Zhang, Y. (author), Klos, T. (author)Full paper is published in: Proceedings Autonomous Agents and Multi-Agent Systems (AAMAS), 2007conference paper 2007
- document
-
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)A common model for discrete event systems is a deterministic finite automaton (DFA). An advantage of this model is that it can be interpreted by domain experts. When observing a real-world system, however, there often is more information than just the sequence of discrete events: the time at which these events occur may be very important. In...conference paper 2007