Collaborating Authors

Customer support analytics for eCommerce Cx Moments


Tagging ticket manually is slow, cumbersome, and unreliable. So much so that up to 60% of your customer tickets could be left untagged by your customer service agents. And without reliable tags, it is impossible to track the true volumes of critical issues that hurt your customers and your business. Cx Moments AI tags tickets better and faster than your agents, no matter how complex and granular your categorisation needs to be. And if you come up with a new tag or category, Cx Moments can automatically apply it to your whole ticket history.

The 1999 Asia-Pacific Conference on Intelligent-Agent Technology

AI Magazine

Intelligent-agent technology is one of the most exciting, active areas of research and development in computer science and information technology today. The First Asia-Pacific Conference on Intelligent- Agent Technology (IAT'99) attracted researchers and practitioners from diverse fields such as computer science, information systems, business, telecommunications, manufacturing, human factors, psychology, education, and robotics to examine the design principles and performance characteristics of various approaches in agent technologies and, hence, fostered the cross-fertilization of ideas on the development of autonomous agents and multiagent systems among different domains.

Object Reachability via Swaps under Strict and Weak Preferences Artificial Intelligence

The \textsc{Housing Market} problem is a widely studied resource allocation problem. In this problem, each agent can only receive a single object and has preferences over all objects. Starting from an initial endowment, we want to reach a certain assignment via a sequence of rational trades. We first consider whether an object is reachable for a given agent under a social network, where a trade between two agents is allowed if they are neighbors in the network and no participant has a deficit from the trade. Assume that the preferences of the agents are strict (no tie among objects is allowed). This problem is polynomially solvable in a star-network and NP-complete in a tree-network. It is left as a challenging open problem whether the problem is polynomially solvable when the network is a path. We answer this open problem positively by giving a polynomial-time algorithm. Then we show that when the preferences of the agents are weak (ties among objects are allowed), the problem becomes NP-hard even when the network is a path. In addition, we consider the computational complexity of finding different optimal assignments for the problem under the network being a path or a star.

How chatbots can help reduce customer service costs by 30%


Key Points: – Businesses spend $1.3 trillion on 265 billion customer service calls each year – Chatbots can help businesses save on customer service costs by speeding up response times, freeing up agents for more challenging work, and answering up to 80% of routine questions – Learn how you can increase productivity and performance at your call centers by seamlessly integrating chatbots and live agents Maria, a product design engineer, is preparing her presentation of a new ergonomic adjustable standing desk. The weekend flew by, and now it's crunch time to finalize the presentation. Maria opens the product design application, and starts the login process and the application requests an activation code. Maria frantically looks for the code in her email and cloud storage, but to no avail. She calls the CAD design software company's customer service number, hoping they offer 24/7 support.