anurag.bib

%%%%%%%%%% Online %%%%%%%%%%%
@online{WEBOPEDIA-csma-cd,
    title = {{CSMA/CD} - {C}arrier {S}ense {M}ultiple {A}ccess / {C}ollision {D}etection},
    author = {Vangie Beal},
    url = {https://www.webopedia.com/TERM/C/CSMA_CD.html},
}

@online{matlab_armax,
    title={MATLAB documentation: Estimating parameters of ARMAX model using time series data},
    publisher={Mathworks},
    url={https://in.mathworks.com/help/ident/ref/armax.html}
}
@online{feynman_counting,
    title={Feynman on counting},
    publisher={Youtube},
    url={https://www.youtube.com/watch?v=lr8sVailoLw}
}
@online{kilobotics_manual,
    title = {Kilobot user manual},
    author = {K Team},
    url = {https://ftp.k-team.com/kilobot/user_manual/Kilobot_UserManual.pdf},
}

@online{simple-line-follower,
	title = {Simple line follower robot},
	author = {Instructables},
	url = {https://www.instructables.com/id/SIMPLE-LINE-FOLLOWER-ROBOTsingle-Sensor/},
}

%%%%%%%%%% Unpublished %%%%%%%%%%

@unpublished{PV-lno,
    title = {Lecture notes on optimization},
    author = {Pravin Varaiya},
    note = {Lecture notes for course EECS 227A at University of California, Berkley}
}

@techreport{KK:2014,
	title = {Single board multi heater system (SBMHS plus)},
	author = {K Kumar},
    institution = {Indian Institute of Technology, Bombay},
	year = {2014}
}

%%%%%%%%%% Non-survey papers %%%%%%%%%%%%%%
@article {MR-AC-RN:2014,
	author = {Rubenstein, Michael and Cornejo, Alejandro and Nagpal, Radhika},
	title = {Programmable self-assembly in a thousand-robot swarm},
	volume = {345},
	number = {6198},
	pages = {795--799},
	year = {2014},
	doi = {10.1126/science.1254295},
	publisher = {American Association for the Advancement of Science},
	abstract = {When individuals swarm, they must somehow communicate to direct collective motion. Swarms of robots need to deal with outliers, such as robots that move more slowly than the rest. Rubenstein et al. created a large swarm of programmed robots that can form collaborations using only local information. The robots could communicate only with nearby members, within about three times their diameter. They were able to assemble into complex preprogrammed shapes. If the robots{\textquoteright} formation hit snags when they bumped into one another or because of an outlier, additional algorithms guided them to rectify their collective movements.Science, this issue p. 795Self-assembly enables nature to build complex forms, from multicellular organisms to complex animal structures such as flocks of birds, through the interaction of vast numbers of limited and unreliable individuals. Creating this ability in engineered systems poses challenges in the design of both algorithms and physical systems that can operate at such scales. We report a system that demonstrates programmable self-assembly of complex two-dimensional shapes with a thousand-robot swarm. This was enabled by creating autonomous robots designed to operate in large groups and to cooperate through local interactions and by developing a collective algorithm for shape formation that is highly robust to the variability and error characteristic of large-scale decentralized systems. This work advances the aim of creating artificial swarms with the capabilities of natural ones.},
	issn = {0036-8075},
	URL = {https://science.sciencemag.org/content/345/6198/795},
	eprint = {https://science.sciencemag.org/content/345/6198/795.full.pdf},
	journal = {Science}
}


@article{STJ-AAK:2017,
author={S. T. {Jose} and A. A. {Kulkarni}},
journal={IEEE Transactions on Information Theory},
title={Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding},
year={2017},
volume={63},
number={11},
pages={7066-7094},
keywords={block codes;combined source-channel coding;data compression;distortion measurement;duality (mathematics);linear programming;memoryless systems;probability;LP relaxation;lossy source coding;finite blocklength channel coding;lossless source coding;finite blocklength joint source-channel coding;source-channel pairs;linear programming-based converses;finite blocklength lossy joint source-channel coding;nonconvex optimization problem;lift-and-project-like method;Distortion;Channel coding;Optimization;Source coding;Linear programming;Testing;Converses;lossy joint source-channel coding;finite blocklength regime;linear programming relaxation;lift-and-project;strong duality},
doi={10.1109/TIT.2017.2738634},
ISSN={0018-9448},
month={Nov},
}

@article{AAK-TPC:2015, 
author={A. A. {Kulkarni} and T. P. {Coleman}}, 
journal={IEEE Transactions on Automatic Control}, 
title={An Optimizer's Approach to Stochastic Control Problems With Nonclassical Information Structures}, 
year={2015}, 
volume={60}, 
number={4}, 
pages={937-949}, 
keywords={optimal control;optimisation;stochastic systems;optimizer approach;stochastic control problems;nonclassical information structures;general optimization-based framework;joint distributions;convex relaxation;data processing inequality;f-divergences;inverse optimal cost functions;inverse optimal control;Cost function;Decoding;Joints;Random variables;Rate-distortion;Standards;;Optimal control;stochastic systems;optimization;information theory;decentralized control;networked control systems}, 
doi={10.1109/TAC.2014.2362596}, 
ISSN={0018-9286}, 
month={April},
}

@article{DBB-JES-PS:2010,
author = {Brown, David B. and Smith, James E. and Sun, Peng},
title = {Information Relaxations and Duality in Stochastic Dynamic Programs},
journal = {Operations Research},
volume = {58},
number = {4-part-1},
pages = {785-801},
year = {2010},
doi = {10.1287/opre.1090.0796},
URL = {https://doi.org/10.1287/opre.1090.0796},
eprint = {https://doi.org/10.1287/opre.1090.0796},
abstract = { We describe a general technique for determining upper bounds on maximal values (or lower bounds on minimal costs) in stochastic dynamic programs. In this approach, we relax the nonanticipativity constraints that require decisions to depend only on the information available at the time a decision is made and impose a “penalty” that punishes violations of nonanticipativity. In applications, the hope is that this relaxed version of the problem will be simpler to solve than the original dynamic program. The upper bounds provided by this dual approach complement lower bounds on values that may be found by simulating with heuristic policies. We describe the theory underlying this dual approach and establish weak duality, strong duality, and complementary slackness results that are analogous to the duality results of linear programming. We also study properties of good penalties. Finally, we demonstrate the use of this dual approach in an adaptive inventory control problem with an unknown and changing demand distribution and in valuing options with stochastic volatilities and interest rates. These are complex problems of significant practical interest that are quite difficult to solve to optimality. In these examples, our dual approach requires relatively little additional computation and leads to tight bounds on the optimal values. }
}

@article{DPF-BVR:2003,
    author = {de Farias, D. P. and Van Roy, B.},
    title = {The Linear Programming Approach to Approximate Dynamic Programming},
    journal = {Operations Research},
    volume = {51},
    number = {6},
    pages = {850-865},
    year = {2003},
    doi = {10.1287/opre.51.6.850.24925},
    URL = {https://doi.org/10.1287/opre.51.6.850.24925},
    eprint = {https://doi.org/10.1287/opre.51.6.850.24925},
    abstract = { The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach “fits” a linear combination of pre-selected basis functions to the dynamic programming cost-to-go function. We develop error bounds that offer performance guarantees and also guide the selection of both basis functions and “state-relevance weights” that influence quality of the approximation. Experimental results in the domain of queueing network control provide empirical support for the methodology. }
}


@article{DC-DES:2002,
	title = {PI/PID Controller Design Based on Direct Synthesis and Disturbance Rejection},
	author = {D Chen, D E Seborg.},
	journal = {Industrial \& Engineering Chemistry Research},
	year = {2002},
	url = {https://doi.org/10.1021/ie010756m}
}

@article{PP-AAK:2018,
	title = "Refinement of the equilibrium of public goods games over networks: Efficiency and effort of specialized equilibria",
	journal = "Journal of Mathematical Economics",
	year = "2018",
	issn = "0304-4068",
	doi = "https://doi.org/10.1016/j.jmateco.2018.04.002",
	url = "http://www.sciencedirect.com/science/article/pii/S0304406816300660",
	author = "Parthe Pandit and Ankur A. Kulkarni",
	keywords = "Network games, Public goods, Specialized equilibria, Independent sets, Linear complementarity problems"
}

@article{YB-RK:2007,
	title = "Public goods in networks",
	journal = "Journal of Economic Theory",
	volume = "135",
	number = "1",
	pages = "478 - 494",
	year = "2007",
	issn = "0022-0531",
	doi = "https://doi.org/10.1016/j.jet.2006.06.006",
	url = "http://www.sciencedirect.com/science/article/pii/S0022053106001220",
	author = "Yann Bramoullé and Rachel Kranton",
	keywords = "Strategic substitutes, Independent sets, Experimentation, Information sharing"
}

@article{DK-et-al:2018, 
	author={D. Kalathil and C. Wu and K. Poolla and P. Varaiya}, 
	journal={IEEE Transactions on Smart Grid}, 
	title={The Sharing Economy for the Electricity Storage}, 
	year={2018}, 
	volume={}, 
	number={}, 
	pages={1-1}, 
	keywords={Biological system modeling;Pricing;Investment;Nash equilibrium;Peer-to-peer computing;Games;Sharing economy;electricity storage;time-of-use pricing;Nash equilibrium.}, 
	doi={10.1109/TSG.2017.2748519}, 
	ISSN={1949-3053}, 
	month={},}

@article{PC-et-al:2018, 
	author={P. Chakraborty and E. Baeyens and K. Poolla and P. P. Khargonekar and P. Varaiya}, 
	journal={IEEE Transactions on Smart Grid}, 
	title={Sharing Storage in a Smart Grid: A Coalitional Game Approach}, 
	year={2018}, 
	volume={}, 
	number={}, 
	pages={1-1}, 
	keywords={Game theory;Random variables;Games;Resource management;Smart grids;Economics;Energy storage;Storage Sharing;Cooperative Game Theory;Cost Allocation.}, 
	doi={10.1109/TSG.2018.2858206}, 
	ISSN={1949-3053}, 
	month={},}

@inproceedings{WC-JP-KP:2016, 
	author={C. Wu and J. Porter and K. Poolla}, 
	booktitle={2016 IEEE International Conference on Smart Grid Communications (SmartGridComm)}, 
	title={Community storage for firming}, 
	year={2016}, 
	volume={}, 
	number={}, 
	pages={570-575}, 
	keywords={energy storage;game theory;community storage;firming;storage capacity sharing;shared storage system;installation cost;chance constraint;cooperative storage sharing game;noncooperative information reporting game;cost allocation;Games;Smart grids;Real-time systems;Microgrids;Resource management;Electricity supply industry;Conferences}, 
	doi={10.1109/SmartGridComm.2016.7778822}, 
	ISSN={}, 
	month={Nov},}

@article{PC-et-al:2017,
	author    = {P. Chakraborty and
	E. Baeyens and
	P. P. Khargonekar},
	title     = {Analysis of Solar Energy Aggregation under Various Billing Mechanisms},
	journal   = {CoRR},
	volume    = {abs/1708.05889},
	year      = {2017},
	url       = {http://arxiv.org/abs/1708.05889},
	archivePrefix = {arXiv},
	eprint    = {1708.05889},
	timestamp = {Mon, 13 Aug 2018 16:46:20 +0200},
	biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1708-05889},
	bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{YP-BKS:2016,
	Author = {Parag, Yael and Sovacool, Benjamin K.},
	Date = {2016/03/21/online},
	Date-Added = {2018-09-13 10:31:55 +0000},
	Date-Modified = {2018-09-13 10:31:55 +0000},
	Day = {21},
	Journal = {Nature Energy},
	L3 = {10.1038/nenergy.2016.32; },
	M3 = {Perspective},
	Month = {03},
	Pages = {16032 EP  -},
	Publisher = {Macmillan Publishers Limited SN  -},
	Title = {Electricity market design for the prosumer era},
	Url = {http://dx.doi.org/10.1038/nenergy.2016.32},
	Volume = {1},
	Year = {2016},
}

@article{BHZ-DMSB-IU:2018,
	title = "Combinatorial auctions for energy storage sharing amongst the households",
	journal = "Journal of Energy Storage",
	volume = "19",
	pages = "291 - 301",
	year = "2018",
	issn = "2352-152X",
	doi = "https://doi.org/10.1016/j.est.2018.08.010",
	url = "http://www.sciencedirect.com/science/article/pii/S2352152X18302007",
	author = "Bizzat Hussain Zaidi and Dost Muhammad Saqib Bhatti and Ihsan Ullah",
	keywords = "Combinatorial auctions, Energy storage sharing, Genetic algorithm, Particle swarm optimization, Smart grid, Winner determination process"
}

@article{PL-FS:2017,
	title = "Sharing economy as a new business model for energy storage systems",
	journal = "Applied Energy",
	volume = "188",
	pages = "485 - 496",
	year = "2017",
	issn = "0306-2619",
	doi = "https://doi.org/10.1016/j.apenergy.2016.12.016",
	url = "http://www.sciencedirect.com/science/article/pii/S0306261916317809",
	author = "P. Lombardi and F. Schwabe",
	keywords = "Battery sizing, Business model, Electricity market, Energy storage systems, Renewable energy sources, Sharing economy"
}

@ARTICLE{RZ-QZ-YH:2017, 
	author={R. Zhang and Q. Zhu and Y. Hayel}, 
	journal={IEEE Journal on Selected Areas in Communications}, 
	title={A Bi-Level Game Approach to Attack-Aware Cyber Insurance of Computer Networks}, 
	year={2017}, 
	volume={35}, 
	number={3}, 
	pages={779-794}, 
	keywords={computer network security;game theory;bilevel game approach;attack-aware cyber insurance;computer networks;bilevel game-theoretic model;principal-agent game;attack-aware insurance policy;zero operating profit;linear insurance policy;Insurance;Computer networks;Game theory;Communication networks;Intrusion detection;Risk management;Cyber insurance;network security;moral hazard;information asymmetry;network effects;security games;mechanism design}, 
	doi={10.1109/JSAC.2017.2672378}, 
	ISSN={0733-8716}, 
	month={March},}

@ARTICLE{QZ-et-al:2012, 
	author={Q. Zhu and C. Fung and R. Boutaba and T. Basar}, 
	journal={IEEE Journal on Selected Areas in Communications}, 
	title={GUIDEX: A Game-Theoretic Incentive-Based Mechanism for Intrusion Detection Networks}, 
	year={2012}, 
	volume={30}, 
	number={11}, 
	pages={2220-2230}, 
	keywords={computer network security;game theory;Internet;GUIDEX IDN system;game-theoretic incentive-based mechanism;intrusion detection networks;intrusion detection systems;collaborative IDS network;IDS peers;detection knowledge;intrusion assessment;game-theoretic modeling;trust management;resource management component;Nash equilibrium;iterative algorithm;discrete event simulation;security features;free riders;dishonest insiders;DoS attacks;Economics;Telecommunication services;Communication networks;Computer crime;Computer security;Security;Intrusion detection;Intrusion detection systems;collaborative networks;game theory;network optimization;incentive compatibility;network security and economics}, 
	doi={10.1109/JSAC.2012.121214}, 
	ISSN={0733-8716}, 
	month={December},}

@article{QT-et-al:2018,
	author={T Quack, M Bosinger, F Hebeler},
	title={Infrastructure-based digital maps for connected autonomous vehicles.},
	year={2018},
	publisher={Automatisierungstechnik},
	volume={66},
	number={2},
	doi={10.1515/auto-2017-0100},
	pages={183-191},
}

@inproceedings{FB-AG:2017,
	author="Fain, Brandon
	and Goel, Ashish
	and Munagala, Kamesh
	and Sakshuwong, Sukolsak",
	editor="R. Devanur, Nikhil
	and Lu, Pinyan",
	title="Sequential Deliberation for Social Choice",
	booktitle="Web and Internet Economics",
	year="2017",
	publisher="Springer International Publishing",
	address="Cham",
	pages="177--190",
	isbn="978-3-319-71924-5"
}

@article{JPB:2000,
	title = "The Gibbard–Satterthwaite theorem: a simple proof",
	journal = "Economics Letters",
	volume = "69",
	number = "3",
	pages = "319 - 322",
	year = "2000",
	issn = "0165-1765",
	doi = "https://doi.org/10.1016/S0165-1765(00)00312-8",
	url = "http://www.sciencedirect.com/science/article/pii/S0165176500003128",
	author = "Jean-Pierre Benoit",
	keywords = "Gibbard–Satterthwaite manipulability"
}

@inproceedings{PD-et-al:2011,
	author = {Dandekar, Pranav and Goel, Ashish and Govindan, Ramesh and Post, Ian},
	title = {Liquidity in Credit Networks: A Little Trust Goes a Long Way},
	booktitle = {Proceedings of the 12th ACM Conference on Electronic Commerce},
	series = {EC '11},
	year = {2011},
	isbn = {978-1-4503-0261-6},
	location = {San Jose, California, USA},
	pages = {147--156},
	numpages = {10},
	url = {http://doi.acm.org/10.1145/1993574.1993597},
	doi = {10.1145/1993574.1993597},
	acmid = {1993597},
	publisher = {ACM},
	address = {New York, NY, USA},
	keywords = {credit networks, currency, liquidity, reputation, trust},
} 

@proceedings{RA-et-al:2008,
	author = {Andersen, Reid and Borgs, Christian and Chayes, Jennifer and Feige, Uriel and Flaxman, Abraham and Kalai, Adam and Mirrokni, Vahab and Tennenholtz, Moshe},
	title = {Trust-based Recommendation Systems: An Axiomatic Approach},
	booktitle = {},
	year = {2008},
	month = {April},
	publisher = {WWW 2008},
	url = {https://www.microsoft.com/en-us/research/publication/trust-based-recommendation-systems-axiomatic-approach/},
	address = {},
	pages = {199-208},
	journal = {},
	volume = {},
	chapter = {},
	isbn = {},
}

@inproceedings{PG-et-al:2013,
	author = {Gupta, Pankaj and Goel, Ashish and Lin, Jimmy and Sharma, Aneesh and Wang, Dong and Zadeh, Reza},
	title = {WTF: The Who to Follow Service at Twitter},
	booktitle = {Proceedings of the 22Nd International Conference on World Wide Web},
	series = {WWW '13},
	year = {2013},
	isbn = {978-1-4503-2035-1},
	location = {Rio de Janeiro, Brazil},
	pages = {505--514},
	numpages = {10},
	url = {http://doi.acm.org/10.1145/2488388.2488433},
	doi = {10.1145/2488388.2488433},
	acmid = {2488433},
	publisher = {ACM},
	address = {New York, NY, USA},
	keywords = {graph processing, hadoop, link prediction},
} 

@inproceedings{HC-SD:2000,
	author = {Chen, Hao and Dumais, Susan},
	title = {Bringing Order to the Web: Automatically Categorizing Search Results},
	booktitle = {Proceedings of the SIGCHI Conference on Human Factors in Computing Systems},
	series = {CHI '00},
	year = {2000},
	isbn = {1-58113-216-6},
	location = {The Hague, The Netherlands},
	pages = {145--152},
	numpages = {8},
	url = {http://doi.acm.org/10.1145/332040.332418},
	doi = {10.1145/332040.332418},
	acmid = {332418},
	publisher = {ACM},
	address = {New York, NY, USA},
	keywords = {World Wide Web, classification, search, support vector machine, text categorization, text categrization, user interface, user study},
} 

@inproceedings{AA-MT:2005,
	author = {Altman, Alon and Tennenholtz, Moshe},
	title = {Ranking Systems: The PageRank Axioms},
	booktitle = {Proceedings of the 6th ACM Conference on Electronic Commerce},
	series = {EC '05},
	year = {2005},
	isbn = {1-59593-049-3},
	location = {Vancouver, BC, Canada},
	pages = {1--8},
	numpages = {8},
	url = {http://doi.acm.org/10.1145/1064009.1064010},
	doi = {10.1145/1064009.1064010},
	acmid = {1064010},
	publisher = {ACM},
	address = {New York, NY, USA},
	keywords = {PageRank, axiomatic theory, multi-agent systems},
} 

@Article{NB-GB-SZ:2017,
	author={N. Bof and G. Baggio and S. Zampieri}, 
	journal={IEEE Transactions on Control of Network Systems}, 
	title={On the Role of Network Centrality in the Controllability of Complex Networks}, 
	year={2017}, 
	volume={4}, 
	number={3}, 
	pages={643-653}, 
	keywords={complex networks;controllability;eigenvalues and eigenfunctions;graph theory;network theory (graphs);PageRank;centrality measure;complex networks;controllability problem;eigenvectors;network centrality;network matrix;network science;random graphs;stable networks;Artificial neural networks;Complex networks;Controllability;Eigenvalues and eigenfunctions;Focusing;Symmetric matrices;Complex networks;PageRank;controllability;network centrality}, 
	doi={10.1109/TCNS.2016.2550862}, 
	ISSN={}, 
	month={Sept},
}

@article{YC-JL:2017,
	title = "Delay-induced discrete-time consensus",
	journal = "Automatica",
	volume = "85",
	pages = "356 - 361",
	year = "2017",
	issn = "0005-1098",
	doi = "https://doi.org/10.1016/j.automatica.2017.07.059",
	url = "http://www.sciencedirect.com/science/article/pii/S0005109817304089",
	author = "Y. Chen and J. Lü",
	keywords = "Distributed coordination algorithm, Consensus, SIA matrix, SIP matrix"
}

@article{YZ-SL:2017,
	title = "Perturbing consensus for complexity: A finite-time discrete biased min-consensus under time-delay and asynchronism",
	journal = "Automatica",
	volume = "85",
	pages = "441 - 447",
	year = "2017",
	issn = "0005-1098",
	doi = "https://doi.org/10.1016/j.automatica.2017.08.014",
	url = "http://www.sciencedirect.com/science/article/pii/S0005109817304351",
	author = "Y. Zhang and S. Li",
	keywords = "Consensus, Min-consensus, Time-delay, Asynchronism, Maze solving, Shortest path planning, Complete coverage"
}

@article{CA-FC:2018,
	title = "Signed bounded confidence models for opinion dynamics",
	journal = "Automatica",
	volume = "93",
	pages = "114 - 125",
	year = "2018",
	issn = "0005-1098",
	doi = "https://doi.org/10.1016/j.automatica.2018.03.064",
	url = "http://www.sciencedirect.com/science/article/pii/S0005109818301596",
	author = "C. Altafini and F. Ceragioli",
	keywords = "Opinion dynamics, Bounded confidence models, Signed graphs, ODEs with discontinuous right-hand-side"
}

@article{HZ-XH:2018,
	title = "Consensus control for linear systems with optimal energy cost",
	journal = "Automatica",
	volume = "93",
	pages = "83 - 91",
	year = "2018",
	issn = "0005-1098",
	doi = "https://doi.org/10.1016/j.automatica.2018.03.044",
	url = "http://www.sciencedirect.com/science/article/pii/S0005109818301316",
	author = "H. Zhang and X. Hu",
	keywords = "Consensus control, Multi-agent systems, Optimal control, Semi-definite programming, Distributed optimization"
}

@article{FM-et-al:2018,
	title = "A hybrid stochastic game for secure control of cyber-physical systems",
	journal = "Automatica",
	volume = "93",
	pages = "55 - 63",
	year = "2018",
	issn = "0005-1098",
	doi = "https://doi.org/10.1016/j.automatica.2018.03.012",
	url = "http://www.sciencedirect.com/science/article/pii/S0005109818300992",
	author = "F. Miao and Q. Zhu and M. Pajic and G. J. Pappas",
	keywords = "Stochastic game, Secure control, Saddle-point equilibrium"
}

@article{MZ-EF:2016,
	title = "Distributed robust adaptive equilibrium computation for generalized convex games",
	journal = "Automatica",
	volume = "63",
	pages = "82 - 91",
	year = "2016",
	issn = "0005-1098",
	doi = "https://doi.org/10.1016/j.automatica.2015.10.012",
	url = "http://www.sciencedirect.com/science/article/pii/S0005109815004124",
	author = "M. Zhu and E. Frazzoli",
	keywords = "Distributed control, Game theory, Learning in games"
}

@article{AM-PJ-FB:2012,
	title = "Eulerian Opinion Dynamics with Bounded Confidence and Exogenous Inputs*",
	journal = "IFAC Proceedings Volumes",
	volume = "45",
	number = "26",
	pages = "270 - 275",
	year = "2012",
	note = "3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems",
	issn = "1474-6670",
	doi = "https://doi.org/10.3182/20120914-2-US-4030.00059",
	url = "http://www.sciencedirect.com/science/article/pii/S147466701534845X",
	author = "A. Mirtabatabaei and P. Jia and F. Bullo",
	keywords = "opinion manipulation, Eulerian, bounded-confidence, non-Bayesian update rule"
}

@article{PY-YH-FL:2016,
	title = "Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems",
	journal = "Automatica",
	volume = "74",
	pages = "259 - 269",
	year = "2016",
	issn = "0005-1098",
	doi = "https://doi.org/10.1016/j.automatica.2016.08.007",
	url = "http://www.sciencedirect.com/science/article/pii/S0005109816303302",
	author = "P. Yi and Y. Hong and F. Liu",
	keywords = "Resource allocation, Distributed optimization, Multi-agent system, Plug-and-play algorithm, Gradient flow, Projected dynamical system, Economic dispatch"
}

@article{LFR-et-al:2018,
	author={L. F. Ramírez and B. Saldivar and J. C. Ávila Vilchis and S. Montes de Oca},
	journal={IET Control Theory Applications},
	title={Lyapunov #8211;Krasovskii approach to the stability analysis of the milling process},
	year={2018},
	volume={12},
	number={9},
	pages={1332-1339},
	keywords={Lyapunov methods;asymptotic stability;cutting;delay systems;delays;linear matrix inequalities;milling;stability;vibrations;Lyapunov-Krasovskii approach;important problem;manufacturing industry;milling process;operational guidelines;out-of-process analysis;proper selection;self-excited milling vibrations;stability analysis;stable vibration-free process;time-delay systems;time-delay two degree},
	doi={10.1049/iet-cta.2017.1252},
	ISSN={1751-8644},
	month={},
}

@article{PKM-DC-DEQ:2018,
	title = "Sparse and constrained stochastic predictive control for networked systems",
	journal = "Automatica",
	volume = "87",
	pages = "40 - 51",
	year = "2018",
	issn = "0005-1098",
	doi = "https://doi.org/10.1016/j.automatica.2017.09.013",
	url = "http://www.sciencedirect.com/science/article/pii/S0005109817304831",
	author = "P. K. Mishra and D. Chatterjee and D. E. Quevedo",
	keywords = "Erasure channel, Stochastic predictive control, Networked system, Multiplicative noise, Unreliable channel, Sparsity"
}

@article{FS-LP:2017,
	title = "Distributed Nash Equilibrium Seeking via the Alternating Direction Method of Multipliers",
	journal = "IFAC-PapersOnLine",
	volume = "50",
	number = "1",
	pages = "6166 - 6171",
	year = "2017",
	note = "20th IFAC World Congress",
	issn = "2405-8963",
	doi = "https://doi.org/10.1016/j.ifacol.2017.08.983",
	url = "http://www.sciencedirect.com/science/article/pii/S240589631731457X",
	author = "F. Salehisadaghiani and L. Pavel",
	keywords = "Nash games, Game theory, Distributed control,"
}

@inproceedings{EN-FP-JC:2017,
	author={E. Nozari and F. Pasqualetti and J. Cortés},
	booktitle={2017 American Control Conference (ACC)},
	title={Time-invariant versus time-varying actuator scheduling in complex networks},
	year={2017},
	volume={},
	number={},
	pages={4995-5000},
	keywords={actuators;complex networks;controllability;discrete time systems;graph theory;linear systems;scheduling;complex networks;controllability Gramian;network controllability;network dynamics;nodal communicability;single-input discrete-time linear system;time-invariant actuator scheduling;time-invariant actuator selection;time-varying actuator scheduling;undirected graph;Actuators;Aerospace electronics;Complex networks;Controllability;Eigenvalues and eigenfunctions;Measurement;Optimization},
	doi={10.23919/ACC.2017.7963729},
	ISSN={},
	month={May}
}


@article{RH-UK:2002,
author = {R. Hegselmann and U. Krause},
title = {Opinion dynamics and bounded confidence models, analysis and simulations},
journal = {JASSS},
year = {2002},
volume = {5},
number = {3},
keywords = {Bounded Confidence; Consensus/dissent; Nonlinear Dynamical; Opinion Dynamics},
month = {June},
url = {http://jasss.soc.surrey.ac.uk/5/3/2.html}
}

@article{IB-AL:2018, 
	author={I. Bistritz and A. Leshem}, 
	journal={IEEE Transactions on Automatic Control}, 
	title={Approximate Best-Response Dynamics in Random Interference Games}, 
	year={2018}, 
	volume={63}, 
	number={6}, 
	pages={1459-1472}, 
	keywords={Convergence;Games;Geometry;Interference;Nash equilibrium;Resource management;Wireless networks;Ad-hoc networks;best-response (BR) dynamics;interference channels;martingales;random games}, 
	doi={10.1109/TAC.2017.2749139}, 
	ISSN={0018-9286}, 
	month={June},
}

@article{FS-LP:2016,
	title = "Distributed Nash equilibrium seeking: A gossip-based algorithm",
	journal = "Automatica",
	volume = "72",
	pages = "209 - 216",
	year = "2016",
	issn = "0005-1098",
	doi = "https://doi.org/10.1016/j.automatica.2016.06.004",
	url = "http://www.sciencedirect.com/science/article/pii/S0005109816302308",
	author = "F. Salehisadaghiani and L. Pavel",
	keywords = "Distributed algorithms, Noncooperative games, Communication graph"
}

@article{FS-LP:2018,
	title = "Distributed Nash equilibrium seeking in networked graphical games",
	journal = "Automatica",
	volume = "87",
	pages = "17 - 24",
	year = "2018",
	issn = "0005-1098",
	doi = "https://doi.org/10.1016/j.automatica.2017.09.016",
	url = "http://www.sciencedirect.com/science/article/pii/S0005109817304867",
	author = "F. Salehisadaghiani and L. Pavel",
	keywords = "Distributed algorithms, Noncooperative games, Communication graph, Interference graph"
}

@article{OAS-MJ:2017, 
	author={O. A. Sichani and M. Jalili}, 
	journal={IEEE Transactions on Network Science and Engineering}, 
	title={Inference of Hidden Social Power Through Opinion Formation in Complex Networks}, 
	year={2017}, 
	volume={4}, 
	number={3}, 
	pages={154-164}, 
	keywords={convex programming;maximum likelihood estimation;social networking (online);time series;Jensen inequality;complex networks;convex optimization problem;hidden social power;maximum-a-posteriori method;opinion formation;opinion values;social networks analysis;time series;Cultural differences;Estimation;Mathematical model;Numerical models;Optimization;Social network services;Time series analysis;Complex networks;agent-based simulation;convex optimization;expectation maximization;opinion formation;social power}, 
	doi={10.1109/TNSE.2017.2691405}, 
	ISSN={2327-4697}, 
	month={July},
}

@article{SEP-et-al:2017, 
	author={S. E. Parsegov and A. V. Proskurnikov and R. Tempo and N. E. Friedkin}, 
	journal={IEEE Transactions on Automatic Control}, 
	title={Novel Multidimensional Models of Opinion Dynamics in Social Networks}, 
	year={2017}, 
	volume={62}, 
	number={5}, 
	pages={2270-2285}, 
	keywords={behavioural sciences computing;social networking (online);actor prejudices;agent opinions;asynchronous gossip-based protocols;multidimensional extension;multidimensional models;opinion dynamics;real social group complex behavior;social networks;synchronous communication;Biological system modeling;Computational modeling;Convergence;Electronic mail;Mathematical model;Social network services;Stability analysis;Opinion dynamics;decentralized algorithm;multi-agent system;social network}, 
	doi={10.1109/TAC.2016.2613905}, 
	ISSN={0018-9286}, 
	month={May}
}

@article{YZ-YZ-LW:2011,
title = {Consensus of heterogeneous multi-agent systems},
author = {Y. Zheng, Y. Zhu and L. Wang},
year = {2011},
doi = {10.1049/iet-cta.2011.0033},
volume = 5,
keywords = {multi-agent systems; Lyapunov methods; directed graphs; first-order integrator agents; graph theory; undirected connected graphs; heterogeneous multi-agent systems; consensus problem; Lyapunov direct method; second-order integrator agents; saturated consensus protocol; linear consensus protocol}
}

@article{WS-GC-YH:2017,
title = "Noise leads to quasi-consensus of Hegselmann–Krause opinion dynamics",
journal = "Automatica",
volume = "85",
pages = "448 - 454",
year = "2017",
issn = "0005-1098",
doi = "https://doi.org/10.1016/j.automatica.2017.08.008",
url = "http://www.sciencedirect.com/science/article/pii/S0005109817304296",
author = "W. Su and G. Chen and Y. Hong",
keywords = "Opinion dynamics, Quasi-consensus, Hegselmann–Krause model, Random noise, Multi-agent systems"
}


@article{MEV-IZ:2017,
title = "On the consensus of homogeneous multi-agent systems with arbitrarily switching topology",
journal = "Automatica",
volume = "84",
pages = "79 - 85",
year = "2017",
issn = "0005-1098",
doi = "https://doi.org/10.1016/j.automatica.2017.07.011",
url = "http://www.sciencedirect.com/science/article/pii/S0005109817303539",
author = "M. E. Valcher and I. Zorzan",
keywords = "Consensus, Homogeneous multi-agent system, Communication graph, Switched system, Stabilizability of switched system, Quadratic positive definite Lyapunov function"
}

@article{ROS-JAF-RMM:2017,
author={R. Olfati-Saber and J. A. Fax and R. M. Murray},
journal={Proceedings of the IEEE},
title={Consensus and Cooperation in Networked Multi-Agent Systems},
year={2007},
volume={95},
number={1},
pages={215-233},
keywords={control systems;multi-agent systems;algebraic graph theory;consensus algorithms;control theory;cooperative control;graph Laplacians;information diffusion;information fusion;matrix theory;networked control systems;networked dynamic systems;networked multiagent systems;Algorithm design and analysis;Convergence;Failure analysis;Information analysis;Matrices;Multiagent systems;Network topology;Performance analysis;Robustness;Sensor fusion;Consensus algorithms;cooperative control;flocking;graph Laplacians;information fusion;multi-agent systems;networked control systems;synchronization of coupled oscillators},
doi={10.1109/JPROC.2006.887293},
ISSN={0018-9219},
month={Jan},}

@article{KKO-MCP-HSA:2015,
title = 		"A survey of multi-agent formation control",
journal = 		"Automatica",
volume = 		"53",
pages = 		"424 - 440",
year = 		"2015",
issn = 		"0005-1098",
doi = 		"https://doi.org/10.1016/j.automatica.2014.10.022",
url = 		"http://www.sciencedirect.com/science/article/pii/S0005109814004038",
author = 		"K.-K. Oh and M.-C. Park and H.-S. Ahn",
keywords = 	"Formation control, Position-based control, Displacement-based control, Distance-based control"
}

@article{SZ-et-al:2018,
author = 		{S. Zhao and D. V. Dimarogonas and Z. Sun and D. Bauso},
journal = 		{IEEE Transactions on Automatic Control},
title = 		{A General Approach to Coordination Control of Mobile Agents With Motion Constraints},
year = 		{2018},
volume = 		{63},
number = 		{5},
pages = 		{1509-1516},
keywords = 	{Aerospace electronics;Collision avoidance;Convergence;Dynamics;Mobile agents;Multi-agent systems;Sun;coordination control;multi-agent systems;nonholonomic constraints;obstacle avoidance;velocity saturation},
doi = 		{10.1109/TAC.2017.2750924},
ISSN = 		{0018-9286},
month = 		{May}
}

@article{ZL-et-al:2018,
author = 		{Z. Li and Z. Ding and J. Sun and Z. Li},
journal = 		{IEEE Transactions on Automatic Control},
title = 		{Distributed Adaptive Convex Optimization on Directed Graphs via Continuous-Time Algorithms},
year = 		{2018},
volume = 		{63},
number = 		{5},
pages = 		{1434-1441},
keywords = 	{Algorithm design and analysis;Convergence;Couplings;Eigenvalues and eigenfunctions;Heuristic algorithms;Linear programming;Optimization;Adaptive control;consensus control;distributed convex optimization},
doi = 		{10.1109/TAC.2017.2750103},
ISSN = 		{0018-9286},
month = 		{May}
}

@article{VMP-MMZ:2017,
author = 	{V. M. Preciado and M. M. Zavlanos},
journal = 	{IEEE Transactions on Control of Network Systems},
title = 	{Distributed Network Design for Laplacian Eigenvalue Placement},
year =		{2017},
volume =	{4},
number =	{3},
pages =		{598-609},
keywords =	{eigenvalues and eigenfunctions;graph theory;iterative methods;matrix algebra;minimisation;multi-agent systems;network theory (graphs);Laplacian eigenvalue spectrum;Laplacian spectral moments;algorithm iteration;autonomous agents;communication network;distributed iterative algorithm;distributed network design;global edge addition/deletion;laplacian eigenvalue placement;myopic views;pseudometric minimization;Autonomous agents;Control systems;Distributed algorithms;Eigenvalues and eigenfunctions;Iterative methods;Laplace equations;Symmetric matrices;Algebraic graph theory;complex network design;distributed control;eigenvalue placement},
doi =		{10.1109/TCNS.2016.2544249},
ISSN =		{},
month =		{Sept}
}

@article{AVP-RT:2017,
title = "A tutorial on modeling and analysis of dynamic social networks. Part I",
journal = "Annual Reviews in Control",
volume = "43",
pages = "65 - 79",
year = "2017",
issn = "1367-5788",
doi = "https://doi.org/10.1016/j.arcontrol.2017.03.002",
url = "http://www.sciencedirect.com/science/article/pii/S1367578817300172",
author = "A. V. Proskurnikov and R. Tempo",
keywords = "Social network, Opinion dynamics, Multi-agent systems, Distributed algorithms"

}

@article{PJ-NEF-FB:2017,
title = 		{Opinon dynamics and social power evolution over reducible influence network},
author = 		{P. Jia, N. E. Friedkin, and F. Bullo},
year =		2017
}


@inproceedings{AC-ADS-SV:2015, 
author={A. Chatterjee and A. D. Sarwate and S. Vishwanath}, 
booktitle={2015 49th Asilomar Conference on Signals, Systems and Computers}, 
title={Generalized opinion dynamics from local optimization rules}, 
year={2015}, 
volume={}, 
number={}, 
pages={1075-1079}, 
keywords={minimisation;multi-agent systems;quadratic programming;sentiment analysis;social networking (online);HK model;Hegselmann-Krause model;agent opinion dynamics;online social network;optimization rule;quadratic cost-minimization rule;Computers;Convergence;Cost function;Electronic mail;Mathematical model;Social network services;consensus;opinion dynamics;social ne?tworks}, 
doi={10.1109/ACSSC.2015.7421304}, 
ISSN={}, 
month={Nov}
}

@article{AVP-ASM-MC:2016, 
author={A. V. Proskurnikov and A. S. Matveev and M. Cao}, 
journal={IEEE Transactions on Automatic Control}, 
title={Opinion Dynamics in Social Networks With Hostile Camps: Consensus vs. Polarization}, 
year={2016}, 
volume={61}, 
number={6}, 
pages={1524-1536}, 
keywords={graph theory;multi-agent systems;network theory (graphs);social sciences;arbitrary time-varying signed graph;attractive couplings;cut-balanced graphs;first-order consensus algorithms;hostile camps;modulus consensus;multi-agent consensus;necessary condition;network topology;opinion dynamics;repulsive couplings;social networks;static signed graph;sufficient conditions;uniform graph connectivity;Convergence;Couplings;Heuristic algorithms;Network topology;Protocols;Social network services;Topology;Agents;Opinion dynamics;agents;clustering;consensus;opinion dynamics}, 
doi={10.1109/TAC.2015.2471655}, 
ISSN={0018-9286}, 
month={June}
}

%%%%%%%%%% Survey paperss %%%%%%%%%%%%%%%%

@article{MMH-et-al:2013,
	author = {Manshaei, Mohammad Hossein and Zhu, Quanyan and Alpcan, Tansu and Bac\c{s}ar, Tamer and Hubaux, Jean-Pierre},
	title = {Game Theory Meets Network Security and Privacy},
	journal = {ACM Comput. Surv.},
	issue_date = {June 2013},
	volume = {45},
	number = {3},
	month = {Jul},
	year = {2013},
	issn = {0360-0300},
	pages = {25:1--25:39},
	articleno = {25},
	numpages = {39},
	url = {http://doi.acm.org/10.1145/2480741.2480742},
	doi = {10.1145/2480741.2480742},
	acmid = {2480742},
	publisher = {ACM},
	address = {New York, NY, USA},
	keywords = {Game theory, cryptography, intrusion detection system, location privacy, multiparty computation, network security and privacy, revocation, wireless security},
} 

%%%%%%%%%%%% BOOKS %%%%%%%%%%%

@book{LL-GM-BS-rderts,
   title =     {Academic-Uml For Real Design Of Embedded Real-Time Systems},
   author =    {Luciano Lavagno, Grant Martin, Bran Selic},
   publisher = {Kluwer},
   isbn =      {0-306-48738-1},
   year =      {2003},
   series =    {},
   edition =   {},
   volume =    {},
   url =       {http://gen.lib.rus.ec/book/index.php?md5=A1D15752ED967B9D1BCD94FCE2CBA867}
}

@book{OZS-io,
   title =     {Industrial organization},
   author =    {O. Shy},
   publisher = {The MIT Press},
   year =      {1996},
   series =    {},
   edition =   {},
   volume =    {},
}

@book{WR-pma,
   title =     {Principles of mathematical analysis},
   author =    {W. Rudin},
   publisher = {McGraw-Hill},
   year =      {1976},
   series =    {International series in pure and applied mathematics},
   edition =   {3d ed},
   volume =    {},
}

@book{RWY-itnc,
   title =     {Information Theory and Network Coding},
   author =    {R. W. Yeung},
   publisher = {Springer},
   year =      {2008},
   series =    {Information Technology: Transmission, Processing and Storage},
   edition =   {2008},
   volume =    {},
}

@book{DEK-oct,
   title =     {Optimal control theory: An introduction},
   author =    {D. E. Kirk},
   publisher = {Dover Publications},
   year =      {2004},
   series =    {},
   edition =   {},
   volume =    {},
}

@book{DPB-dpoc,
   title =     {Dynamic programming and optimal control},
   author =    {D. P. Bertsekas},
   publisher = {Athena Scientific},
   year =      {2005},
   series =    {},
   edition =   {3rd},
   volume =    {Vol.1},
}

@book{MM-ES-SZ:2013,
	title =     {Game Theory},
	author =    {M. Maschler and E. Solan and S. Zamir},
	publisher = {Cambridge University Press},
	year =      {2013},
	series =    {},
	edition =   {},
	volume =    {}
}

@book{WMW-lmc,
   title =     {Linear Multivariable Control: A Geometric Approach},
   author =    {W. M. Wonham},
   publisher = {Springer},
   year =      {1985},
   series =    {Applications of Mathematics},
   edition =   {3rd},
   volume =    {10},
}

@book{NSN-cse,
	author = {N. S. Nise},
	title = {Control systems engineering},
	publisher = {Wiley},
	year =      {2004},
}

@book{AP-SUP-prvansp,
	title =     {Probability, Random Variables and Stochastic Processes},
	author =    {A. Papoulis and S. U. Pillai},
	publisher = {McGraw-Hill Companies},
	year =      {1991},
}

@book{KJA-TH-apc,
	title = {Advance PID Control},
	author = {K. J. Astrom and T. Hagglund},
	publisher = {ISA Instrumentation, Systems and Automation Society},
	year = {2006},
}

@book{BWB-pc,
	title = {Process Control: Modeling, Design and Simulation},
	author = {B. W. Bequette},
	publisher = {Prentice Hall},
	year = {2003},
}

@book{DL-cvoct,
	title = {Calculus of Variations and Optimal Control Theory},
	author = {D. Liberzon},
	publisher = {Princeton University Press},
	year = {2012},
}

%%%%%%%%%%%% ONLINE %%%%%%%%%%%
@online{wiki-cayley_hamilton_theorem,
	title = {Cayley-Hamilton theorem},
	publisher = {Wikipedia},
	url = {https://en.wikipedia.org/wiki/Cayley%E2%80%93Hamilton_theorem}
}

@online{wiki-gamma_function,
	title = {Gamma function},
	publisher  = {Wikipedia},
	url = {https://en.wikipedia.org/wiki/Gamma_function},
}

@online{wiki-leibniz_integration_rule,
	title = {Leibniz integral rule},
	publisher = {Wikipedia},
	url = {https://en.wikipedia.org/wiki/Leibniz_integral_rule}
}

%% Kilobot papers %% 
@article{rubenstein2014kilobot,
  title={Kilobot: A low cost robot with scalable operations designed for collective behaviors},
  author={Rubenstein, Michael and Ahler, Christian and Hoff, Nick and Cabrera, Adrian and Nagpal, Radhika},
  journal={Robotics and Autonomous Systems},
  volume={62},
  number={7},
  pages={966--975},
  year={2014},
  publisher={Elsevier}
}



@inproceedings{mclurkin2006speaking,
  title={Speaking Swarmish: Human-Robot Interface Design for Large Swarms of Autonomous Mobile Robots.},
  author={McLurkin, James and Smith, Jennifer and Frankel, James and Sotkowitz, David and Blau, David and Schmidt, Brian},
  booktitle={AAAI spring symposium: to boldly go where no human-robot team has gone before},
  volume={72},
  year={2006}
}