.png){kind=icon}
.png){kind=icon}
Return
A sequential model of bargaining in logic programming
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-015-3308-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a sequential model of bargaining specifying reasoning processes of an agent behind bargaining procedures. We encode agents' background knowledge, demands, and bargaining constraints in logic programs and represent bargaining outcomes in answer sets. We assume that in each bargaining situation, each agent has a set of goals to achieve, which are normally unachievable without an agreement among all the agents who are involved in the bargaining. Through an alternating-offers procedure, an agreement among bargaining agents may be reached by abductive reasoning.We show that the procedure converges to a Nash equilibrium if each agent makes rational offers/counter-offers in each round. In addition, the sequential model also has a number of desirable properties, such as mutual commitments, individual rationality, satisfactoriness, and honesty.
Keywords:
bargaining
logic programming
sequential model
abduction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.6
Papers:
1.6K
Citations:
2.8K
View more organizations