A sequential model for reasoning about bargaining in logic programs
Logic Programming and Nonmonotonic Reasoning: 12th International Conference …, 2013•Springer
This paper presents a sequential model of bargaining based on abductive reasoning in
ASP. We assume that each agent is represented by a logic program that encodes the
background knowledge of the agent. Each agent has a set of goals to achieve but these
goals are normally unachievable without an agreement from the other agent. We design an
alternating-offers procedure that shows how an agreement between two agents can be
reached through a reasoning process based on answer set programming and abduction …
ASP. We assume that each agent is represented by a logic program that encodes the
background knowledge of the agent. Each agent has a set of goals to achieve but these
goals are normally unachievable without an agreement from the other agent. We design an
alternating-offers procedure that shows how an agreement between two agents can be
reached through a reasoning process based on answer set programming and abduction …
Abstract
This paper presents a sequential model of bargaining based on abductive reasoning in ASP. We assume that each agent is represented by a logic program that encodes the background knowledge of the agent. Each agent has a set of goals to achieve but these goals are normally unachievable without an agreement from the other agent. We design an alternating-offers procedure that shows how an agreement between two agents can be reached through a reasoning process based on answer set programming and abduction. We prove that the procedure converges to a Nash equilibrium if each player makes rational offer/counter-offer at each round.
Springer
顯示最佳搜尋結果。 查看所有結果