Siddhartha Bhattacharyya
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
Siddhartha Bhattacharyya has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Gary J. Koehler
University of Florida
1 shared publication - Kumar Mehta
Decision Science and Management Information Systems, School of Management, George Mason University, 4400 University Drive MSN 5F4, Fairfax, VA 22030, USA
1 shared publication - Kurian Tharakunnel
Department of Information and Decision Sciences, University of Illinois at Chicago, Chicago, Illinois 60607-7124
1 shared publication - Parag C. Pendharkar
School of Business Administration, Pennsylvania State University at Harrisburg, Middletown, USA
1 shared publication - Yifeng Zhang
University of Illinois at Springfield
1 shared publication - Yifeng Zhang
Information and Decision Sciences, College of Business Administration, University of Illinois at Chicago, 601 S. Morgan Street (MC 294), Chicago, IL 60607, USA
1 shared publication
Latest Publications
- 9 January 2013
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 35 (2) , 391-410
Confidence in predictions from random tree ensembles
- 9 January 2013
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 35 (2) , 391-410
Confidence in predictions from random tree ensembles
- 1 January 2010
- Published by Springer Nature
- p. 155-179
Predictive Modeling on Multiple Marketing Objectives Using Evolutionary Computation
- 1 January 2010
- Published by Springer Nature
- p. 155-179
Predictive Modeling on Multiple Marketing Objectives Using Evolutionary Computation
- 22 August 2008
- Published by Springer Nature in Information Systems and e-Business Management
- Vol. 8 (3) , 235-256
Analysis of B2B e-marketplaces: an operations perspective
- 22 August 2008
- Published by Springer Nature in Information Systems and e-Business Management
- Vol. 8 (3) , 235-256
Analysis of B2B e-marketplaces: an operations perspective
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 111-118
Leader-Follower semi-Markov Decision Problems: Theoretical Framework and Approximate Solution
Leader-follower problems are hierarchical decision problems in which a leader uses incentives to induce certain desired behavior among a set of self-interested followers. Dynamic leader-follower problems extend this structure to multi-period decision situations. In this work we propose a Markov decision process (MDP) framework for a class of dynamic leader-follower problems that have important applications and discuss their approximate solution using reinforcement learning (RL). In these problems, the leader makes incentive decisions intermittently while the followers make their decisions in every period. Our theoretical framework and computational approach are based on the observation that such dynamic problems can be thought of as consisting of two coupled sequential decision processes, that of the leader and of the followers. In our formulation, the leader's decision problem that has the structure of a single-agent semi-Markov decision process (SMDP), and the followers' sequential decision problem structured as a stochastic game (multiagent competitive MDP) operate over the same state space. We call this MDP framework a leader-follower semi-Markov decision process (LFSMDP). We consider approximate solution of these problems using RL and demonstrate the solution approach in the special case where the followers' stochastic game is a repeated game.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 111-118
Leader-Follower semi-Markov Decision Problems: Theoretical Framework and Approximate Solution
Leader-follower problems are hierarchical decision problems in which a leader uses incentives to induce certain desired behavior among a set of self-interested followers. Dynamic leader-follower problems extend this structure to multi-period decision situations. In this work we propose a Markov decision process (MDP) framework for a class of dynamic leader-follower problems that have important applications and discuss their approximate solution using reinforcement learning (RL). In these problems, the leader makes incentive decisions intermittently while the followers make their decisions in every period. Our theoretical framework and computational approach are based on the observation that such dynamic problems can be thought of as consisting of two coupled sequential decision processes, that of the leader and of the followers. In our formulation, the leader's decision problem that has the structure of a single-agent semi-Markov decision process (SMDP), and the followers' sequential decision problem structured as a stochastic game (multiagent competitive MDP) operate over the same state space. We call this MDP framework a leader-follower semi-Markov decision process (LFSMDP). We consider approximate solution of these problems using RL and demonstrate the solution approach in the special case where the followers' stochastic game is a repeated game.
- 1 September 2006
- Published by Springer Nature in Information Technology and Management
- Vol. 7 (3) , 191-212
Design, development and validation of an agent-based model of electronic auctions
- 1 September 2006
- Published by Springer Nature in Information Technology and Management
- Vol. 7 (3) , 191-212
Design, development and validation of an agent-based model of electronic auctions
- 1 June 2004
- Published by Elsevier in Information Sciences
- Vol. 163 (1-3) , 85-101
Genetic programming in classifying large-scale data: an ensemble method
- 1 June 2004
- Published by Elsevier in Information Sciences
- Vol. 163 (1-3) , 85-101
Genetic programming in classifying large-scale data: an ensemble method
- 1 September 1998
- Published by Wiley in Decision Sciences
- Vol. 29 (4) , 871-899
Inductive, Evolutionary, and Neural Computing Techniques for Discrimination: A Comparative Study*
This paper provides a comparative study of machine learning techniques for two‐group discrimination. Simulated data is used to examine how the different learning techniques perform with respect to certain data distribution characteristics. Both linear and nonlinear discrimination methods are considered. The data has been previously used in the comparative evaluation of a number of techniques and helps relate our findings across a range of discrimination techniques.
- 1 September 1998
- Published by Wiley in Decision Sciences
- Vol. 29 (4) , 871-899
Inductive, Evolutionary, and Neural Computing Techniques for Discrimination: A Comparative Study*
This paper provides a comparative study of machine learning techniques for two‐group discrimination. Simulated data is used to examine how the different learning techniques perform with respect to certain data distribution characteristics. Both linear and nonlinear discrimination methods are considered. The data has been previously used in the comparative evaluation of a number of techniques and helps relate our findings across a range of discrimination techniques.
- 1 March 1998
- Published by Wiley in Decision Sciences
- Vol. 29 (2) , 347-375
Learning by Objectives for Adaptive Shop‐Floor Scheduling*
Effective production scheduling requires consideration of the dynamics and unpredictability of the manufacturing environment. An automated learning scheme, utilizing genetic search, is proposed for adaptive control in typical decentralized factory‐floor decision making. A high‐level knowledge representation for modeling production environments is developed, with facilities for genetic learning within this scheme. A multiagent framework is used, with individual agents being responsible for the dispatch decision making at different workstations. Learning is with respect to stated objectives, and given the diversity of scheduling goals, the efficacy of the designed learning scheme is judged through its response under different objectives. The behavior of the genetic learning scheme is analyzed and simulation studies help compare how learning under different objectives impacts certain aggregate measures of system performance.
- 1 March 1998
- Published by Wiley in Decision Sciences
- Vol. 29 (2) , 347-375
Learning by Objectives for Adaptive Shop‐Floor Scheduling*
Effective production scheduling requires consideration of the dynamics and unpredictability of the manufacturing environment. An automated learning scheme, utilizing genetic search, is proposed for adaptive control in typical decentralized factory‐floor decision making. A high‐level knowledge representation for modeling production environments is developed, with facilities for genetic learning within this scheme. A multiagent framework is used, with individual agents being responsible for the dispatch decision making at different workstations. Learning is with respect to stated objectives, and given the diversity of scheduling goals, the efficacy of the designed learning scheme is judged through its response under different objectives. The behavior of the genetic learning scheme is analyzed and simulation studies help compare how learning under different objectives impacts certain aggregate measures of system performance.