Papers for

call center managers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Phone scammers fight bots that learn smarter strategies over time

Game of Phones: Harnessing Game Theory and LLMs in 'Bot Wars' to Counteract Phone Scams

Abstract: Phone scams impose substantial and growing costs on individuals and financial systems worldwide, yet existing countermeasures impose no resource cost on perpetrators. Strategic scam-baiting, in which automated agents engage scammers to deplete their operational capacity, offers a proactive alternative but requires dynamic strategy adaptation that static systems cannot provide. We introduce a game-theoretic framework enabling LLMs to learn effective counter-strategies through in-context experience without fine-tuning. The framework models scammer-baiter interactions as a two-player game with empirically grounded strategies and utility functions, using Nash equilibrium as a formal benchmark for evaluating learned behaviour. Across 300 simulated dialogues and three LLM architectures, adaptive strategy selection achieves 28.9-79.7% closer alignment to Nash equilibrium than non-adaptive baselines. The code and an annotated dataset of 300 dialogues with turn-level strategy labels and utility scores are released at https://github.com/nardinebasta/GameofPhones_/ .

Mon 19 OctCryptography and SecurityArtificial IntelligenceComputation and Language
The gist
Phone scams cause big problems worldwide, and usual ways to stop them don’t cost scammers anything. The authors created a game-like model where automated agents, powered by large language models (LLMs), learn to adapt their strategies to waste scammers’ time and resources. They tested this with hundreds of simulated phone conversations and found that adaptive agents performed much closer to an ideal balance than fixed strategies. This approach could help develop smarter scam-baiting tools that adjust their behavior dynamically without retraining.
Open → 2610.26781v1

Optimal task assignment policy improves resource reuse rewards

Lag: A Mean-Field Optimal Policy for Online Assignment with Reusable Resources

Abstract: We study online task assignment with reusable resources. This problem arises in peer reviewer assignment, skill-based call routing, rideshare matching, emergency dispatch, and crowdsourcing: Tasks arrive according to a geometric process and must be immediately assigned to servers that become temporarily busy, yielding rewards that depend on the task-server pair. The goal is to maximize long-run average reward. We cast the problem as a contextual restless multi-armed bandit (CRMAB). We derive an occupancy-measure LP (OCC-LP) that upper-bounds the reward of any work-conserving policy. From its dual we obtain Lag, a closed-form index policy. We introduce a scaling regime in which the number of copies of each server and the number of arrivals per step grow together. This regime yields the first deterministic fluid limit for a contextual bandit. In it, Lag is asymptotically optimal. Finally, we evaluate our algorithms on peer review datasets and call center routing. The Lagrangian index achieves 83-99% of the LP upper bound across all load levels. Moreover, the Lagrangian index policy significantly outperforms the natural greedy assignment scheme, improving reward by up to 12.3% on journal data and 36% on structured synthetic instances.

Tue 13 OctMachine LearningPerformance
The gist
Assigning tasks to busy but reusable resources such as call center agents or peer reviewers is a common but tricky problem where tasks arrive randomly and must be immediately matched to available servers. The authors study this by modeling it as a type of 'multi-armed bandit' problem with changing contexts. They develop a mathematical policy, called Lag, that helps decide task assignments to maximize long-term rewards. Tested on real and synthetic data, their policy consistently outperforms simpler methods and nearly matches the best possible theoretical reward.
Open → 2610.19038v1

AegisVox creates consistent surrogate voices for safer clinical speech sharing

AegisVox: Factorized Privacy and Clinical Preservation for Long-Form Speech

Abstract: Clinical speech reveals identity through both spoken identifiers and voice, yet its pauses, delivery, and speaker roles can also carry useful clinical evidence. Protecting that speech therefore requires more than preserving its words. We present AegisVox, a factorized framework that assigns consistent surrogate voices and edits identifier-bearing turns using document-consistent replacements. Across 390 public simulated or non-patient conversations totaling 63.6 hours, a matched comparison of two speech renderers separates replacement realization from retained identifiers, speaker linkage, and clinical preservation. Text-to-speech rendering realizes 535/601 planned replacements versus 453/601 for the codec-based speech editor. However, similar aggregate clinical preservation conceals more model-labeled contradictions, and conversation-wide speaker scores conceal greater edited-speech linkage under a score-direction sensitivity analysis. Fresh transcription of original audio provides a reference for interpreting the clinical measurement chain; an independent judge tests sensitivity to model-based assessment. Better replacement realization can therefore coexist with worse clinical or speaker-linkage measurements. AegisVox supports use-specific evaluation of those tradeoffs, not a guarantee of identifier removal or clinical safety.

Sat 10 OctArtificial Intelligence
The gist
Clinical speech can reveal who someone is, not just through the words they say but also through their voice and speaking style. The authors developed AegisVox, a tool that changes identifying parts of speech while keeping important clinical details clear. It replaces speaker voices consistently across conversations and edits turns that contain identifiers. Their tests show that better replacement of identifying speech parts doesn’t always mean better protection or clinical accuracy, but AegisVox helps balance these tradeoffs.
Open → 2610.14643v1

Human trust and speech style improve virtual teammate perception

A study on human-agent teaming through spoken interaction: the impact of human individual traits and agent characteristics

