Selected Publications

Games and Network Pricing

• J. Alvarez and B. Hajek, "On the use of packet classes in communication networks to enhance congestion pricing based on marks," IEEE Trans. Automatic Control, Vol. 47, June 2002, pp. 1020 - 1026.
• S. Yang and B. Hajek, "VCG-Kelly mechanisms for allocation of divisible goods: Adapting VCG mechanisms to one-dimensional signals," IEEE J. Selected Areas of Communications (Issue on noncooperative behavior in networks) , vol. 25, pp. 1237-1243, 2007
• S. Sanghavi and B. Hajek, "A new mechanism for the free-rider problem," IEEE Transactions on Automatic Control. Vol. 53, No. 5, June 2008.
• B. Hajek, "On the value of a well chosen bit to the seller in an auction," Proceedings IEEE International Symposium on Information Theory, September 2005.
• S. Yang and B.Hajek, "Revenue and stability of a mechanism for efficient allocation of a divisible good," Submitted. October 2006.
• B. Hajek, "Substitute Valuations: Generation and Structure," ArXiv preprint 0712.3870, December 2007, Revised May 2008.

Gossiping and coding in networks

• B. Hajek and T. Weller, "On the maximum tolerable noise for reliable computation by formulas," IEEE Trans. Information Theory, Vol. 37, March 1991, pp. 388 - 391.
• B. Radosavljevic, E. Arikan, and B. Hajek, "Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks," IEEE Trans. Information Theory, Vol. 38, Nov. 1992, pp. 1833 - 1839.
• S. Sanghavi, B.Hajek, and L. Massoulie, "Gossiping with multiple messages," IEEE Transactions on Information Theory , vol. 53, December 2007, pp. 4640-4654.
• B. Hajek, ``Connections between network coding and stochastic network theory," Stochastic Networks Conference, June 19-24, 2006, Urbana. (pdf slides) (ppt slides)

Information Theory

• B. Hajek and M.B. Pursley, "Evaluation of an achievable rate region for the broadcast channel," IEEE Trans. Information Theory, Vol. 25, Jan 1979, pp. 36 - 46.
• B. Hajek, "On the strong information singularity of certain stationary processes," IEEE Trans. Information Theory, Vol. 25, Sep 1979, pp. 605 - 609.
• B. Hajek, "Information-singularity and recoverability of random processes," IEEE Trans. Information Theory, Vol. 28, May 1982, pp. 422 - 429.
• A. Ephremides and B. Hajek, "Information theory and communication networks: an unconsummated union," IEEE Trans. Information Theory, Vol. 44, Oct. 1998, pp. 2416 - 2434.
• V.G. Subramanian and B. Hajek, "Broad-band fading channels: signal burstiness and capacity," IEEE Trans. Information Theory, Vol. 48, April 2002, pp. 809 - 827.
• B. Hajek and V.G. Subramanian, "Capacity and reliability function for small peak signal constraints," IEEE Trans. Information Theory, Vol. 48, April 2002, pp. 828 - 839.
• R-R. Chen, B. Hajek, R. Koetter, and U. Madhow, "On fixed input distributions for noncoherent communication over high-SNR Rayleigh-fading channels," IEEE Trans. Information Theory, Vol. 50, Dec. 2004, pp. 3390 - 3396.
• V. Sethuraman and B. Hajek, "Capacity per unit energy of fading channels with a peak constraint," IEEE Trans. Information Theory, Vol. 51, September 2005.
• Vignesh Sethuraman, Ligong Wang, Bruce Hajek, and Amos Lapidoth, "Low SNR capacity of noncoherent fading channels," Preprint submitted to IEEE Transactions on Information Theory. December 2007.

Biology - Ion Channels

• Juan Alvarez and Bruce Hajek, "Equivalence of trans paths in ion channels," Physical Review E, vol. 73, 046126, 2006
• Juan Alvarez and Bruce Hajek, "Kernel representations for flux and concentration in ion channel models with timevarying concentrations," J. Chemical Physics , 125 164703, 2006.
• Juan Alvarez and Bruce Hajek, "Ion channels, or stochastic networks with charged customers," Slides of talk presented at the Stochastic Networks Conference, July 2004, Montreal.

