George Kesidis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
George Kesidis has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Chita R. Das
The Pennsylvania State University
3 shared publications - Eitan Altman
INRIA Sophia Antipolis France
3 shared publications - A. Neishaboori
CSE and EE Departments, Pennsylvania State University, University Park, PA 16802, USA
2 shared publications - David J. Miller
School of Electrical Engineering and Computer Science, Pennsylvania State University, State College, PA, USA
2 shared publications - Julio Rojas-Mora
Departamento de Ingeniería Informática, Facultad de Ingeniería, Universidad Católica de Temuco, Temuco 4780000, Chile
2 shared publications - Mohammad Hassan Lotfi
Department of ESE University of Pennsylvania 19104 Philadelphia PA
2 shared publications
Latest Publications
- 10 May 2025
- Published by Springer Nature
- p. 610-615
Denial-of-Service Detection
- Open Access
Market-Based Power Allocation for a Differentially Priced FDMA System
In this paper, we study the problem of differential pricing and QoS assignment by a broadband data provider. In our model, the broadband data provider decides on the power allocated to an end-user not only based on parameters of the transmission medium, but also based on the price the user is willing to pay. In addition, end-users bid the price that they are willing to pay to the BTS based on their channel condition, the throughput they require, and their belief about other users' parameters. We will characterize the optimum power allocation by the BTS which turns out to be a modification of the solution to the well-known water-filling problem. We also characterize the optimum bidding strategy of end-users using the belief of each user about the cell condition.
Open AccessMarket-Based Power Allocation for a Differentially Priced FDMA System
In this paper, we study the problem of differential pricing and QoS assignment by a broadband data provider. In our model, the broadband data provider decides on the power allocated to an end-user not only based on parameters of the transmission medium, but also based on the price the user is willing to pay. In addition, end-users bid the price that they are willing to pay to the BTS based on their channel condition, the throughput they require, and their belief about other users' parameters. We will characterize the optimum power allocation by the BTS which turns out to be a modification of the solution to the well-known water-filling problem. We also characterize the optimum bidding strategy of end-users using the belief of each user about the cell condition.
- Open Access
Network Non-Neutrality on the Internet: Content Provision Under a Subscription Revenue Model
The goal of this paper is to provide an insight into the equilibrium of the Internet market, when the current balance of the market is disrupted, and one of the ISPs switches to a non-neutral regime. We consider a content provider with a subscription revenue model and a continuum of end-users. The CP is also non-neutral, in the sense that she can charge users of different ISPs different subscription fees, and use this "leverage" to control the equilibrium outcome. Results reveal that the CP is able to control the non-neutral ISP to some extend. However, switching to a non-neutral regime by an ISP tips the balance of the market in favor of this ISP.
Open AccessNetwork Non-Neutrality on the Internet: Content Provision Under a Subscription Revenue Model
The goal of this paper is to provide an insight into the equilibrium of the Internet market, when the current balance of the market is disrupted, and one of the ISPs switches to a non-neutral regime. We consider a content provider with a subscription revenue model and a continuum of end-users. The CP is also non-neutral, in the sense that she can charge users of different ISPs different subscription fees, and use this "leverage" to control the equilibrium outcome. Results reveal that the CP is able to control the non-neutral ISP to some extend. However, switching to a non-neutral regime by an ISP tips the balance of the market in favor of this ISP.
- Open Access
Multicategory Crowdsourcing Accounting for Plurality in Worker Skill and Intention, Task Difficulty, and Task Heterogeneity
Crowdsourcing allows to instantly recruit workers on the web to annotate image, web page, or document databases. However, worker unreliability prevents taking a workers responses at face value. Thus, responses from multiple workers are typically aggregated to more reliably infer ground-truth answers. We study two approaches for crowd aggregation on multicategory answer spaces stochastic modeling based and deterministic objective function based. Our stochastic model for answer generation plausibly captures the interplay between worker skills, intentions, and task difficulties and allows us to model a broad range of worker types. Our deterministic objective based approach does not assume a model for worker response generation. Instead, it aims to maximize the average aggregate confidence of weighted plurality crowd decision making. In both approaches, we explicitly model the skill and intention of individual workers, which is exploited for improved crowd aggregation. Our methods are applicable in both unsupervised and semisupervised settings, and also when the batch of tasks is heterogeneous. As observed experimentally, the proposed methods can defeat tyranny of the masses, they are especially advantageous when there is a minority of skilled workers amongst a large crowd of unskilled and malicious workers.
Open AccessMulticategory Crowdsourcing Accounting for Plurality in Worker Skill and Intention, Task Difficulty, and Task Heterogeneity
Crowdsourcing allows to instantly recruit workers on the web to annotate image, web page, or document databases. However, worker unreliability prevents taking a workers responses at face value. Thus, responses from multiple workers are typically aggregated to more reliably infer ground-truth answers. We study two approaches for crowd aggregation on multicategory answer spaces stochastic modeling based and deterministic objective function based. Our stochastic model for answer generation plausibly captures the interplay between worker skills, intentions, and task difficulties and allows us to model a broad range of worker types. Our deterministic objective based approach does not assume a model for worker response generation. Instead, it aims to maximize the average aggregate confidence of weighted plurality crowd decision making. In both approaches, we explicitly model the skill and intention of individual workers, which is exploited for improved crowd aggregation. Our methods are applicable in both unsupervised and semisupervised settings, and also when the batch of tasks is heterogeneous. As observed experimentally, the proposed methods can defeat tyranny of the masses, they are especially advantageous when there is a minority of skilled workers amongst a large crowd of unskilled and malicious workers.
- Open Access
Side-payment profitability and interacting eyeball ISPs under convex demand-response modeling congestion-sensitive applications
This paper is concerned with the issue of side payments between content providers (CPs) and Internet service (access bandwidth) providers (ISPs) in an Internet that is potentially not neutral. We herein generalize past results modeling the ISP and CP interaction as a noncooperative game in two directions. We consider different demand response models (price sensitivities) for different provider types in order to explore when side payments are profitable to the ISP. Also, we consider convex (non-linear) demand response to model demand triggered by traffic which is sensitive to access bandwidth congestion, particularly delay-sensitive interactive real-time applications. Finally, we consider a model with two competing "eyeball" ISPs with transit pricing of net traffic at their peering point to study the effects of caching remote content.
Open AccessSide-payment profitability and interacting eyeball ISPs under convex demand-response modeling congestion-sensitive applications
This paper is concerned with the issue of side payments between content providers (CPs) and Internet service (access bandwidth) providers (ISPs) in an Internet that is potentially not neutral. We herein generalize past results modeling the ISP and CP interaction as a noncooperative game in two directions. We consider different demand response models (price sensitivities) for different provider types in order to explore when side payments are profitable to the ISP. Also, we consider convex (non-linear) demand response to model demand triggered by traffic which is sensitive to access bandwidth congestion, particularly delay-sensitive interactive real-time applications. Finally, we consider a model with two competing "eyeball" ISPs with transit pricing of net traffic at their peering point to study the effects of caching remote content.
- 15 June 2011
- Published by Springer Nature in Telecommunication Systems
- Vol. 52 (2) , 601-609
A model of network neutrality with usage-based prices
- 15 June 2011
- Published by Springer Nature in Telecommunication Systems
- Vol. 52 (2) , 601-609
A model of network neutrality with usage-based prices
- Open Access
Stable Nash equilibria of medium access games under symmetric, socially altruistic behavior
We consider the effects of altruistic behavior on random medium access control (slotted ALOHA) for local area communication networks. For an idealized, synchronously iterative, two-player game with asymmetric player demands, we find a Hamiltonian governing the Jacobi dynamics under purely altruistic behavior. Though the positions of the interior Nash equilibrium points do not change in the presence of altruistic behavior, the nature of their local asymptotic stability does. There is a region of partially altruistic behavior for which neither interior Nash equilibrium point is locally asymptotically stable. Also, for a power control game with a single Nash equilibrium, we show how its stability changes as a function of the altruism parameter. Variations of these altruistic game frameworks are discussed considering power (instead of throughput) based costs and linear utility functions.
Open AccessStable Nash equilibria of medium access games under symmetric, socially altruistic behavior
We consider the effects of altruistic behavior on random medium access control (slotted ALOHA) for local area communication networks. For an idealized, synchronously iterative, two-player game with asymmetric player demands, we find a Hamiltonian governing the Jacobi dynamics under purely altruistic behavior. Though the positions of the interior Nash equilibrium points do not change in the presence of altruistic behavior, the nature of their local asymptotic stability does. There is a region of partially altruistic behavior for which neither interior Nash equilibrium point is locally asymptotically stable. Also, for a power control game with a single Nash equilibrium, we show how its stability changes as a function of the altruism parameter. Variations of these altruistic game frameworks are discussed considering power (instead of throughput) based costs and linear utility functions.
- Open Access
A Study of Non-Neutral Networks with Usage-based Prices
Hahn and Wallsten wrote that network neutrality "usually means that broadband service providers charge consumers only once for Internet access, do not favor one content provider over another, and do not charge content providers for sending information over broadband lines to end users." In this paper we study the implications of non-neutral behaviors under a simple model of linear demand-response to usage-based prices. We take into account advertising revenues and consider both cooperative and non-cooperative scenarios. In particular, we model the impact of side-payments between service and content providers. We also consider the effect of service discrimination by access providers, as well as an extension of our model to non-monopolistic content providers.
Open AccessA Study of Non-Neutral Networks with Usage-based Prices
Hahn and Wallsten wrote that network neutrality "usually means that broadband service providers charge consumers only once for Internet access, do not favor one content provider over another, and do not charge content providers for sending information over broadband lines to end users." In this paper we study the implications of non-neutral behaviors under a simple model of linear demand-response to usage-based prices. We take into account advertising revenues and consider both cooperative and non-cooperative scenarios. In particular, we model the impact of side-payments between service and content providers. We also consider the effect of service discrimination by access providers, as well as an extension of our model to non-monopolistic content providers.
- 25 February 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 21 (5) , 701-717
Margin-Maximizing Feature Elimination Methods for Linear and Nonlinear Kernel-Based Discriminant Functions
Feature selection for classification in high-dimensional spaces can improve generalization, reduce classifier complexity, and identify important, discriminating feature ¿markers.¿ For support vector machine (SVM) classification, a widely used technique is recursive feature elimination (RFE). We demonstrate that RFE is not consistent with margin maximization, central to the SVM learning approach. We thus propose explicit margin-based feature elimination (MFE) for SVMs and demonstrate both improved margin and improved generalization, compared with RFE. Moreover, for the case of a nonlinear kernel, we show that RFE assumes that the squared weight vector 2-norm is strictly decreasing as features are eliminated. We demonstrate this is not true for the Gaussian kernel and, consequently, RFE may give poor results in this case. MFE for nonlinear kernels gives better margin and generalization. We also present an extension which achieves further margin gains, by optimizing only two degrees of freedom-the hyperplane's intercept and its squared 2-norm-with the weight vector orientation fixed. We finally introduce an extension that allows margin slackness. We compare against several alternatives, including RFE and a linear programming method that embeds feature selection within the classifier design. On high-dimensional gene microarray data sets, University of California at Irvine (UCI) repository data sets, and Alzheimer's disease brain image data, MFE methods give promising results.
- 25 February 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 21 (5) , 701-717
Margin-Maximizing Feature Elimination Methods for Linear and Nonlinear Kernel-Based Discriminant Functions
Feature selection for classification in high-dimensional spaces can improve generalization, reduce classifier complexity, and identify important, discriminating feature ¿markers.¿ For support vector machine (SVM) classification, a widely used technique is recursive feature elimination (RFE). We demonstrate that RFE is not consistent with margin maximization, central to the SVM learning approach. We thus propose explicit margin-based feature elimination (MFE) for SVMs and demonstrate both improved margin and improved generalization, compared with RFE. Moreover, for the case of a nonlinear kernel, we show that RFE assumes that the squared weight vector 2-norm is strictly decreasing as features are eliminated. We demonstrate this is not true for the Gaussian kernel and, consequently, RFE may give poor results in this case. MFE for nonlinear kernels gives better margin and generalization. We also present an extension which achieves further margin gains, by optimizing only two degrees of freedom-the hyperplane's intercept and its squared 2-norm-with the weight vector orientation fixed. We finally introduce an extension that allows margin slackness. We compare against several alternatives, including RFE and a linear programming method that embeds feature selection within the classifier design. On high-dimensional gene microarray data sets, University of California at Irvine (UCI) repository data sets, and Alzheimer's disease brain image data, MFE methods give promising results.
- Open Access
A quantum diffusion network
Wong's diffusion network is a stochastic, zero-input Hopfield network with a Gibbs stationary distribution over a bounded, connected continuum. Previously, logarithmic thermal annealing was demonstrated for the diffusion network and digital versions of it were studied and applied to imaging. Recently, "quantum" annealed Markov chains have garnered significant attention because of their improved performance over "pure" thermal annealing. In this note, a joint quantum and thermal version of Wong's diffusion network is described and its convergence properties are studied. Different choices for "auxiliary" functions are discussed, including those of the kinetic type previously associated with quantum annealing.
Open AccessA quantum diffusion network
Wong's diffusion network is a stochastic, zero-input Hopfield network with a Gibbs stationary distribution over a bounded, connected continuum. Previously, logarithmic thermal annealing was demonstrated for the diffusion network and digital versions of it were studied and applied to imaging. Recently, "quantum" annealed Markov chains have garnered significant attention because of their improved performance over "pure" thermal annealing. In this note, a joint quantum and thermal version of Wong's diffusion network is described and its convergence properties are studied. Different choices for "auxiliary" functions are discussed, including those of the kinetic type previously associated with quantum annealing.