Abstract: Human-agent teams are collaborative systems where humans and agents work interdependently to achieve shared goals. The success of such teams is associated with the human's perception of the agent as a legitimate teammate. This perception is thought to depend not only on the agent's capabilities and reliability but also on social factors. We explore whether simple changes in an agent's communicative behavior can influence the human's perception of the agent's teammate-likeness. To this end, we developed a protocol based on a collaborative game requiring spoken interaction, in which a human subject and a virtual agent collaborate to identify a target object and place it on a board. Each subject interacted with two agents which provided the same task-relevant information but differed in behavior. While one was a neutral tool-like agent, the other was a team-building agent that used simple social strategies such as empathy, politeness, and positivity. Our analysis shows that the team-building agent was perceived as significantly more teammate-like, even in terms of its ability, despite both agents having identical capabilities for game-solving. Further, subjects with a higher propensity to trust automated systems and lower neuroticism tended to have a more favorable perception of the agent. Finally, we found that subjects tended to change their prosodic patterns when talking to the team-building agent, as a classifier based on prosodic features was able to predict the type of agent with better-than-random performance. A practically relevant conclusion is that minimal changes in spoken communication behavior of the agent, easily implemented in a variety of scenarios, can have a significant positive impact on the human's perception of its teammate-likeness.

Fri 2 OctHuman-Computer InteractionArtificial IntelligenceDatabases
The gist
Working with virtual agents can be more effective when people see these agents as real teammates. The researchers found that if an agent talks in a friendly, polite, and positive way, people think of it more like a teammate, even if its actual skills don't change. People who generally trust machines more and who are less anxious tend to feel better about the agent. Also, when talking to the friendlier agent, people naturally change their voice patterns, showing they treat it differently.
Open → 2610.04079v1

Human voices boost emotion recognition over ai synthetic speech

A barrier or a booster? Familiarity effects on Mandarin emotion prosody recognition using AI-powered voice cloning

Abstract: Emotion prosody perception requires simultaneous processing of acoustic cues and speaker identity. While listeners effortlessly decode natural speech, AI synthetic voices introduce cognitive complexities due to subtle acoustic atypicalities. It remains unclear how these synthetic features interact with a listener's prior social knowledge and memory of a familiar speaker. This study investigated how speech sources (human vs. AI) and speaker familiarity affect emotion recognition accuracy and cognitive load. A within-subject task with Mandarin-speaking adults evaluated behavioral (accuracy, reaction time) and physiological data (heart rate variability). Results showed that human voices yielded significantly higher accuracy and faster processing times than AI voices, while HRV did not significantly differentiate between conditions. These findings show that decoding synthetic speech is gated by top-down social cognition, highlighting limitations in current AI synthesis technologies.

Wed 30 SeptHuman-Computer InteractionSound
The gist
Recognizing emotions from speech depends on how familiar we are with the speaker and whether the voice is natural or computer-generated. The authors found that people understand emotions more accurately and faster when listening to real human voices compared to AI-generated voices. However, having a familiar speaker didn’t affect heart rate measures, suggesting that recognizing emotions in synthetic speech is more mentally challenging. These findings show that current AI voices still struggle to convey emotions as clearly as human voices.
Open → 2609.38794v1

Salience of questions predicts answers less well in conversations

Do we need to answer that question? Salience and Answerability of Potential Questions in Naturalistic Dialogue

Abstract: We empirically investigate Question Under Discussion based modelling in naturalistic dialogue by studying whether the salience of generated potential questions predicts their subsequent resolution. Building on Wu et al. (2024), we construct a dataset of 7,124 questions automatically generated from utterances and preceding context from the British National Corpus, and annotated for salience and answerability. We find a robust but low positive correlation between salience and answerability in dialogue, indicating that more salient questions are more likely to be addressed. However, this effect is markedly weaker than in monologic text, suggesting that conversational structure is less predictable. We further observe that structured interactions exhibit stronger alignment between annotators than less organised dialogues.

Fri 25 SeptComputation and Language
The gist
Sometimes when people talk, they ask questions that guide the conversation, but not all questions get answered. The authors studied thousands of questions from real conversations to see if more noticeable questions are more likely to be answered. They found that while more noticeable questions do tend to get answers, this connection is weak in everyday back-and-forth talks compared to written text. They also noticed that in more organized conversations, people tend to agree more on which questions matter.
Open → 2609.31130v1

Whittle index aids scheduling with impatient customers and delays

Whittle index approach to multi-server scheduling with convex delay costs and impatient customers

Abstract: We consider the dynamic scheduling problem in a multi-class M/G/N + M queue with convex delay costs and impatient customers that have exponential abandonment times. We apply the Whittle index approach to find a reasonable heuristic solution for this tricky problem. By assuming exponential abandonment times, we are able to make a very straightforward use of the results of the corresponding problem with patient customers presented in Queueing Systems, Vol. 110, Article no. 2, 2026. Our main theoretical achievements are proving that the closed version of the corresponding discrete-time problem is indexable and deriving an explicit expression for the Whittle index. The discrete-time results are utilized to develop the Whittle index policy for the original continuous-time scheduling problem.

Thu 17 SeptPerformance
The gist
Scheduling server tasks is complicated when customers may leave if kept waiting too long. The authors tackle this by applying a mathematical tool called the Whittle index to manage multiple servers with different customer types who have exponential patience. They prove that this method is applicable and provide explicit formulas to help decide which customers to serve first. This helps create efficient scheduling policies when delays cause costs and customers might abandon the queue.
Open → 2609.19792v1