Scheduling in Networks

• B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Trans. Information Theory, Vol. 34, Sept. 1988, pp. 910 - 917
• M. Carr and B. Hajek, "Scheduling with asynchronous service opportunities with applications to multiple satellite systems," IEEE Trans. Automatic Control, Vol. 38, Dec. 1993, pp. 1820 - 1833.
• T. Weller and B. Hajek, "Scheduling nonuniform traffic in a packet-switching system with small propagation delay," IEEE/ACM Trans. Networking, Vol. 5, Dec. 1997, pp. 813 - 823.
• Giles and B. Hajek, "Scheduling multirate periodic traffic in a packet switch," Long version of paper appearing in 1997 Conference on Information Sciences and Systems at John Hopkins University
• B. Hajek and T. Weller, "Scheduling nonuniform traffic in a packet switching system with large propagation delay," IEEE Trans. Information Theory, Vol. 41, March 1995, pp. 358 - 365.
• J. Giles and B. Hajek, "An information-theoretic and game-theoretic study of timing channels," IEEE Trans. Information Theory, Vol. 48, Sept. 2002, pp. 2455 - 2477.
• Bruce Hajek, ``On the competitiveness of on-line scheduling of unit-length packets with hard deadlines in slotted time,'' Conference on Information Sciences and Systems, Johns Hopkins University, March 21-23, 2001, pp. 434-439.
• B. Hajek and P. Seri, ``Lex-optimal on-line multiclass scheduling with hard deadlines," Mathematics of Operations Research, Vol. 30, no. 3, August 2005, 562-596.

Stochastic Processes

• B. Hajek and E. Wong, ``Representation and transformation of two-parameter martingales under a change of measure," Z. Wahrschein. Verw. Gebiete, vol. 54, pp. 313-330, 1980.
• B. Hajek, ``Stochastic equations of hyperbolic type and a two-parameter Stratonovich integral," Annals of Probability, vol. 10, pp. 451-463, 1982.
• B. Hajek, ``Birth-and-death processes on the integers with phases and general boundaries," J. Applied Probability, vol. 19, pp. 488-499, September 1982.
• B. Hajek and E. Wong, ``Multiple stochastic integrals: Projection and iteration," Z. Wahrscheinlichkeitstheorie verw. Gebiete, vol. 63, 349-368, 1983.
• B. Hajek and T. Berger, ``A decomposition theorem for binary Markov random fields," Annals of Probability, vol. 15, pp. 1112-1125, July 1987.
• B. Hajek, ``A queue with periodic arrivals and constant service rate," in Probability, Statistics and Optimisation---a Tribute to Peter Whittle, (F.P. Kelly ed.; John Wiley and Sons) pp. 147-158, 1994.
• H. Dupuis and B. Hajek, ``A simple formula for mean multiplexing delay for indep endent regenerative sources", Queueing Systems Theory and Applications, vol. 16, pp. 195-239, 1994.
• M. Alanyali and B. Hajek, ``On large deviations of Markov processes with discontinuous statistics," Annals of Applied Probability, vol. 8, no. 1, pp. 45-66, 1998.
• B. Hajek and L. He; "On variations of queue response for inputs with the same mean and autocorrelation function," IEEE/ACM Trans. Networking, Vol. 6, Oct. 1998, pp. 588 - 598.
• B. Hajek, "Minimum mean hitting times of Brownian motion with constrained drift," Presented at The 27th Conference on Stochastic Processes and Their Applications, July 2001.
• J. Alvarez and B. Hajek, "A queue with semi-periodic traffic," Advances in Applied Probability, vol. 37, no. 1, 2005, pp. 160-184.

Stochastic Comparison/Bounds

