Abstract:
A method, non-transitory computer readable medium, and apparatus for routing a call using a hybrid call routing scheme are disclosed. For example, the method receives a call for a customer agent at a call center, identifies a list of available customer agents, calculates a hybrid score for each one of the available customer agents, wherein the hybrid score is based upon a combination of a longest-idle-agent routing parameter, a performance based routing parameter and a tuning parameter, selects a customer agent from the list of the available customer agents having a highest hybrid score and routes, by the processor, the call to the customer agent that is selected.
Abstract:
There is disclosed a method of conducting an auction under execution uncertainty to satisfy incentive compatibility, individual rationality, and efficiency by leveraging bonuses and penalties. A buyer posts a task including multiple sub-tasks. The buyer specifies temporal and precedence relationships among the sub-tasks. The buyer also specifies the time interval for the sub-tasks. Suppliers submit bids including their interested sub-tasks, prices, and proposed schedules. A winner determination problem is formulated based on bid prices, suppliers' success probabilities in delivering the sub-tasks, and the suppliers' schedules of undertaking sub-tasks. Having decided the winners, suppliers who delivered with success will be granted bonuses and those who were not able to deliver will be imposed penalties. The bonuses and penalties are formulated under a verification assumption. The combinatorial mechanism using the formulated winner determination rule and payment rule including bonuses and penalties satisfy economic properties such as incentive compatibility, individual rationality, and efficiency.
Abstract:
A method, non-transitory computer readable medium, and apparatus for routing a call using a hybrid call routing scheme are disclosed. For example, the method receives a call for a customer agent at a call center, identifies a list of available customer agents, calculates a hybrid score for each one of the available customer agents, wherein the hybrid score is based upon a combination of a longest-idle-agent routing parameter, a performance based routing parameter and a tuning parameter, selects a customer agent from the list of the available customer agents having a highest hybrid score and routes, by the processor, the call to the customer agent that is selected.