Graph Transformation Games for Negotiating Features
Graph Transformation Games for Negotiating Features
复制标题
用于谈判特征的图形转换游戏
DOI:
--
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
M. Alabdullatif
中科院分区:
文献类型:
--
作者:
M. Alabdullatif
The success of e-commerce applications and services depends on the outcomes of interactions between the provider of the products or services and its requestors. The flexibility of these agents to negotiate features of the products or services traded is an important characteristic of face-to-face business interactions, but is often missing in the online world. Flexibility is needed to discuss preferences and constraints in order to determine a solution that benefits both parties. Game theory is a natural framework in which to pose such problems. This thesis is concerned with a proposal-based negotiation: through which a service provider and requestor interact by exchanging proposals. In particular, we propose negotiation games based on feature models to design the flexible business interactions. Feature models are used to represent service configurations in order to support the variability of negotiated services, which increases the flexibility of the negotiators’ interactions. We introduce graph transformation games to implement and analyse our negotiation games, modelling the negotiation of features by representing the state of the game by a graph and the moves of the players by graph transformation rules. We propose two analyses of our graph transformation games in order to explore different negotiation strategies. Firstly, we analyse our graph transformation games as extensive-form games, in which backward induction technique is used to solve the game and determine the optimal strategies for the negotiators at each state of the game. Secondly, we analyse our graph transformation games as two-player turn-based stochastic games using the PRISM-games model checker. We define single-objective and multi-objective properties in order to generate optimal strategies for the players. To evaluate our approach, we applied it to a selection of feature models in order to test the scalability of the graph transformation games’ generation and analysis time. Acknowledgements In the name of Allah, the Beneficent, the Merciful. First and foremost, this work would not have been completed except by guidance of the Almighty Allah, who allowed my dreams to come true. I would like to thank Allah for giving me the power to believe in myself and pursue my dreams. I would like to take this opportunity to extend my deepest gratitude to my academic supervisor, Professor Reiko Heckel, for constantly offering adequate supervision, and keeping me on the right path during the work on this thesis. He dedicated numerous hours to giving me countless guidance and valuable suggestions. I greatly appreciate his immeasurable efforts for bringing my dreams into reality. I would like to thank my PhD co-supervisor, Professor Thomas Erlebach, and PhD tutor, Dr Fer-Jan de Vries for their guidance and support during my PhD journey. I would also like to thank the members of my thesis examining committee, Dr Artur Boronat, and Dr Radu Calinescu, for their valuable comments and suggestions. Many friends and colleagues have shared time with me, and they helped to make my PhD enjoyable and memorable. I would like to thank my best friend Abdullah Alqahtani for being my true brother and always being there when I needed someone to talk to. I would also like to especially thank Dr Mohammad Kharabsheh, Dr Mohammad Alshira’H, Dr Ayman Bajnaid, Dr Abdullah Alshanqiti, Marwan Radwan, and Marco Hernandez. I would also like to take this opportunity to gratefully and sincerely thank my sponsor, King Faisal University, for granting me full scholarship to pursue my studies abroad. I also extend my sincere gratitude to my lovely wife, Mona, who inspired me and provided constant encouragement during the entire process. I also thank my wonderful children: Abdulrahaman and Danah, for always making me smile and for understanding on those weekends when I was working on this research instead of playing games. Last but not least, I would like to thank my parents for being there for the happy times and tough times and for their guidance through my life. It would have been harder without their warm prayers. I would also like to thank my sisters and my brother for their support and help.