• B. Hajek, ``Hitting and occupation time bounds implied by drift analysis with applications," Advances in Applied Probability, vol. 14, pp. 502-525, September 1982.
• B. Hajek, ``Mean stochastic comparison of diffusions," Z. Wahrscheinlichkeitstheorie vrw. Geb., vol. 68, pp. 315-329, 1985.

Random Multiple Access

• R. Cruz and B. Hajek, "A new upper bound to the throughput of a multi-access broadcast channel," IEEE Trans. Information Theory, Vol. 28, May 1982, pp. 402 - 405.
• B. Hajek and T. van Loon, "Decentralized dynamic control of a multiaccess broadcast channel," IEEE Trans. Automatic Control, Vol. 27, Jun 1982, pp. 559 - 569.
• B. Hajek "Information of partitions with applications to random access communications," IEEE Trans. Information Theory, Vol. 28, Sep 1982, pp. 691 - 701.
• B. Hajek "Stochastic approximation methods for decentralized control of multiaccess communications," IEEE Trans. Information Theory, Vol. 31,Mar 1985, pp. 176 - 184.
• B. Hajek, N.B. Likhanov, and B.S. Tsybakov, "On the delay in a multiple-access system with large propagation delay," IEEE Trans. Information Theory, Vol. 40, July 1994, pp. 1158 - 1166.
• B. Hajek, A. Krishna, and R.O. LaMaire, "On the capture probability for a large number of stations," IEEE Trans. Communications, Vol. 45, Feb. 1997, pp. 254 - 260.

Global Stochastic Search

• B. Hajek, ``Cooling schedules for optimal annealing," Mathematics of Operations Research, vol. 13, pp. 311-329, May 1988.
• G. Sasaki and B. Hajek, ``The time complexity of maximum matching by simulated annealing," Journal of the Association of Computing Machinery, vol. 35, pp. 387-403, April 1988.
• B. Hajek and G. Sasaki, ``Simulated annealing--to cool or not," System and Control Letters, vol. 12, pp. 443-447, June 1989.
• B. Hajek, "Locating the maximum of a simple random sequence by sequential search," IEEE Trans. Information Theory, Vol. 33,Nov 1987, pp. 877 - 881.

Routing in Networks

• B. Hajek, ``The proof of a folk theorem on queueing delay with applications to routing in networks," J. Association for Computing Machinery, vol. 30, pp. 834-851, 1983.
• B. Hajek, "Optimal control of two interacting service stations," IEEE Trans. Automatic Control, Vol. 29,June 1984, pp.
• B. Hajek and R. Ogier, ``Optimal dynamic routing in communication networks with continuous traffic," Networks, vol. 14, pp. 457-487, 1984.
• B. Hajek, ``Extremal splittings of point processes," Mathematics of Operations Research, vol. 10, pp. 543-556, 1985.
• G.Sasaki and B. Hajek, "Optimal dynamic routing in single commodity networks by iterative methods" IEEE Transactions on Communications, Vol. 35, Nov 1987, pp. 1199 - 1206.
• B. Hajek, ``Bounds on evacuation time for deflection routing," Distributed Computing, vol. 5, pp. 1-6, 1991.
• A.G. Greenberg and B. Hajek, "Deflection routing in hypercube networks," IEEE Trans. Communications, Vol. 40,June 1992, pp. 1070 - 1081.
• B. Hajek and R.L. Cruz, "On the average delay for routing subject to independent deflections," IEEE Trans. Information Theory, Vol. 39, Jan. 1993, pp. 84 - 91.
• A. Krishna, B. Hajek and A. Pietracaprina, ``Sharper analysis of packet routing on a butterfly," Networks, vol. 29, pp. 91-102, March 1994.
• T. Weller and B. Hajek, "Comments on 'An optimal shortest-path routing policy for network computers with regular mesh-connected topologies?'" IEEE Trans. Computers, Vol. 43, July 1994, pp. 862 - 863.
• B. Hajek, "Large bursts do not cause instability," IEEE Trans. Automatic Control, Vol. 45, Jan. 2000, pp. 116 - 118.
• A. Krishna and B. Hajek, "Performance of shuffle-like switching networks with deflection," IEEE INFOCOM '90, 3-7 June 1990, pp. 473 - 480.
• B. Hajek and A. Krishna, "Bounds on the accuracy of the reduced-load blocking formula in some simple circuit-switched networks" Proc. of International conference on new trends in Comm., Control and Signal Processing, Bilkent University, 1990.

