The Experts below are selected from a list of 1455 Experts worldwide ranked by ideXlab platform
Xujin Chen - One of the best experts on this subject based on the ideXlab platform.
-
Stability vs. optimality in selfish ring routing
Acta Mathematica Sinica English Series, 2014Co-Authors: Bo Chen, Xujin ChenAbstract:We study asymmetric atomic selfish routing in ring networks, which has diverse practical applications in network design and analysis. We are concerned with minimizing the Maximum Latency of source-destination node-pairs over links with linear latencies. We show that there exists an optimal solution that is a 9-approximate Nash equilibrium, significantly improving the existing upper bound of 54 on the instability factor. We present fast implementation of the best response dynamics for computing a Nash equilibrium. Furthermore, we perform empirical study on the price of stability, narrowing the gap between the lower and upper bounds to 0.7436.
-
The Price of Anarchy for Selfish Ring Routing is Two
arXiv: Computer Science and Game Theory, 2012Co-Authors: Xujin Chen, Benjamin Doerr, Rob Van Stee, Carola WinzenAbstract:We analyze the network congestion game with atomic players, asymmetric strategies, and the Maximum Latency among all players as social cost. This important social cost function is much less understood than the average Latency. We show that the price of anarchy is at most two, when the network is a ring and the link latencies are linear. Our bound is tight. This is the first sharp bound for the Maximum Latency objective.
-
WINE - The price of anarchy for selfish ring routing is two
Lecture Notes in Computer Science, 2012Co-Authors: Xujin Chen, Benjamin Doerr, Rob Van Stee, Carola WinzenAbstract:We analyze the network congestion game with atomic players, asymmetric strategies, and the Maximum Latency among all players as social cost. This important social cost function is much less understood than the average Latency. We show that the price of anarchy is at most two, when the network is a ring and the link latencies are linear. Our bound is tight. This is the first sharp bound for the Maximum Latency objective.
-
Pairwise cooperations in selfish ring routing for minimax linear Latency
Theoretical Computer Science, 2012Co-Authors: Xujin ChenAbstract:This paper studies the selfish routing game in ring networks with a load-dependent linear Latency on each link. We adopt the asymmetric atomic routing model. Each player selfishly chooses a route to connect his source-destination pair, aiming at the lowest Latency of his route, while the system objective is to minimize the Maximum Latency among all routes of players. The effectiveness of these routing games is often measured by the price of anarchy (PoA), the worst-case ratio between the Maximum latencies in a Nash equilibrium (NE) and in a system optimum, where NE refers to a ''stable state'' among all players, from which no player has the incentive to deviate unilaterally. In classical setting, no cooperation is allowed and 16 stands as the current best upper bound on the PoA of such selfish ring routing. In this paper we show that the PoA is at most 10.16 provided cooperations within pairs of players are allowed, where any two players could change their routes simultaneously if neither would experience a longer Latency and at least one would experience a shorter Latency.
-
reducing the Maximum Latency of selfish ring routing via pairwise cooperations
Conference on Combinatorial Optimization and Applications, 2010Co-Authors: Xujin ChenAbstract:This paper studies the selfish routing game in ring networks with a load-dependent linear Latency on each link. We adopt the asymmetric atomic routing model. Each player selfishly chooses a route to connect his source-destination pair, aiming at a lowest Latency of his route, while the system objective is to minimize the Maximum Latency among all routes of players. Such a routing game always has a Nash equilibrium (NE) that is a "stable state" among all players, from which no player has the incentive to deviate unilaterally. Furthermore, 16 is the current best upper bound on its price of anarchy (PoA), the worst-case ratio between the Maximum latencies in a NE and in a system optimum. In this paper we show that the PoA is at most 10.16 provided cooperations within pairs of players are allowed, where any two players could change their routes simultaneously if neither would experience a longer Latency and at least one would experience a shorter Latency.
Erik G. Ström - One of the best experts on this subject based on the ideXlab platform.
-
Short-packet Transmission via Variable-Length Codes in the Presence of Noisy Stop Feedback
IEEE Transactions on Wireless Communications, 2021Co-Authors: Johan Östman, Rahul Devassy, Giuseppe Durisi, Erik G. StrömAbstract:We present an upper bound on the error probability achievable using variable-length stop feedback (VLSF) codes, for a fixed size of the information payload and a given constraint on the Maximum Latency and the average service time. Differently from the bound proposed in Polyanskiy et al. (2011), which pertains to the scenario in which the stop signal is sent over a noiseless feedback channel, our bound applies to the practically relevant setup in which the feedback link is noisy. Numerical evaluation of our bound suggests that, for fixed Latency and reliability constraints, noise in the feedback link may increase the minimum average service time for the VLSF scheme considered in this paper, to the extent that fixed-length codes without feedback may be preferable in some scenarios.
-
Short-packet Transmission via Variable-Length Codes in the Presence of Noisy Stop Feedback
arXiv: Information Theory, 2019Co-Authors: Johan Östman, Rahul Devassy, Giuseppe Durisi, Erik G. StrömAbstract:We present an upper bound on the error probability achievable using variable-length stop feedback codes, for a fixed size of the information payload and a given constraint on the Maximum Latency and the average service time. Differently from the bound proposed in Polyanskiy et al. (2011), which pertains to the scenario in which the stop signal is sent over a noiseless feedback channel, our bound applies to the practically relevant setup in which the feedback link is noisy. By numerically evaluating our bound, we illustrate that, for fixed Latency and reliability constraints, noise in the feedback link can cause a significant increase in the minimum average service time, to the extent that fixed-length codes without feedback may be preferable in some scenarios.
-
ITW - On the Nonasymptotic Performance of Variable-Length Codes with Noisy Stop Feedback
2019 IEEE Information Theory Workshop (ITW), 2019Co-Authors: Johan Östman, Rahul Devassy, Giuseppe Durisi, Erik G. StrömAbstract:We present an upper bound on the error probability achievable using variable-length stop-feedback codes, for a fixed size of the information payload and a given constraint on both the average and the Maximum Latency. Differently from the bound proposed in Polyanskiy et at. (2011), which pertains to the scenario in which the stop signal is sent over a noiseless feedback channel, our bound applies to the practically relevant scenario in which the feedback link is noisy. Through numerical results, we illustrate that, in scenarios in which the desired average Latency is small, noise in the feedback link can deteriorate the performance of variable-length stop-feedback codes to the extent that it becomes inferior to that of fixed-length codes without feedback.
Khiet P Truong - One of the best experts on this subject based on the ideXlab platform.
-
online detection of vocal listener responses with Maximum Latency constraints
International Conference on Acoustics Speech and Signal Processing, 2011Co-Authors: Daniel Neiberg, Khiet P TruongAbstract:When human listeners utter Listener Responses (e.g. back-channels or acknowledgments) such as ‘yeah’ and ‘mmhmm’, interlocutors commonly continue to speak or resume their speech even before the listener has finished his/her response. This type of speech interactivity results in frequent speech overlap which is common in human-human conversation. To allow for this type of speech interactivity to occur between humans and spoken dialog systems, which will result in more human-like continuous and smoother human-machine interaction, we propose an on-line classifier which can classify incoming speech as Listener Responses. We show that it is possible to detect vocal Listener Responses using Maximum Latency thresholds of 100–500 ms, thereby obtaining equal error rates ranging from 34% to 28% by using an energy based voice activity detector.
-
ICASSP - Online detection of vocal Listener Responses with Maximum Latency constraints
2011 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), 2011Co-Authors: Daniel Neiberg, Khiet P TruongAbstract:When human listeners utter Listener Responses (e.g. back-channels or acknowledgments) such as ‘yeah’ and ‘mmhmm’, interlocutors commonly continue to speak or resume their speech even before the listener has finished his/her response. This type of speech interactivity results in frequent speech overlap which is common in human-human conversation. To allow for this type of speech interactivity to occur between humans and spoken dialog systems, which will result in more human-like continuous and smoother human-machine interaction, we propose an on-line classifier which can classify incoming speech as Listener Responses. We show that it is possible to detect vocal Listener Responses using Maximum Latency thresholds of 100–500 ms, thereby obtaining equal error rates ranging from 34% to 28% by using an energy based voice activity detector.
-
A Maximum Latency Classifier for Listener Responses
2010Co-Authors: Daniel Neiberg, Khiet P TruongAbstract:When Listener Responses such as “yeah”, “right” or “mhm” are uttered in a face-to-face conversation, it is not uncommon for the interlocutor to continue to speak in overlap, i.e. before the Listener becomes silent. We propose a classifier which can classify incoming speech as a Listener Response or not before the talk-spurt ends. The classifier is implemented as an upgrade of the Embodied Conversational Agent developed in the SEMAINE project during the eNTERFACE 2010 workshop.
Johan Östman - One of the best experts on this subject based on the ideXlab platform.
-
Short-packet Transmission via Variable-Length Codes in the Presence of Noisy Stop Feedback
IEEE Transactions on Wireless Communications, 2021Co-Authors: Johan Östman, Rahul Devassy, Giuseppe Durisi, Erik G. StrömAbstract:We present an upper bound on the error probability achievable using variable-length stop feedback (VLSF) codes, for a fixed size of the information payload and a given constraint on the Maximum Latency and the average service time. Differently from the bound proposed in Polyanskiy et al. (2011), which pertains to the scenario in which the stop signal is sent over a noiseless feedback channel, our bound applies to the practically relevant setup in which the feedback link is noisy. Numerical evaluation of our bound suggests that, for fixed Latency and reliability constraints, noise in the feedback link may increase the minimum average service time for the VLSF scheme considered in this paper, to the extent that fixed-length codes without feedback may be preferable in some scenarios.
-
Short-packet Transmission via Variable-Length Codes in the Presence of Noisy Stop Feedback
arXiv: Information Theory, 2019Co-Authors: Johan Östman, Rahul Devassy, Giuseppe Durisi, Erik G. StrömAbstract:We present an upper bound on the error probability achievable using variable-length stop feedback codes, for a fixed size of the information payload and a given constraint on the Maximum Latency and the average service time. Differently from the bound proposed in Polyanskiy et al. (2011), which pertains to the scenario in which the stop signal is sent over a noiseless feedback channel, our bound applies to the practically relevant setup in which the feedback link is noisy. By numerically evaluating our bound, we illustrate that, for fixed Latency and reliability constraints, noise in the feedback link can cause a significant increase in the minimum average service time, to the extent that fixed-length codes without feedback may be preferable in some scenarios.
-
ITW - On the Nonasymptotic Performance of Variable-Length Codes with Noisy Stop Feedback
2019 IEEE Information Theory Workshop (ITW), 2019Co-Authors: Johan Östman, Rahul Devassy, Giuseppe Durisi, Erik G. StrömAbstract:We present an upper bound on the error probability achievable using variable-length stop-feedback codes, for a fixed size of the information payload and a given constraint on both the average and the Maximum Latency. Differently from the bound proposed in Polyanskiy et at. (2011), which pertains to the scenario in which the stop signal is sent over a noiseless feedback channel, our bound applies to the practically relevant scenario in which the feedback link is noisy. Through numerical results, we illustrate that, in scenarios in which the desired average Latency is small, noise in the feedback link can deteriorate the performance of variable-length stop-feedback codes to the extent that it becomes inferior to that of fixed-length codes without feedback.
Daniel Neiberg - One of the best experts on this subject based on the ideXlab platform.
-
online detection of vocal listener responses with Maximum Latency constraints
International Conference on Acoustics Speech and Signal Processing, 2011Co-Authors: Daniel Neiberg, Khiet P TruongAbstract:When human listeners utter Listener Responses (e.g. back-channels or acknowledgments) such as ‘yeah’ and ‘mmhmm’, interlocutors commonly continue to speak or resume their speech even before the listener has finished his/her response. This type of speech interactivity results in frequent speech overlap which is common in human-human conversation. To allow for this type of speech interactivity to occur between humans and spoken dialog systems, which will result in more human-like continuous and smoother human-machine interaction, we propose an on-line classifier which can classify incoming speech as Listener Responses. We show that it is possible to detect vocal Listener Responses using Maximum Latency thresholds of 100–500 ms, thereby obtaining equal error rates ranging from 34% to 28% by using an energy based voice activity detector.
-
ICASSP - Online detection of vocal Listener Responses with Maximum Latency constraints
2011 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), 2011Co-Authors: Daniel Neiberg, Khiet P TruongAbstract:When human listeners utter Listener Responses (e.g. back-channels or acknowledgments) such as ‘yeah’ and ‘mmhmm’, interlocutors commonly continue to speak or resume their speech even before the listener has finished his/her response. This type of speech interactivity results in frequent speech overlap which is common in human-human conversation. To allow for this type of speech interactivity to occur between humans and spoken dialog systems, which will result in more human-like continuous and smoother human-machine interaction, we propose an on-line classifier which can classify incoming speech as Listener Responses. We show that it is possible to detect vocal Listener Responses using Maximum Latency thresholds of 100–500 ms, thereby obtaining equal error rates ranging from 34% to 28% by using an energy based voice activity detector.
-
A Maximum Latency Classifier for Listener Responses
2010Co-Authors: Daniel Neiberg, Khiet P TruongAbstract:When Listener Responses such as “yeah”, “right” or “mhm” are uttered in a face-to-face conversation, it is not uncommon for the interlocutor to continue to speak in overlap, i.e. before the Listener becomes silent. We propose a classifier which can classify incoming speech as a Listener Response or not before the talk-spurt ends. The classifier is implemented as an upgrade of the Embodied Conversational Agent developed in the SEMAINE project during the eNTERFACE 2010 workshop.