Author name cluster

Akın Günay

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

4 papers

1 author row

IJCAI Conference 2017 Conference Paper

Tosca: Operationalizing Commitments Over Information Protocols

Thomas C. King
Akın Günay
Amit K. Chopra
Munindar P. Singh

The notion of commitment is widely studied as a high-level abstraction for modeling multiagent interaction. An important challenge is supporting flexible decentralized enactments of commitment specifications. In this paper, we combine recent advances on specifying commitments and information protocols. Specifically, we contribute Tosca, a technique for automatically synthesizing information protocols from commitment specifications. Our main result is that the synthesized protocols support commitment alignment, which is the idea that agents must make compatible inferences about their commitments despite decentralization.

PDF Details

JAIR Journal 2016 Journal Article

ProMoca: Probabilistic Modeling and Analysis of Agents in Commitment Protocols

Akın Günay
Yang Liu
Jie Zhang

Social commitment protocols regulate interactions of agents in multiagent systems. Several methods have been developed to analyze properties of commitment protocols. However, analysis of an agent's behavior in a commitment protocol, which should take into account the agent's goals and beliefs, has received less attention. In this paper we present ProMoca framework to address this issue. Firstly, we develop an expressive formal language to model agents with respect to their commitments. Our language provides dedicated elements to define commitment protocols, and model agents in terms of their goals, behaviors, and beliefs. Furthermore, our language provides probabilistic and non-deterministic elements to model uncertainty in agents' beliefs. Secondly, we identify two essential properties of an agent with respect to a commitment protocol, namely compliance and goal satisfaction. We formalize these properties using a probabilistic variant of linear temporal logic. Thirdly, we adapt a probabilistic model checking algorithm to automatically analyze compliance and goal satisfaction properties. Finally, we present empirical results about efficiency and scalability of ProMoca.

PDF Details DOI

AAAI Conference 2015 Conference Paper

Automated Analysis of Commitment Protocols Using Probabilistic Model Checking

Akın Günay
Song Songzheng
Yang Liu
Jie Zhang

Commitment protocols provide an effective formalism for the regulation of agent interaction. Although existing work mainly focus on the design-time development of static commitment protocols, recent studies propose methods to create them dynamically at run-time with respect to the goals of the agents. These methods require agents to verify new commitment protocols taking their goals, and beliefs about the other agents’ behavior into account. Accordingly, in this paper, we first propose a probabilistic model to formally capture commitment protocols according to agents’ beliefs. Secondly, we identify a set of important properties for the verification of a new commitment protocol from an agent’s perspective and formalize these properties in our model. Thirdly, we develop probabilistic model checking algorithms with advanced reduction for efficient verification of these properties. Finally, we implement these algorithms as a tool and evaluate the proposed properties over different commitment protocols.

PDF Details

JAAMAS Journal 2014 Journal Article

Dynamically generated commitment protocols in open systems

Akın Günay
Michael Winikoff
Pınar Yolum

Abstract Agent interaction is a fundamental part of any multiagent system. Such interactions are usually regulated by protocols, which are typically defined at design-time. However, in many situations a protocol may not exist or the available protocols may not fit the needs of the agents. In order to deal with such situations agents should be able to generate protocols at runtime. In this paper we develop a three-phase framework to enable agents to create a commitment protocol dynamically. In the first phase one of the agents generates candidate commitment protocols, by considering its goals, its abilities and its knowledge about the other agents’ services. We propose two algorithms that ensure that each generated protocol allows the agent to reach its goals if the protocol is enacted. The second phase is ranking of the generated protocols in terms of their expected utility in order to select the one that best suits the agent. The third phase is the negotiation of the protocol between agents that will enact the protocol so that the agents can agree on a protocol that will be used for enactment. We demonstrate the applicability of our approach using a case study.

Details DOI