Arşiv ve Dokümantasyon Merkezi
Dijital Arşivi

Generating, ranking, and enacting commitment protocols

Basit öğe kaydını göster

dc.contributor Ph.D. Program in Computer Engineering.
dc.contributor.advisor Yolum, Pınar.
dc.contributor.author Günay, Akın.
dc.date.accessioned 2023-03-16T10:13:39Z
dc.date.available 2023-03-16T10:13:39Z
dc.date.issued 2013.
dc.identifier.other CMPE 2013 G86 PhD
dc.identifier.uri http://digitalarchive.boun.edu.tr/handle/123456789/12589
dc.description.abstract Multiagent systems o er novel techniques to solve computational challenges that involve data interpretation, reasoning and decision making, without human intervention. An important aspect of every multiagent system is interaction among agents, which requires agents to employ regulation mechanisms to coordinate their actions. Commitment protocols provide an e ective mechanism for this purpose. Typically, these protocols are de ned at design time and embedded into agents' implementation. However, prede ned commitment protocols are not adequate for large-scale, open multiagent systems, because of the variety of agents, changes in the agent preferences and changes in the environment. Accordingly, in this thesis we argue that agents should not rely on preexisting commitment protocols and they should be able to generate their own commitment protocols when needed, taking the current context of the multiagent system into account. In order to achieve that, we propose a three-phase agent process. In the rst phase an agent generates a set of commitment protocols based on its goals, capabilities and other agents' services. For this purpose we propose two sound and complete algorithms that can e ciently generate commitment protocols. In the second phase, the generated commitment protocols are ranked from the generating agent's perspective. To achieve this we formulate a set of metrics that use cost, bene t and trustworthiness of commitment protocols to rank them. Finally, in the third-phase the agent negotiates with other agents over selected feasible commitment protocols to reach an agreement on a protocol for enactment. In this context we formalize commitment feasibility and provide an algorithm based on constraint satisfaction techniques to check if a set of commitments can be carried out. This three-phase process provides a complete method for agents to generate and enact commitment protocols on demand.
dc.format.extent 30 cm.
dc.publisher Thesis (Ph.D.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2013.
dc.subject.lcsh Multiagent systems.
dc.subject.lcsh Decision making -- Computer simulation.
dc.title Generating, ranking, and enacting commitment protocols
dc.format.pages xvi, 167 leaves ;


Bu öğenin dosyaları

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

Dijital Arşivde Ara


Göz at

Hesabım