NDLI: Choosing Optimal Seller Based on off-line Learning Negotiation History and K-armed Bandit Problem

Content Provider	IEEE Xplore Digital Library
Author	Li-Ming Wang Yu-Mei Chai Hou-Kuan Huang
Copyright Year	2005
Description	Author affiliation: School of Information Engineering, Zhengzhou University, Zhengzhou 450052, China; School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China; E-MAIL: cymwlm@zzu.edu.cn (Li-Ming Wang)
Abstract	When a buying agent carries user’s requirements to look for a selling agent for negotiation, there may be some sellers to meet user’s requirement, but the buyer must choose a seller who can not only meet user’s requirements, but also make the buyer’s negotiation outcome gain maximal utility before negotiation. This paper solves problem of choosing seller before negotiation in order to improve accuracy of the multi-issue negotiation and buyer’s utility. In order to fully utilize negotiation history, this paper transforms the problem of choosing seller into K-armed bandit problem to solve. Several improved algorithms, which are used to learn reward distribution by off-line learning, and combine technologies for K-armed bandit problem and learning by neural network, are presented. Finally, combining the improved algorithms with trust vectors improves accuracy and practicability of choosing a seller. The experiment proves validity of the work in application.
Sponsorship	IEEE Syst., Man and Cybernetics Tech. Comm. on Cybernetics, Hong Kong Polytechnic Univ. Hebei Univ. South China Univ. Chongqing Univ. Sun Yat-sen Univ. Harbin Inst. of Technol. and Int. Univ. in Germany
Starting Page	155
Ending Page	160
File Size	378654
Page Count	6
File Format	PDF
ISBN	0780390911
DOI	10.1109/ICMLC.2005.1526936
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-08-18
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	History Neural networks Information technology Network synthesis Machine learning Cybernetics Virtual manufacturing utility Agent K-armed bandit problem trust reputation negotiation
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Choosing multi-issue negotiating object based on trust and k-armed bandit problem.

Choosing Multi-Issue Negotiating Object Based on Trust and K-Armed Bandit Problem

An asymptotically optimal algorithm for the max k-armed bandit problem (2006)

An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem

Quantifying agent strategies under reputation (2005)

Multi-agent Negotiation Model Based on RBF Neural Network Learning Mechanism

An asymptotically optimal algorithm for the max k-armed bandit problem (2006)

Quantifying agent strategies under reputation (2005).

Learning trust strategies in reputation exchange networks.

Choosing Optimal Seller Based on off-line Learning Negotiation History and K-armed Bandit Problem

Similar Documents

Choosing multi-issue negotiating object based on trust and k-armed bandit problem.

Choosing Multi-Issue Negotiating Object Based on Trust and K-Armed Bandit Problem

An asymptotically optimal algorithm for the max k-armed bandit problem (2006)

An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem

Quantifying agent strategies under reputation (2005)

Multi-agent Negotiation Model Based on RBF Neural Network Learning Mechanism

An asymptotically optimal algorithm for the max k-armed bandit problem (2006)

Quantifying agent strategies under reputation (2005).

Learning trust strategies in reputation exchange networks.

Choosing Optimal Seller Based on off-line Learning Negotiation History and K-armed Bandit Problem