Load Balancing

• B. Hajek, "Performance of global load balancing by local adjustment," IEEE Trans. Information Theory, Vol. 36, Nov. 1990. pp. 1398 - 1414.
  
• B. Hajek, ``Balanced loads in infinite networks," Annals of Applied Probabi lity, vol. 6, pp. 48-75, 1996.
• M. Alanyali and B. Hajek,``Analysis of simple algorithms for dynamic load balanc ing," Mathematics of Operations Research, vol. 22, No. 4, pp. 840-871, 1997.
• M. Alanyali and B. Hajek, ``On large deviations in load sharing networks," Annals of Applied Probability, vol. 8, no. 1, pp. 67-97, 1998.
• M. Alanyali and B. Hajek, ``On load balancing in Erlang networks," in Stochastic Networks: Theory and Applications, (F.P. Kelly, S. Zachary and I. Ziedins, eds.; Oxford University Press pp. 215-230, 1996. (This gives an overview of the three other papers of Alanyali and Hajek.)

Wireless Networks

• B. Hajek, "Adaptive transmission strategies and routing in mobile radio networks, " Proc. Seventeenth Annual Conference on Information Sciences and Systems, Johns Hopkins University, March 23-25, 1983, pp. 373-378.
• B. Radosavljevic and B. Hajek, "Hiding traffic flow in communication networks," IEEE MILCOM '92, Conference Record, Oct. 1992, pp. 1096 - 1100.
• B. Hajek, "Jointly optimal paging and registration for a symmetric random walk," Proc. IEEE Information Theory Workshop, 20-25 Oct. 2002, pp. 20 - 23.
• B. Hajek "Asymptotic analysis of an assignment problem arising in a distributed communications protocol," Proc. 1988 IEEE Conf. Decision and Control, 7-9 Dec. 1988, pp. 1455 - 1459.
• S. Sanghavi and B. Hajek, Adaptive induced fluctuations for multiuser diversity," IEEE Transactions on Wireless Communications, vol. 5, pp. 1294-1305, 2006.
• R. Dangui and B. Hajek, Adaptive induced fluctuations for multiuser diversity: Two-dimensional parameters and cellular interference Long version of paper presented at IEEE VTC, September, 2005.
• B. Hajek, K. Mitzel, and S. Yang, "Paging and registration in cellular networks: jointly optimal policies and an iterative algorithm," IEEE Trans. Info. Theory , vol. 54, no. 2, pp. 608-622, 2008.

Miscellaneous Presentations

• Bruce Hajek and Ganesh Gopal, "Do greedy autonomous systems make for a sensible Internet?" Slides from presentation at the Conference on Stochastic Networks, Stanford University, June 24-29, 2002. .pdf file or .ppt file.
• Bruce Hajek, "On jointly optimal policies for paging and registration," Slides from talk at the Workshop on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOPT 2004), March 24-26 2004, Cambridge, UK (slides in color) (slides in gray)
• Bruce Hajek, "A basket of system theoretic problems in communications," Talk presented at 15th Conference on the Mathematics of Networks and Systems (MTNS), Notre Dame University, August 12-16, 2002. Full sized color pdf or Black and white notes version
• Bruce Hajek, "Equilibrium in allocation games and what it takes to get there," Slides from talk at the ValueTools, 2nd Intl. Conf. Performance Evaluation Methodologies and Tools October 23-25, 2007, Nantes, France.
• Bruce Hajek, "On the theory of combinatorial auctions and the sale of wireless spectrum," Slides from talk at the IEEE Communication Theory Workshop, May 11-14, 2008.