diff options
Diffstat (limited to 'paper')
34 files changed, 7284 insertions, 0 deletions
diff --git a/paper/adaptive_sseding.bib b/paper/adaptive_sseding.bib new file mode 100644 index 0000000..e08486e --- /dev/null +++ b/paper/adaptive_sseding.bib @@ -0,0 +1,1122 @@ +@book{shapiro2009lectures, + title={Lectures on stochastic programming: modeling and theory}, + author={Shapiro, Alexander and Dentcheva, Darinka and Ruszczy{\'n}ski, Andrzej}, + volume={9}, + year={2009}, + publisher={Society for Industrial Mathematics} +} + +@article{feld1991, + title={Why your friends have more friends than you do}, + author={Feld, Scott L}, + journal={American Journal of Sociology}, + pages={1464--1477}, + year={1991}, + publisher={JSTOR} +} + +@Article{NWF78, + author = {G. L. Nemhauser and L. A. Wolsey and M. L. Fisher}, + title = {An analysis of approximations for maximizing submodular set functions II}, + journal = {Math. Programming Study 8}, + year = {1978}, + OPTkey = {}, + OPTvolume = {8}, + pages = {73--87}, +} + +@article{GMC, + title={The generalized maximum coverage problem}, + author={Cohen, Reuven and Katzir, Liran}, + journal={Information Processing Letters}, + volume={108}, + number={1}, + pages={15--22}, + year={2008}, + publisher={Elsevier} +} + +@article{holley1975ergodic, + title={Ergodic theorems for weakly interacting infinite systems and the voter model}, + author={Holley, Richard A and Liggett, Thomas M}, + journal={The annals of probability}, + pages={643--663}, + year={1975}, + publisher={JSTOR} +} + + +@article{Voter, + author = {Eyal Even-Dar and + Asaf Shapira}, + title = {A note on maximizing the spread of influence in social networks}, + journal = {Inf. Process. Lett.}, + volume = {111}, + number = {4}, + year = {2011}, + pages = {184-187}, + ee = {http://dx.doi.org/10.1016/j.ipl.2010.11.015}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{feige1998threshold, + title={A threshold of ln n for approximating set cover}, + author={Feige, Uriel}, + journal={Journal of the ACM (JACM)}, + volume={45}, + number={4}, + pages={634--652}, + year={1998}, + publisher={ACM} +} + + @MISC{StochProg, + author = {Maarten H. {van der Vlerk}}, + title = {Stochastic Programming Bibliography}, + year = {1996-2007}, + howpublished = {World Wide Web, \url{http://www.eco.rug.nl/mally/spbib.html}} +} + +@article{SampleAverage, + title={The sample average approximation method for stochastic discrete optimization}, + author={Kleywegt, Anton J and Shapiro, Alexander and Homem-de-Mello, Tito}, + journal={SIAM Journal on Optimization}, + volume={12}, + number={2}, + pages={479--502}, + year={2002}, + publisher={SIAM} +} + +@inproceedings{immorlica2004costs, + title={On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems}, + author={Immorlica, Nicole and Karger, David and Minkoff, Maria and Mirrokni, Vahab S}, + booktitle={Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms}, + pages={691--700}, + year={2004}, + organization={Society for Industrial and Applied Mathematics} +} + +@incollection{ravi2004hedging, + title={Hedging uncertainty: Approximation algorithms for stochastic optimization problems}, + author={Ravi, R and Sinha, Amitabh}, + booktitle={Integer programming and combinatorial optimization}, + pages={101--115}, + year={2004}, + publisher={Springer} +} + +@inproceedings{gupta2004boosted, + title={Boosted sampling: approximation algorithms for stochastic optimization}, + author={Gupta, Anupam and P{\'a}l, Martin and Ravi, R and Sinha, Amitabh}, + booktitle={Proceedings of the thirty-sixth annual ACM symposium on Theory of computing}, + pages={417--426}, + year={2004}, + organization={ACM} +} + +@incollection{gupta2005wednesday, + title={What about wednesday? approximation algorithms for multistage stochastic optimization}, + author={Gupta, Anupam and P{\'a}l, Martin and Ravi, Ramamoorthi and Sinha, Amitabh}, + booktitle={Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques}, + pages={86--98}, + year={2005}, + publisher={Springer} +} + +@inproceedings{shmoys2004stochastic, + title={Stochastic optimization is (almost) as easy as deterministic optimization}, + author={Shmoys, David B and Swamy, Chaitanya}, + booktitle={Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on}, + pages={228--237}, + year={2004}, + organization={IEEE} +} + +@article{shmoys2006approximation, + title={An approximation scheme for stochastic linear programming and its application to stochastic integer programs}, + author={Shmoys, David B and Swamy, Chaitanya}, + journal={Journal of the ACM (JACM)}, + volume={53}, + number={6}, + pages={978--1012}, + year={2006}, + publisher={ACM} +} + +@inproceedings{swamy2005sampling, + title={Sampling-based approximation algorithms for multi-stage stochastic optimization}, + author={Swamy, Chaitanya and Shmoys, David B}, + booktitle={Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on}, + pages={357--366}, + year={2005}, + organization={IEEE} +} + +@inproceedings{srinivasan2007approximation, + title={Approximation algorithms for stochastic and risk-averse optimization}, + author={Srinivasan, Aravind}, + booktitle={Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms}, + pages={1305--1313}, + year={2007}, + organization={Society for Industrial and Applied Mathematics} +} + +@article{kleinberg2000allocating, + title={Allocating bandwidth for bursty connections}, + author={Kleinberg, Jon and Rabani, Yuval and Tardos, {\'E}va}, + journal={SIAM Journal on Computing}, + volume={30}, + number={1}, + pages={191--217}, + year={2000}, + publisher={SIAM} +} + +@inproceedings{dean2004approximating, + title={Approximating the stochastic knapsack problem: The benefit of adaptivity}, + author={Dean, Brian C and Goemans, Michel X and Vondrdk, J}, + booktitle={Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on}, + pages={208--217}, + year={2004}, + organization={IEEE} +} + +@inproceedings{gupta2012approximation, + title={Approximation algorithms for stochastic orienteering}, + author={Gupta, Anupam and Krishnaswamy, Ravishankar and Nagarajan, Viswanath and Ravi, R}, + booktitle={Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms}, + pages={1522--1538}, + year={2012}, + organization={SIAM} +} + +@article{golovin2011adaptive, + title={Adaptive submodularity: Theory and applications in active learning and stochastic optimization}, + author={Golovin, Daniel and Krause, Andreas}, + journal={Journal of Artificial Intelligence Research}, + volume={42}, + number={1}, + pages={427--486}, + year={2011}, + publisher={AI Access Foundation} +} + +@inproceedings{kempe2003maximizing, + title={Maximizing the spread of influence through a social network}, + author={Kempe, David and Kleinberg, Jon and Tardos, {\'E}va}, + booktitle={Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining}, + pages={137--146}, + year={2003}, + organization={ACM} +} + + +@incollection{asadpour2008stochastic, + title={Stochastic submodular maximization}, + author={Asadpour, Arash and Nazerzadeh, Hamid and Saberi, Amin}, + booktitle={Internet and Network Economics}, + pages={477--489}, + year={2008}, + publisher={Springer} +} + + +@inproceedings{mturk, + title = {Mechanical Turk}, + booktitle = {https://www.mturk.com/}, + +} + +@inproceedings{SM11, + author = {Yaron Singer and + Manas Mittal}, + title = {Mechanisms for Online Labor Markets}, + booktitle = {Workshop on Human Computation }, + year = {2011}, +} + + +@inproceedings{GR11, + author = {Arpita Ghosh and + Aaron Roth}, + title = {Selling privacy at auction}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2011}, + pages = {199-208}, + } + +@inproceedings{KDD11, + author = {Michael Mathioudakis and Francesco Bonchi and Carlos Castillo and Aristides Gionis and Antti Ukkonen}, + title = {Sparsi�cation of Influence Networks}, + booktitle = {KDD}, + year = {2011}, + } + + +@inproceedings{HIMM11, + author = {Nima Haghpanah and + Nicole Immorlica and + Vahab S. Mirrokni and + Kamesh Munagala}, + title = {Optimal auctions with positive network externalities}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2011}, + pages = {11-20}, + ee = {http://doi.acm.org/10.1145/1993574.1993577}, + crossref = {DBLP:conf/sigecom/2011}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + +@inproceedings{DPS11, + author = {Shahar Dobzinski and Christos Papadimitriou and Yaron Singer}, + title = {Mechanisms for Complement-Free Procurement}, + booktitle = {EC}, + year = {2011}, + } + + + @inproceedings{BHMW11, + author = {Eytan Bakshy and + Jake M. Hofman and + Winter A. Mason and + Duncan J. Watts}, + title = {Everyone's an influencer: quantifying influence on twitter}, + booktitle = {WSDM}, + year = {2011}, +} + + + +@inproceedings{S10, + author = {Yaron Singer}, + title = {Budget Feasible Mechanisms}, + booktitle = {FOCS}, + year = {2010}, + pages = {765-774}, + ee = {http://dx.doi.org/10.1109/FOCS.2010.78}, + crossref = {DBLP:conf/focs/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{GBL10, + author = {Amit Goyal and + Francesco Bonchi and + Laks V. S. Lakshmanan}, + title = {Learning influence probabilities in social networks}, + booktitle = {WSDM}, + year = {2010}, + pages = {241-250}, + ee = {http://doi.acm.org/10.1145/1718487.1718518}, + crossref = {DBLP:conf/wsdm/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{YC10, + author = {Jiang Yang and + Scott Counts}, + title = {Predicting the Speed, Scale, and Range of Information Diffusion + in Twitter}, + booktitle = {ICWSM}, + year = {2010}, + } + +@inproceedings{LKGFVG07, + author = {Jure Leskovec and + Andreas Krause and + Carlos Guestrin and + Christos Faloutsos and + Jeanne M. VanBriesen and + Natalie S. Glance}, + title = {Cost-effective outbreak detection in networks}, + booktitle = {KDD}, + year = {2007}, + pages = {420-429}, + ee = {http://doi.acm.org/10.1145/1281192.1281239}, + crossref = {DBLP:conf/kdd/2007}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + +@article{ES11, + author = {Eyal Even-Dar and + Asaf Shapira}, + title = {A note on maximizing the spread of influence in social networks}, + journal = {Inf. Process. Lett.}, + volume = {111}, + number = {4}, + year = {2011}, + pages = {184-187}, + ee = {http://dx.doi.org/10.1016/j.ipl.2010.11.015}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + +@inproceedings{MS10, + author = {Elchanan Mossel and + Grant Schoenebeck}, + title = {Reaching Consensus on Social Networks}, + booktitle = {ICS}, + year = {2010}, + pages = {214-229}, + ee = {http://conference.itcs.tsinghua.edu.cn/ICS2010/content/papers/18.html}, + crossref = {DBLP:conf/innovations/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{MR07, + author = {Elchanan Mossel and + S{\'e}bastien Roch}, + title = {On the submodularity of influence in social networks}, + booktitle = {STOC}, + year = {2007}, + pages = {128-134}, + } + + @INPROCEEDINGS{KR05, + author = {Jon Kleinberg and Prabhakar Raghavan}, + title = {Query Incentive Networks}, + booktitle = {Proc. 46th IEEE Symposium on Foundations of Computer Science}, + year = {2005}, + pages = {132--141} +} + + @inproceedings{RD02, + author = {Matthew Richardson and + Pedro Domingos}, + title = {Mining knowledge-sharing sites for viral marketing}, + booktitle = {KDD}, + year = {2002}, + pages = {61-70}, + } + + + @inproceedings{DR01, + author = {Pedro Domingos and + Matthew Richardson}, + title = {Mining the network value of customers}, + booktitle = {KDD}, + year = {2001}, + pages = {57-66}, + } + + + + @inproceedings{RLK10, + author = {Manuel Gomez-Rodriguez and + Jure Leskovec and + Andreas Krause}, + title = {Inferring networks of diffusion and influence}, + booktitle = {KDD}, + year = {2010}, + pages = {1019-1028}, +} + + @inproceedings{LAH06, + author = {Jure Leskovec and + Lada A. Adamic and + Bernardo A. Huberman}, + title = {The dynamics of viral marketing}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2006}, + pages = {228-237}, +} + + + + +@inproceedings{CKT10, + author = {Flavio Chierichetti and + Ravi Kumar and + Andrew Tomkins}, + title = {Max-cover in map-reduce}, + booktitle = {WWW}, + year = {2010}, + pages = {231-240}, + ee = {http://doi.acm.org/10.1145/1772690.1772715}, + crossref = {DBLP:conf/www/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + +@article{CGL11, + author = {Ning Chen and + Nick Gravin and + Pinyan Lu}, + title = {On the Approximability of Budget Feasible Mechanisms}, + booktitle = {SODA}, + year = {2011}, +} + + + +@inproceedings{fbdata, + author= {Minas Gjoka and Maciej Kurant and Carter T. Butts and Athina Markopoulou}, + title= { {Walking in Facebook: A Case Study of Unbiased Sampling of OSNs} }, + booktitle = {Proceedings of IEEE INFOCOM '10}, + address = {San Diego, CA}, + month = {March}, + year = {2010} + } + + + + +@inproceedings{ADL09, + author = {Itai Ashlagi and + Shahar Dobzinski and + Ron Lavi}, + title = {An optimal lower bound for anonymous scheduling mechanisms}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2009}, + pages = {169-176}, + } + + + @inproceedings{C08, + author = {Ning Chen}, + title = {On the approximability of influence in social networks}, + booktitle = {SODA}, + year = {2008}, + pages = {1029-1037} + } + + + + + @inproceedings{DS08, + author = {Shahar Dobzinski and + Mukund Sundararajan}, + title = {On characterizations of truthful mechanisms for combinatorial + auctions and scheduling}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2008}, + pages = {38-47}, + ee = {http://doi.acm.org/10.1145/1386790.1386798}, + crossref = {DBLP:conf/sigecom/2008}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + + +@inproceedings{AG08, + author = {Yossi Azar and + Iftah Gamzu}, + title = {Truthful Unification Framework for Packing Integer Programs + with Choices}, + booktitle = {ICALP (1)}, + year = {2008}, + pages = {833-844}, + } + + + + +@article{BLM08, + author = {Jeremy Bulow and + Jonathan Levin and Paul Milgrom}, + title = {Winning Play in Spectrum Auctions}, + journal = {Working Paper}, +} + +@InProceedings{PSS08, + author = {Christos H. Papadimitriou and Michael Schapira and Yaron Singer}, + title = {On the Hardness of Being Truthful}, + booktitle = {FOCS}, + year = {2008} +} + + +@inproceedings{DLN08, + author = {Shahar Dobzinski and + Ron Lavi and + Noam Nisan}, + title = {Multi-unit Auctions with Budget Limits}, + booktitle = {FOCS}, + year = {2008}, + pages = {260-269}, + } + +@inproceedings{CFHK08, + author = {Matthew Cary and + Abraham D. Flaxman and + Jason D. Hartline and + Anna R. Karlin}, + title = {Auctions for structured procurement}, + booktitle = {SODA}, + year = {2008}, + pages = {304-313}, + } + + + +@inproceedings{MSV08, + author = {Vahab S. Mirrokni and + Michael Schapira and + Jan Vondr{\'a}k}, + title = {Tight information-theoretic lower bounds for welfare maximization + in combinatorial auctions}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2008}, + pages = {70-77}, + } + + + + + +@article{Google08, + author = {Gagan Aggarwal and + Nir Ailon and + Florin Constantin and + Eyal Even-Dar and + Jon Feldman and + Gereon Frahling and + Monika Rauch Henzinger and + S. Muthukrishnan and + Noam Nisan and + Martin P{\'a}l and + Mark Sandler and + Anastasios Sidiropoulos}, + title = {Theory research at Google}, + journal = {SIGACT News}, + volume = {39}, + number = {2}, + year = {2008}, + pages = {10-28}, + } + + + +@article{MN08, + author = {Ahuva Mu'alem and Noam Nisan}, + title = {Truthful Approximation Mechanisms for Restricted Combinatorial Auctions}, + journal = {Games and Economic Behavior}, + year = {2008}, + pages = {612--631}, + volume = {64}, + number = {2} +} + + + +@article{JY07, + author = {Matthew O. Jackson and Leeat Yariv}, + title = {Diffusion of Behavior and Equilibrium Properties in Network Games}, + journal = {American Economic Review}, + year = {2007} +} + + +@inproceedings{MR07, + author = {Elchanan Mossel and + S{\'e}bastien Roch}, + title = {On the submodularity of influence in social networks}, + booktitle = {STOC}, + year = {2007}, + pages = {128-134}, +} + + +@inproceedings{B07, + author = {Liad Blumrosen}, + title = {Implementing the Maximum of Monotone Algorithms}, + booktitle = {AAAI}, + year = {2007}, + pages = {30-35}, + } + + + +@inproceedings{JM07, + author = {Kamal Jain and Mohammad Mahdian}, + title = {Cost Sharing}, + booktitle = {Algorithmic Game Theory}, + editor = {Nisan, Noam and Roughgarden, Tim and Tardos, Eva and Vazirani, Vijay V.}, + publisher = {Cambridge University Press}, + year = {2007} +} + + + +@inproceedings{FMPS07, + author = {Jon Feldman and + S. Muthukrishnan and + Martin P{\'a}l and + Clifford Stein}, + title = {Budget optimization in search-based advertising auctions}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2007}, + pages = {40-49}, + } + + + + +@inproceedings{MS07, + author = {Ahuva Mu'alem and + Michael Schapira}, + title = {Setting lower bounds on truthfulness: extended abstract}, + booktitle = {SODA}, + year = {2007}, + pages = {1143-1152}, + } + + +@article{AT07, + author = {Aaron Archer and + {\'E}va Tardos}, + title = {Frugal path mechanisms}, + journal = {ACM Transactions on Algorithms}, + volume = {3}, + number = {1}, + year = {2007}, +} + + +@inproceedings{KKT05, + author = {Anna R. Karlin and + David Kempe and + Tami Tamir}, + title = {Beyond {VCG}: Frugality of Truthful Mechanisms}, + booktitle = {FOCS}, + year = {2005}, + pages = {615-626}, + } + +@inproceedings{LS05, + author = {Ron Lavi and + Chaitanya Swamy}, + title = {Truthful and Near-Optimal Mechanism Design via Linear Programming}, + booktitle = {FOCS}, + year = {2005}, + pages = {595-604}, + } + + + + +@inproceedings{BN05, + author = {Liad Blumrosen and + Noam Nisan}, + title = {On the computational power of iterative auctions}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2005}, + pages = {29-43}, + } + + +@inproceedings{BCIMS05, + author = {Christian Borgs and + Jennifer T. Chayes and + Nicole Immorlica and + Mohammad Mahdian and + Amin Saberi}, + title = {Multi-unit auctions with budget-constrained bidders}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2005}, + pages = {44-51}, + } + +@inproceedings{FMT04, + author = {Christos Faloutsos and + Kevin S. McCurley and + Andrew Tomkins}, + title = {Fast discovery of connection subgraphs}, + booktitle = {KDD}, + year = {2004}, + pages = {118-127}, + } + + + @inproceedings{WINE10, + author = {David Arthur and + Rajeev Motwani and + Aneesh Sharma and + Ying Xu 0002}, + title = {Pricing Strategies for Viral Marketing on Social Networks}, + booktitle = {WINE}, + year = {2009}, + pages = {101-112}, + ee = {http://dx.doi.org/10.1007/978-3-642-10841-9_11}, + crossref = {DBLP:conf/wine/2009}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + +@inproceedings{WWW10, + author = {Paul D{\"u}tting and + Monika Henzinger and + Ingmar Weber}, + title = {How much is your personal recommendation worth?}, + booktitle = {WWW}, + year = {2010}, + pages = {1085-1086}, + ee = {http://doi.acm.org/10.1145/1772690.1772816}, + crossref = {DBLP:conf/www/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + +@inproceedings{KG05, + author = {Andreas Krause and Carlos Guestrin}, + title = {A Note on the Budgeted Maximization of +Submodular Functions}, + booktitle = {Technical Report}, + year = {2005}, + pages = {CMU- CALD- 0 5 - 1 0 3 }, + } + + @inproceedings{HMS08, + author = {Jason D. Hartline and + Vahab S. Mirrokni and + Mukund Sundararajan}, + title = {Optimal marketing strategies over social networks}, + booktitle = {WWW}, + year = {2008}, + pages = {189-198}, + ee = {http://doi.acm.org/10.1145/1367497.1367524}, + crossref = {DBLP:conf/www/2008}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + + + + + +@inproceedings{ESS04, + author = {Edith Elkind and + Amit Sahai and + Kenneth Steiglitz}, + title = {Frugality in path auctions}, + booktitle = {SODA}, + year = {2004}, + pages = {701-709}, + } + + + + @article{AS04, + author = {Alexander A. Ageev and + Maxim Sviridenko}, + title = {Pipage Rounding: A New Method of Constructing Algorithms + with Proven Performance Guarantee}, + journal = {J. Comb. Optim.}, + volume = {8}, + number = {3}, + year = {2004}, + pages = {307-328}, + } + + + +@inproceedings{T03, + author = {Kunal Talwar}, + title = {The Price of Truth: Frugality in Truthful Mechanisms}, + booktitle = {STACS}, + year = {2003}, + pages = {608-619}, + } + +@article{MARS03, + author = {Hohner, Gail and Rich, John and Ng, Ed and Reid, Grant and Davenport, Andrew J. and Kalagnanam, Jayant R. and Lee, Ho Soo and An, Chae}, + title = {Combinatorial and quantity-discount procurement auctions benefit {M}ars, incorporated and its suppliers}, + journal = {Interfaces}, + volume = {33}, + number = {1}, + year = {2003}, + publisher = {INFORMS}, + +} + + @inproceedings{KKT03, + author = {David Kempe and + Jon M. Kleinberg and + {\'E}va Tardos}, + title = {Maximizing the spread of influence through a social network}, + booktitle = {KDD}, + year = {2003}, + pages = {137-146}, + } + + +@inproceedings{FPSS02, + author = {Joan Feigenbaum and + Christos H. Papadimitriou and + Rahul Sami and + Scott Shenker}, + title = {A BGP-based mechanism for lowest-cost routing}, + booktitle = {PODC}, + year = {2002}, + pages = {173-182}, + ee = {http://doi.acm.org/10.1145/571825.571856}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + + + + @article{M02, + author={Moulin, Herve}, + editor={K. J. Arrow and A. K. Sen and K. Suzumura}, + title={Axiomatic cost and surplus sharing}, + booktitle={Handbook of Social Choice and Welfare}}, + publisher={Elsevier}, + year=2002, + month={}, + volume={1}, + number={}, + edition={}, + chapter={6}, + pages={289-357}, + url={http://ideas.repec.org/h/eee/socchp/1-06.html} +} + + + @inproceedings{LLN01, + author = {Benny Lehmann and Daniel Lehmann and Noam Nisan}, + title = {Combinatorial Auctions With Decreasing Marginal Utilities}, + booktitle={ACM conference on electronic commerce}, + year = {2001} +} + +@inproceedings{GHW01, + author = {Andrew V. Goldberg and + Jason D. Hartline and + Andrew Wright}, + title = {Competitive auctions and digital goods}, + booktitle = {SODA}, + year = {2001}, + pages = {735-744}, + } + + + @article{NR01, + author = {Noam Nisan and Amir Ronen}, + title = {Algorithmic Mechanism Design}, + journal = {Games and Economic Behaviour}, + year = 2001, + volume = 35, + pages = {166 -- 196}, + note = {A preliminary version appeared in STOC 1999}, +} + + + +@inproceedings{FPS00, + author = {Joan Feigenbaum and + Christos H. Papadimitriou and + Scott Shenker}, + title = {Sharing the cost of muliticast transmissions (preliminary + version)}, + booktitle = {STOC}, + year = {2000}, + pages = {218-227}, + } + + + + +@article{KMN99, + author = {Khuller,, Samir and Moss,, Anna and Naor,, Joseph (Seffi)}, + title = {The budgeted maximum coverage problem}, + journal = {Inf. Process. Lett.}, + volume = {70}, + number = {1}, + year = {1999}, + issn = {0020-0190}, + pages = {39--45}, + doi = {http://dx.doi.org/10.1016/S0020-0190(99)00031-9}, + publisher = {Elsevier North-Holland, Inc.}, + address = {Amsterdam, The Netherlands, The Netherlands}, + } + + + + + @article{F98, + author = "Uriel Feige", + title = "A Threshold of ln n for Approximating Set Cover", + journal = "Journal of the ACM", + volume = "45", + number = "4", + pages = "634-652", + year = "1998", + } + + + @article{M81, + author = {Myerson, R. }, + citeulike-article-id = {161188}, + journal = {Mathematics of Operations Research}, + keywords = {economics, gametheory, markets}, + number = {1}, + title = {Optimal auction design}, + volume = {6}, + year = {1981} +} + + +@article(R79, AUTHOR = "Kevin Roberts", TITLE = "The +Characterization of Implementable Choice Rules", BOOKTITLE = +"Aggregation and Revelation of Preferences. Papers presented at the +1st European Summer Workshop of the Econometric Society", EDITOR = +"Jean-Jacques Laffont", PAGES = "321-349", PUBLISHER = +"North-Holland", YEAR = 1979) + + +@Article{FNW78, + author = {G. L. Nemhauser and L. A. Wolsey and M. L. Fisher}, + title = {An analysis of approximations for maximizing submodular set functions II}, + journal = {Math. Programming Study 8}, + year = {1978}, + OPTkey = {}, + OPTvolume = {8}, + pages = {73--87}, +} + + + +@article{V61, + author = {Vickrey, William }, + citeulike-article-id = {143671}, + journal = {The Journal of Finance}, + number = {1}, + pages = {8--37}, + posted-at = {2005-03-31 20:19:14}, + priority = {4}, + title = {Counterspeculation, Auctions, and Competitive Sealed Tenders}, + url = {http://www.jstor.org/stable/2977633}, + volume = {16}, + year = {1961} +} + +@inproceedings{LLDM08, + author = {Jure Leskovec and + Kevin J. Lang and + Anirban Dasgupta and + Michael W. Mahoney}, + title = {Statistical properties of community structure in large social + and information networks}, + booktitle = {WWW}, + year = {2008}, + pages = {695-704}, + ee = {http://doi.acm.org/10.1145/1367497.1367591}, + crossref = {DBLP:conf/www/2008}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + +@article{fb, + author = {Johan Ugander and + Brian Karrer and + Lars Backstrom and + Cameron Marlow}, + title = {The Anatomy of the Facebook Social Graph}, + journal = {CoRR}, + volume = {abs/1111.4503}, + year = {2011}, + ee = {http://arxiv.org/abs/1111.4503}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{ls, + author = { Silvio Lattanzi and Yaron Singer + }, + title = {The power of sampling neighbors in social networks}, + journal = {Working paper}, +} + +@article{borgs2012influence, + title={Influence Maximization in Social Networks: Towards an Optimal Algorithmic Solution}, + author={Borgs, Christian and Brautbar, Michael and Chayes, Jennifer and Lucier, Brendan}, + journal={arXiv preprint arXiv:1212.0884}, + year={2012} +} + +@inproceedings{HIMM11, + author = {Nima Haghpanah and + Nicole Immorlica and + Vahab S. Mirrokni and + Kamesh Munagala}, + title = {Optimal auctions with positive network externalities}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2011}, + pages = {11-20}, + ee = {http://doi.acm.org/10.1145/1993574.1993577}, + crossref = {DBLP:conf/sigecom/2011}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{W82, + title={Maximising real-valued submodular functions: Primal and dual heuristics for location problems}, + author={Wolsey, Laurence A}, + journal={Mathematics of Operations Research}, + volume={7}, + number={3}, + pages={410--425}, + year={1982}, + publisher={INFORMS} +} + +@article{fb, + author = {Johan Ugander and + Brian Karrer and + Lars Backstrom and + Cameron Marlow}, + title = {The Anatomy of the Facebook Social Graph}, + journal = {CoRR}, + volume = {abs/1111.4503}, + year = {2011}, + ee = {http://arxiv.org/abs/1111.4503}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{ACKS13, + author = {Ittai Abraham and + Shiri Chechik and + David Kempe and + Aleksandrs Slivkins}, + title = {Low-distortion Inference of Latent Similarities from a Multiplex + Social Network}, + booktitle = {SODA}, + year = {2013}, + pages = {1853-1872}, + ee = {http://knowledgecenter.siam.org/0236-000019/}, + crossref = {DBLP:conf/soda/2013}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{KKT05, + author = {David Kempe and + Jon M. Kleinberg and + {\'E}va Tardos}, + title = {Influential Nodes in a Diffusion Model for Social Networks}, + booktitle = {ICALP}, + year = {2005}, + pages = {1127-1138}, + ee = {http://dx.doi.org/10.1007/11523468_91}, + crossref = {DBLP:conf/icalp/2005}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{HMS08, + author = {Jason D. Hartline and + Vahab S. Mirrokni and + Mukund Sundararajan}, + title = {Optimal marketing strategies over social networks}, + booktitle = {WWW}, + year = {2008}, + pages = {189-198}, + ee = {http://doi.acm.org/10.1145/1367497.1367524}, + crossref = {DBLP:conf/www/2008}, + bibsource = {DBLP, http://dblp.uni-trier.de} +}
\ No newline at end of file diff --git a/paper/comp.pdf b/paper/comp.pdf Binary files differnew file mode 100644 index 0000000..71c242f --- /dev/null +++ b/paper/comp.pdf diff --git a/paper/definitions.tex b/paper/definitions.tex new file mode 100644 index 0000000..1377ac0 --- /dev/null +++ b/paper/definitions.tex @@ -0,0 +1,6 @@ +\newcommand{\neigh}[1]{\mathcal{N}(#1)} +\newcommand{\defeq}{\equiv} +\newcommand{\reals}{\mathbf{R}} +\DeclareMathOperator*{\argmax}{argmax} +\newtheorem{proposition}{Proposition} +\newtheorem{lemma}{Lemma} diff --git a/paper/images/comp.pdf b/paper/images/comp.pdf Binary files differnew file mode 100644 index 0000000..2179c1b --- /dev/null +++ b/paper/images/comp.pdf diff --git a/paper/images/dist.pdf b/paper/images/dist.pdf Binary files differnew file mode 100644 index 0000000..18d6467 --- /dev/null +++ b/paper/images/dist.pdf diff --git a/paper/images/hbo_likes.pdf b/paper/images/hbo_likes.pdf Binary files differnew file mode 100644 index 0000000..c5b7ab4 --- /dev/null +++ b/paper/images/hbo_likes.pdf diff --git a/paper/images/para.pdf b/paper/images/para.pdf Binary files differnew file mode 100644 index 0000000..95b0f1a --- /dev/null +++ b/paper/images/para.pdf diff --git a/paper/images/perf.pdf b/paper/images/perf.pdf Binary files differnew file mode 100644 index 0000000..35c7769 --- /dev/null +++ b/paper/images/perf.pdf diff --git a/paper/images/prob.pdf b/paper/images/prob.pdf Binary files differnew file mode 100644 index 0000000..8c38488 --- /dev/null +++ b/paper/images/prob.pdf diff --git a/paper/images/time.pdf b/paper/images/time.pdf Binary files differnew file mode 100644 index 0000000..02eaf19 --- /dev/null +++ b/paper/images/time.pdf diff --git a/paper/images/usandthem.pdf b/paper/images/usandthem.pdf Binary files differnew file mode 100644 index 0000000..0f43933 --- /dev/null +++ b/paper/images/usandthem.pdf diff --git a/paper/images/usandthem.png b/paper/images/usandthem.png Binary files differnew file mode 100644 index 0000000..f09e7bc --- /dev/null +++ b/paper/images/usandthem.png diff --git a/paper/main.tex b/paper/main.tex new file mode 100644 index 0000000..e25212a --- /dev/null +++ b/paper/main.tex @@ -0,0 +1,70 @@ +\documentclass{sig-alternate} +\usepackage[utf8x]{inputenc} +\usepackage{amsmath,amsfonts} +%yaron: removed class amsthm +\usepackage[pagebackref=true,breaklinks=true,colorlinks=true]{hyperref} +\usepackage{algorithmic,algorithm} +\usepackage{booktabs} +\usepackage{graphicx} +\usepackage{bbm} +\usepackage{caption} +\usepackage{subcaption} +\input{definitions} +\begin{document} +%\conferenceinfo{WOODSTOCK}{'97 El Paso, Texas USA} +%\title{Efficient Adaptive Seeding: Leveraging the Friendship +%Paradox for Influence Maximization} + +\title{Scalable Methods for Adaptively Seeding a Social Network} +%Paradox for Influence Maximization} + +\numberofauthors{2} +\author{ +\alignauthor +Thibaut Horel\\ + \affaddr{Harvard University}\\ + \email{thorel@seas.harvard.edu} +\alignauthor +Yaron Singer\\ + \affaddr{Harvard University}\\ + \email{yaron@seas.harvard.edu} +} +\date{} + +\maketitle +\begin{abstract} + \input{sections/abstract} +\end{abstract} + +%\category{H.4}{Information Systems Applications}{Miscellaneous} +%\category{D.2.8}{Software Engineering}{Metrics}[complexity measures, performance measures] +%\terms{Theory} +%\keywords{ACM proceedings, \LaTeX, text tagging} + +\section{Introduction} +\input{sections/introduction} +\input{sections/related} + +\section{Model} +\input{sections/model} + +\section{Algorithms} +\input{sections/algorithms} + +%\section{The Combinatorial Algorithm} +%\input{sections/combinatorial} + +\section{Experiments} +\input{sections/experiments} + + + +\footnotesize{ +\bibliographystyle{abbrv} +\bibliography{paper} +%\balancecolumns +%\appendix +%\balancecolumns % GM June 2007 +%\input{sections/appendix} +} +\end{document} diff --git a/paper/paper.bib b/paper/paper.bib new file mode 100644 index 0000000..d3ff37e --- /dev/null +++ b/paper/paper.bib @@ -0,0 +1,1274 @@ +@inproceedings{even-dar, + author = {Eyal Even-Dar and + Asaf Shapira}, + title = {A Note on Maximizing the Spread of Influence in Social Networks}, + booktitle = {WINE}, + year = {2007}, + pages = {281-286}, + ee = {http://dx.doi.org/10.1007/978-3-540-77105-0_27}, + crossref = {DBLP:conf/wine/2007}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@proceedings{DBLP:conf/wine/2007, + editor = {Xiaotie Deng and + Fan Chung Graham}, + title = {Internet and Network Economics, Third International Workshop, + WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings}, + booktitle = {WINE}, + publisher = {Springer}, + series = {Lecture Notes in Computer Science}, + volume = {4858}, + year = {2007}, + isbn = {978-3-540-77104-3}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{singer, + title = {Adaptive Seeding in Social Networks}, + booktitle = {{FOCS}}, + author = {Seeman, Lior and Singer, Yaron}, + year = {2013}, +}, + +@inproceedings{richardson, + author = {Matthew Richardson and + Pedro Domingos}, + title = {Mining knowledge-sharing sites for viral marketing}, + booktitle = {KDD}, + year = {2002}, + pages = {61-70}, + ee = {http://doi.acm.org/10.1145/775047.775057}, + crossref = {DBLP:conf/kdd/2002}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@proceedings{DBLP:conf/kdd/2002, + title = {Proceedings of the Eighth ACM SIGKDD International Conference + on Knowledge Discovery and Data Mining, July 23-26, 2002, + Edmonton, Alberta, Canada}, + booktitle = {KDD}, + publisher = {ACM}, + year = {2002}, + isbn = {1-58113-567-X}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{vondrak, + author = {Jan Vondr{\'a}k and + Chandra Chekuri and + Rico Zenklusen}, + title = {Submodular function maximization via the multilinear relaxation + and contention resolution schemes}, + booktitle = {STOC}, + year = {2011}, + pages = {783-792}, + ee = {http://doi.acm.org/10.1145/1993636.1993740}, + crossref = {DBLP:conf/stoc/2011}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@proceedings{DBLP:conf/stoc/2011, + editor = {Lance Fortnow and + Salil P. Vadhan}, + title = {Proceedings of the 43rd ACM Symposium on Theory of Computing, + STOC 2011, San Jose, CA, USA, 6-8 June 2011}, + booktitle = {STOC}, + publisher = {ACM}, + year = {2011}, + isbn = {978-1-4503-0691-1}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{dughmi, + author = {Shaddin Dughmi}, + title = {Submodular Functions: Extensions, Distributions, and Algorithms. + A Survey}, + journal = {CoRR}, + volume = {abs/0912.0322}, + year = {2009}, + ee = {http://arxiv.org/abs/0912.0322}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{pipage, + author = {Alexander A. Ageev and + Maxim Sviridenko}, + title = {Pipage Rounding: A New Method of Constructing Algorithms + with Proven Performance Guarantee}, + journal = {J. Comb. Optim.}, + volume = {8}, + number = {3}, + year = {2004}, + pages = {307-328}, + ee = {http://dx.doi.org/10.1023/B:JOCO.0000038913.96607.c2}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{nemhauser, + title={An analysis of approximations for maximizing submodular set functions—I}, + author={Nemhauser, George L and Wolsey, Laurence A and Fisher, Marshall L}, + journal={Mathematical Programming}, + volume={14}, + number={1}, + pages={265--294}, + year={1978}, + publisher={Springer-Verlag} +} + + + +@book{shapiro2009lectures, + title={Lectures on stochastic programming: modeling and theory}, + author={Shapiro, Alexander and Dentcheva, Darinka and Ruszczy{\'n}ski, Andrzej}, + volume={9}, + year={2009}, + publisher={Society for Industrial Mathematics} +} + +@article{feld1991, + title={Why your friends have more friends than you do}, + author={Feld, Scott L}, + journal={American Journal of Sociology}, + pages={1464--1477}, + year={1991}, + publisher={JSTOR} +} + +@Article{NWF78, + author = {G. L. Nemhauser and L. A. Wolsey and M. L. Fisher}, + title = {An analysis of approximations for maximizing submodular set functions II}, + journal = {Math. Programming Study 8}, + year = {1978}, + OPTkey = {}, + OPTvolume = {8}, + pages = {73--87}, +} + +@article{GMC, + title={The generalized maximum coverage problem}, + author={Cohen, Reuven and Katzir, Liran}, + journal={Information Processing Letters}, + volume={108}, + number={1}, + pages={15--22}, + year={2008}, + publisher={Elsevier} +} + +@article{holley1975ergodic, + title={Ergodic theorems for weakly interacting infinite systems and the voter model}, + author={Holley, Richard A and Liggett, Thomas M}, + journal={The annals of probability}, + pages={643--663}, + year={1975}, + publisher={JSTOR} +} + + +@article{Voter, + author = {Eyal Even-Dar and + Asaf Shapira}, + title = {A note on maximizing the spread of influence in social networks}, + journal = {Inf. Process. Lett.}, + volume = {111}, + number = {4}, + year = {2011}, + pages = {184-187}, + ee = {http://dx.doi.org/10.1016/j.ipl.2010.11.015}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{feige1998threshold, + title={A threshold of ln n for approximating set cover}, + author={Feige, Uriel}, + journal={Journal of the ACM (JACM)}, + volume={45}, + number={4}, + pages={634--652}, + year={1998}, + publisher={ACM} +} + + @MISC{StochProg, + author = {Maarten H. {van der Vlerk}}, + title = {Stochastic Programming Bibliography}, + year = {1996-2007}, + howpublished = {World Wide Web, \url{http://www.eco.rug.nl/mally/spbib.html}} +} + +@article{SampleAverage, + title={The sample average approximation method for stochastic discrete optimization}, + author={Kleywegt, Anton J and Shapiro, Alexander and Homem-de-Mello, Tito}, + journal={SIAM Journal on Optimization}, + volume={12}, + number={2}, + pages={479--502}, + year={2002}, + publisher={SIAM} +} + +@inproceedings{immorlica2004costs, + title={On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems}, + author={Immorlica, Nicole and Karger, David and Minkoff, Maria and Mirrokni, Vahab S}, + booktitle={Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms}, + pages={691--700}, + year={2004}, + organization={Society for Industrial and Applied Mathematics} +} + +@incollection{ravi2004hedging, + title={Hedging uncertainty: Approximation algorithms for stochastic optimization problems}, + author={Ravi, R and Sinha, Amitabh}, + booktitle={Integer programming and combinatorial optimization}, + pages={101--115}, + year={2004}, + publisher={Springer} +} + +@inproceedings{gupta2004boosted, + title={Boosted sampling: approximation algorithms for stochastic optimization}, + author={Gupta, Anupam and P{\'a}l, Martin and Ravi, R and Sinha, Amitabh}, + booktitle={Proceedings of the thirty-sixth annual ACM symposium on Theory of computing}, + pages={417--426}, + year={2004}, + organization={ACM} +} + +@incollection{gupta2005wednesday, + title={What about wednesday? approximation algorithms for multistage stochastic optimization}, + author={Gupta, Anupam and P{\'a}l, Martin and Ravi, Ramamoorthi and Sinha, Amitabh}, + booktitle={Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques}, + pages={86--98}, + year={2005}, + publisher={Springer} +} + +@inproceedings{shmoys2004stochastic, + title={Stochastic optimization is (almost) as easy as deterministic optimization}, + author={Shmoys, David B and Swamy, Chaitanya}, + booktitle={Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on}, + pages={228--237}, + year={2004}, + organization={IEEE} +} + +@article{shmoys2006approximation, + title={An approximation scheme for stochastic linear programming and its application to stochastic integer programs}, + author={Shmoys, David B and Swamy, Chaitanya}, + journal={Journal of the ACM (JACM)}, + volume={53}, + number={6}, + pages={978--1012}, + year={2006}, + publisher={ACM} +} + +@inproceedings{swamy2005sampling, + title={Sampling-based approximation algorithms for multi-stage stochastic optimization}, + author={Swamy, Chaitanya and Shmoys, David B}, + booktitle={Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on}, + pages={357--366}, + year={2005}, + organization={IEEE} +} + +@inproceedings{srinivasan2007approximation, + title={Approximation algorithms for stochastic and risk-averse optimization}, + author={Srinivasan, Aravind}, + booktitle={Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms}, + pages={1305--1313}, + year={2007}, + organization={Society for Industrial and Applied Mathematics} +} + +@article{kleinberg2000allocating, + title={Allocating bandwidth for bursty connections}, + author={Kleinberg, Jon and Rabani, Yuval and Tardos, {\'E}va}, + journal={SIAM Journal on Computing}, + volume={30}, + number={1}, + pages={191--217}, + year={2000}, + publisher={SIAM} +} + +@inproceedings{dean2004approximating, + title={Approximating the stochastic knapsack problem: The benefit of adaptivity}, + author={Dean, Brian C and Goemans, Michel X and Vondrdk, J}, + booktitle={Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on}, + pages={208--217}, + year={2004}, + organization={IEEE} +} + +@inproceedings{gupta2012approximation, + title={Approximation algorithms for stochastic orienteering}, + author={Gupta, Anupam and Krishnaswamy, Ravishankar and Nagarajan, Viswanath and Ravi, R}, + booktitle={Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms}, + pages={1522--1538}, + year={2012}, + organization={SIAM} +} + +@article{golovin2011adaptive, + title={Adaptive submodularity: Theory and applications in active learning and stochastic optimization}, + author={Golovin, Daniel and Krause, Andreas}, + journal={Journal of Artificial Intelligence Research}, + volume={42}, + number={1}, + pages={427--486}, + year={2011}, + publisher={AI Access Foundation} +} + +@inproceedings{kempe2003maximizing, + title={Maximizing the spread of influence through a social network}, + author={Kempe, David and Kleinberg, Jon and Tardos, {\'E}va}, + booktitle={Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining}, + pages={137--146}, + year={2003}, + organization={ACM} +} + + +@incollection{asadpour2008stochastic, + title={Stochastic submodular maximization}, + author={Asadpour, Arash and Nazerzadeh, Hamid and Saberi, Amin}, + booktitle={Internet and Network Economics}, + pages={477--489}, + year={2008}, + publisher={Springer} +} + + +@inproceedings{mturk, + title = {Mechanical Turk}, + booktitle = {https://www.mturk.com/}, + +} + +@inproceedings{SM11, + author = {Yaron Singer and + Manas Mittal}, + title = {Mechanisms for Online Labor Markets}, + booktitle = {Workshop on Human Computation }, + year = {2011}, +} + + +@inproceedings{GR11, + author = {Arpita Ghosh and + Aaron Roth}, + title = {Selling privacy at auction}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2011}, + pages = {199-208}, + } + +@inproceedings{KDD11, + author = {Michael Mathioudakis and Francesco Bonchi and Carlos Castillo and Aristides Gionis and Antti Ukkonen}, + title = {Sparsification of Influence Networks}, + booktitle = {KDD}, + year = {2011}, + } + + +@inproceedings{HIMM11, + author = {Nima Haghpanah and + Nicole Immorlica and + Vahab S. Mirrokni and + Kamesh Munagala}, + title = {Optimal auctions with positive network externalities}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2011}, + pages = {11-20}, + ee = {http://doi.acm.org/10.1145/1993574.1993577}, + crossref = {DBLP:conf/sigecom/2011}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + +@inproceedings{DPS11, + author = {Shahar Dobzinski and Christos Papadimitriou and Yaron Singer}, + title = {Mechanisms for Complement-Free Procurement}, + booktitle = {EC}, + year = {2011}, + } + + + @inproceedings{BHMW11, + author = {Eytan Bakshy and + Jake M. Hofman and + Winter A. Mason and + Duncan J. Watts}, + title = {Everyone's an influencer: quantifying influence on twitter}, + booktitle = {WSDM}, + year = {2011}, +} + + + +@inproceedings{S10, + author = {Yaron Singer}, + title = {Budget Feasible Mechanisms}, + booktitle = {FOCS}, + year = {2010}, + pages = {765-774}, + ee = {http://dx.doi.org/10.1109/FOCS.2010.78}, + crossref = {DBLP:conf/focs/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{GBL10, + author = {Amit Goyal and + Francesco Bonchi and + Laks V. S. Lakshmanan}, + title = {Learning influence probabilities in social networks}, + booktitle = {WSDM}, + year = {2010}, + pages = {241-250}, + ee = {http://doi.acm.org/10.1145/1718487.1718518}, + crossref = {DBLP:conf/wsdm/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{YC10, + author = {Jiang Yang and + Scott Counts}, + title = {Predicting the Speed, Scale, and Range of Information Diffusion + in Twitter}, + booktitle = {ICWSM}, + year = {2010}, + } + +@inproceedings{LKGFVG07, + author = {Jure Leskovec and + Andreas Krause and + Carlos Guestrin and + Christos Faloutsos and + Jeanne M. VanBriesen and + Natalie S. Glance}, + title = {Cost-effective outbreak detection in networks}, + booktitle = {KDD}, + year = {2007}, + pages = {420-429}, + ee = {http://doi.acm.org/10.1145/1281192.1281239}, + crossref = {DBLP:conf/kdd/2007}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + +@article{ES11, + author = {Eyal Even-Dar and + Asaf Shapira}, + title = {A note on maximizing the spread of influence in social networks}, + journal = {Inf. Process. Lett.}, + volume = {111}, + number = {4}, + year = {2011}, + pages = {184-187}, + ee = {http://dx.doi.org/10.1016/j.ipl.2010.11.015}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + +@inproceedings{MS10, + author = {Elchanan Mossel and + Grant Schoenebeck}, + title = {Reaching Consensus on Social Networks}, + booktitle = {ICS}, + year = {2010}, + pages = {214-229}, + ee = {http://conference.itcs.tsinghua.edu.cn/ICS2010/content/papers/18.html}, + crossref = {DBLP:conf/innovations/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{MR07, + author = {Elchanan Mossel and + S{\'e}bastien Roch}, + title = {On the submodularity of influence in social networks}, + booktitle = {STOC}, + year = {2007}, + pages = {128-134}, + } + + @INPROCEEDINGS{KR05, + author = {Jon Kleinberg and Prabhakar Raghavan}, + title = {Query Incentive Networks}, + booktitle = {Proc. 46th IEEE Symposium on Foundations of Computer Science}, + year = {2005}, + pages = {132--141} +} + + @inproceedings{RD02, + author = {Matthew Richardson and + Pedro Domingos}, + title = {Mining knowledge-sharing sites for viral marketing}, + booktitle = {KDD}, + year = {2002}, + pages = {61-70}, + } + + + @inproceedings{DR01, + author = {Pedro Domingos and + Matthew Richardson}, + title = {Mining the network value of customers}, + booktitle = {KDD}, + year = {2001}, + pages = {57-66}, + } + + + + @inproceedings{RLK10, + author = {Manuel Gomez-Rodriguez and + Jure Leskovec and + Andreas Krause}, + title = {Inferring networks of diffusion and influence}, + booktitle = {KDD}, + year = {2010}, + pages = {1019-1028}, +} + + @inproceedings{LAH06, + author = {Jure Leskovec and + Lada A. Adamic and + Bernardo A. Huberman}, + title = {The dynamics of viral marketing}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2006}, + pages = {228-237}, +} + + + + +@inproceedings{CKT10, + author = {Flavio Chierichetti and + Ravi Kumar and + Andrew Tomkins}, + title = {Max-cover in map-reduce}, + booktitle = {WWW}, + year = {2010}, + pages = {231-240}, + ee = {http://doi.acm.org/10.1145/1772690.1772715}, + crossref = {DBLP:conf/www/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + +@article{CGL11, + author = {Ning Chen and + Nick Gravin and + Pinyan Lu}, + title = {On the Approximability of Budget Feasible Mechanisms}, + booktitle = {SODA}, + year = {2011}, +} + + + +@inproceedings{fbdata, + author= {Minas Gjoka and Maciej Kurant and Carter T. Butts and Athina Markopoulou}, + title= { {Walking in Facebook: A Case Study of Unbiased Sampling of OSNs} }, + booktitle = {Proceedings of IEEE INFOCOM '10}, + address = {San Diego, CA}, + month = {March}, + year = {2010} + } + + + + +@inproceedings{ADL09, + author = {Itai Ashlagi and + Shahar Dobzinski and + Ron Lavi}, + title = {An optimal lower bound for anonymous scheduling mechanisms}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2009}, + pages = {169-176}, + } + + + @inproceedings{C08, + author = {Ning Chen}, + title = {On the approximability of influence in social networks}, + booktitle = {SODA}, + year = {2008}, + pages = {1029-1037} + } + + + + + @inproceedings{DS08, + author = {Shahar Dobzinski and + Mukund Sundararajan}, + title = {On characterizations of truthful mechanisms for combinatorial + auctions and scheduling}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2008}, + pages = {38-47}, + ee = {http://doi.acm.org/10.1145/1386790.1386798}, + crossref = {DBLP:conf/sigecom/2008}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + + +@inproceedings{AG08, + author = {Yossi Azar and + Iftah Gamzu}, + title = {Truthful Unification Framework for Packing Integer Programs + with Choices}, + booktitle = {ICALP (1)}, + year = {2008}, + pages = {833-844}, + } + + + + +@article{BLM08, + author = {Jeremy Bulow and + Jonathan Levin and Paul Milgrom}, + title = {Winning Play in Spectrum Auctions}, + journal = {Working Paper}, +} + +@InProceedings{PSS08, + author = {Christos H. Papadimitriou and Michael Schapira and Yaron Singer}, + title = {On the Hardness of Being Truthful}, + booktitle = {FOCS}, + year = {2008} +} + + +@inproceedings{DLN08, + author = {Shahar Dobzinski and + Ron Lavi and + Noam Nisan}, + title = {Multi-unit Auctions with Budget Limits}, + booktitle = {FOCS}, + year = {2008}, + pages = {260-269}, + } + +@inproceedings{CFHK08, + author = {Matthew Cary and + Abraham D. Flaxman and + Jason D. Hartline and + Anna R. Karlin}, + title = {Auctions for structured procurement}, + booktitle = {SODA}, + year = {2008}, + pages = {304-313}, + } + + + +@inproceedings{MSV08, + author = {Vahab S. Mirrokni and + Michael Schapira and + Jan Vondr{\'a}k}, + title = {Tight information-theoretic lower bounds for welfare maximization + in combinatorial auctions}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2008}, + pages = {70-77}, + } + + + + + +@article{Google08, + author = {Gagan Aggarwal and + Nir Ailon and + Florin Constantin and + Eyal Even-Dar and + Jon Feldman and + Gereon Frahling and + Monika Rauch Henzinger and + S. Muthukrishnan and + Noam Nisan and + Martin P{\'a}l and + Mark Sandler and + Anastasios Sidiropoulos}, + title = {Theory research at Google}, + journal = {SIGACT News}, + volume = {39}, + number = {2}, + year = {2008}, + pages = {10-28}, + } + + + +@article{MN08, + author = {Ahuva Mu'alem and Noam Nisan}, + title = {Truthful Approximation Mechanisms for Restricted Combinatorial Auctions}, + journal = {Games and Economic Behavior}, + year = {2008}, + pages = {612--631}, + volume = {64}, + number = {2} +} + + + +@article{JY07, + author = {Matthew O. Jackson and Leeat Yariv}, + title = {Diffusion of Behavior and Equilibrium Properties in Network Games}, + journal = {American Economic Review}, + year = {2007} +} + + +@inproceedings{MR07, + author = {Elchanan Mossel and + S{\'e}bastien Roch}, + title = {On the submodularity of influence in social networks}, + booktitle = {STOC}, + year = {2007}, + pages = {128-134}, +} + + +@inproceedings{B07, + author = {Liad Blumrosen}, + title = {Implementing the Maximum of Monotone Algorithms}, + booktitle = {AAAI}, + year = {2007}, + pages = {30-35}, + } + + + +@inproceedings{JM07, + author = {Kamal Jain and Mohammad Mahdian}, + title = {Cost Sharing}, + booktitle = {Algorithmic Game Theory}, + editor = {Nisan, Noam and Roughgarden, Tim and Tardos, Eva and Vazirani, Vijay V.}, + publisher = {Cambridge University Press}, + year = {2007} +} + + + +@inproceedings{FMPS07, + author = {Jon Feldman and + S. Muthukrishnan and + Martin P{\'a}l and + Clifford Stein}, + title = {Budget optimization in search-based advertising auctions}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2007}, + pages = {40-49}, + } + + + + +@inproceedings{MS07, + author = {Ahuva Mu'alem and + Michael Schapira}, + title = {Setting lower bounds on truthfulness: extended abstract}, + booktitle = {SODA}, + year = {2007}, + pages = {1143-1152}, + } + + +@article{AT07, + author = {Aaron Archer and + {\'E}va Tardos}, + title = {Frugal path mechanisms}, + journal = {ACM Transactions on Algorithms}, + volume = {3}, + number = {1}, + year = {2007}, +} + + +@inproceedings{KaKT05, + author = {Anna R. Karlin and + David Kempe and + Tami Tamir}, + title = {Beyond {VCG}: Frugality of Truthful Mechanisms}, + booktitle = {FOCS}, + year = {2005}, + pages = {615-626}, + } + +@inproceedings{LS05, + author = {Ron Lavi and + Chaitanya Swamy}, + title = {Truthful and Near-Optimal Mechanism Design via Linear Programming}, + booktitle = {FOCS}, + year = {2005}, + pages = {595-604}, + } + + + + +@inproceedings{BN05, + author = {Liad Blumrosen and + Noam Nisan}, + title = {On the computational power of iterative auctions}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2005}, + pages = {29-43}, + } + + +@inproceedings{BCIMS05, + author = {Christian Borgs and + Jennifer T. Chayes and + Nicole Immorlica and + Mohammad Mahdian and + Amin Saberi}, + title = {Multi-unit auctions with budget-constrained bidders}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2005}, + pages = {44-51}, + } + +@inproceedings{FMT04, + author = {Christos Faloutsos and + Kevin S. McCurley and + Andrew Tomkins}, + title = {Fast discovery of connection subgraphs}, + booktitle = {KDD}, + year = {2004}, + pages = {118-127}, + } + + + @inproceedings{WINE10, + author = {David Arthur and + Rajeev Motwani and + Aneesh Sharma and + Ying Xu 0002}, + title = {Pricing Strategies for Viral Marketing on Social Networks}, + booktitle = {WINE}, + year = {2009}, + pages = {101-112}, + ee = {http://dx.doi.org/10.1007/978-3-642-10841-9_11}, + crossref = {DBLP:conf/wine/2009}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + +@inproceedings{WWW10, + author = {Paul D{\"u}tting and + Monika Henzinger and + Ingmar Weber}, + title = {How much is your personal recommendation worth?}, + booktitle = {WWW}, + year = {2010}, + pages = {1085-1086}, + ee = {http://doi.acm.org/10.1145/1772690.1772816}, + crossref = {DBLP:conf/www/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + +@inproceedings{KG05, + author = {Andreas Krause and Carlos Guestrin}, + title = {A Note on the Budgeted Maximization of +Submodular Functions}, + booktitle = {Technical Report}, + year = {2005}, + pages = {CMU- CALD- 0 5 - 1 0 3 }, + } + + @inproceedings{HMS08, + author = {Jason D. Hartline and + Vahab S. Mirrokni and + Mukund Sundararajan}, + title = {Optimal marketing strategies over social networks}, + booktitle = {WWW}, + year = {2008}, + pages = {189-198}, + ee = {http://doi.acm.org/10.1145/1367497.1367524}, + crossref = {DBLP:conf/www/2008}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + + + + + +@inproceedings{ESS04, + author = {Edith Elkind and + Amit Sahai and + Kenneth Steiglitz}, + title = {Frugality in path auctions}, + booktitle = {SODA}, + year = {2004}, + pages = {701-709}, + } + + + + @article{AS04, + author = {Alexander A. Ageev and + Maxim Sviridenko}, + title = {Pipage Rounding: A New Method of Constructing Algorithms + with Proven Performance Guarantee}, + journal = {J. Comb. Optim.}, + volume = {8}, + number = {3}, + year = {2004}, + pages = {307-328}, + } + + + +@inproceedings{T03, + author = {Kunal Talwar}, + title = {The Price of Truth: Frugality in Truthful Mechanisms}, + booktitle = {STACS}, + year = {2003}, + pages = {608-619}, + } + +@article{MARS03, + author = {Hohner, Gail and Rich, John and Ng, Ed and Reid, Grant and Davenport, Andrew J. and Kalagnanam, Jayant R. and Lee, Ho Soo and An, Chae}, + title = {Combinatorial and quantity-discount procurement auctions benefit {M}ars, incorporated and its suppliers}, + journal = {Interfaces}, + volume = {33}, + number = {1}, + year = {2003}, + publisher = {INFORMS}, + +} + + @inproceedings{KKT03, + author = {David Kempe and + Jon M. Kleinberg and + {\'E}va Tardos}, + title = {Maximizing the spread of influence through a social network}, + booktitle = {KDD}, + year = {2003}, + pages = {137-146}, + } + + +@inproceedings{FPSS02, + author = {Joan Feigenbaum and + Christos H. Papadimitriou and + Rahul Sami and + Scott Shenker}, + title = {A BGP-based mechanism for lowest-cost routing}, + booktitle = {PODC}, + year = {2002}, + pages = {173-182}, + ee = {http://doi.acm.org/10.1145/571825.571856}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + + + + + @article{M02, + author={Moulin, Herve}, + editor={K. J. Arrow and A. K. Sen and K. Suzumura}, + title={Axiomatic cost and surplus sharing}, + booktitle={Handbook of Social Choice and Welfare}}, + publisher={Elsevier}, + year=2002, + month={}, + volume={1}, + number={}, + edition={}, + chapter={6}, + pages={289-357}, + url={http://ideas.repec.org/h/eee/socchp/1-06.html} +} + + + @inproceedings{LLN01, + author = {Benny Lehmann and Daniel Lehmann and Noam Nisan}, + title = {Combinatorial Auctions With Decreasing Marginal Utilities}, + booktitle={ACM conference on electronic commerce}, + year = {2001} +} + +@inproceedings{GHW01, + author = {Andrew V. Goldberg and + Jason D. Hartline and + Andrew Wright}, + title = {Competitive auctions and digital goods}, + booktitle = {SODA}, + year = {2001}, + pages = {735-744}, + } + + + @article{NR01, + author = {Noam Nisan and Amir Ronen}, + title = {Algorithmic Mechanism Design}, + journal = {Games and Economic Behaviour}, + year = 2001, + volume = 35, + pages = {166 -- 196}, + note = {A preliminary version appeared in STOC 1999}, +} + + + +@inproceedings{FPS00, + author = {Joan Feigenbaum and + Christos H. Papadimitriou and + Scott Shenker}, + title = {Sharing the cost of muliticast transmissions (preliminary + version)}, + booktitle = {STOC}, + year = {2000}, + pages = {218-227}, + } + + + + +@article{KMN99, + author = {Khuller,, Samir and Moss,, Anna and Naor,, Joseph (Seffi)}, + title = {The budgeted maximum coverage problem}, + journal = {Inf. Process. Lett.}, + volume = {70}, + number = {1}, + year = {1999}, + issn = {0020-0190}, + pages = {39--45}, + doi = {http://dx.doi.org/10.1016/S0020-0190(99)00031-9}, + publisher = {Elsevier North-Holland, Inc.}, + address = {Amsterdam, The Netherlands, The Netherlands}, + } + + + + + @article{F98, + author = "Uriel Feige", + title = "A Threshold of ln n for Approximating Set Cover", + journal = "Journal of the ACM", + volume = "45", + number = "4", + pages = "634-652", + year = "1998", + } + + + @article{M81, + author = {Myerson, R. }, + citeulike-article-id = {161188}, + journal = {Mathematics of Operations Research}, + keywords = {economics, gametheory, markets}, + number = {1}, + title = {Optimal auction design}, + volume = {6}, + year = {1981} +} + + +@article(R79, AUTHOR = "Kevin Roberts", TITLE = "The +Characterization of Implementable Choice Rules", BOOKTITLE = +"Aggregation and Revelation of Preferences. Papers presented at the +1st European Summer Workshop of the Econometric Society", EDITOR = +"Jean-Jacques Laffont", PAGES = "321-349", PUBLISHER = +"North-Holland", YEAR = 1979) + + +@Article{FNW78, + author = {G. L. Nemhauser and L. A. Wolsey and M. L. Fisher}, + title = {An analysis of approximations for maximizing submodular set functions II}, + journal = {Math. Programming Study 8}, + year = {1978}, + OPTkey = {}, + OPTvolume = {8}, + pages = {73--87}, +} + + + +@article{V61, + author = {Vickrey, William }, + citeulike-article-id = {143671}, + journal = {The Journal of Finance}, + number = {1}, + pages = {8--37}, + posted-at = {2005-03-31 20:19:14}, + priority = {4}, + title = {Counterspeculation, Auctions, and Competitive Sealed Tenders}, + url = {http://www.jstor.org/stable/2977633}, + volume = {16}, + year = {1961} +} + +@inproceedings{LLDM08, + author = {Jure Leskovec and + Kevin J. Lang and + Anirban Dasgupta and + Michael W. Mahoney}, + title = {Statistical properties of community structure in large social + and information networks}, + booktitle = {WWW}, + year = {2008}, + pages = {695-704}, + ee = {http://doi.acm.org/10.1145/1367497.1367591}, + crossref = {DBLP:conf/www/2008}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + +@article{fb, + author = {Johan Ugander and + Brian Karrer and + Lars Backstrom and + Cameron Marlow}, + title = {The Anatomy of the Facebook Social Graph}, + journal = {CoRR}, + volume = {abs/1111.4503}, + year = {2011}, + ee = {http://arxiv.org/abs/1111.4503}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{ls13, + author = { Silvio Lattanzi and Yaron Singer + }, + title = {The power of random neighbors in social networks}, + journal = {Working paper}, +} + +@article{borgs2012influence, + title={Influence Maximization in Social Networks: Towards an Optimal Algorithmic Solution}, + author={Borgs, Christian and Brautbar, Michael and Chayes, Jennifer and Lucier, Brendan}, + journal={arXiv preprint arXiv:1212.0884}, + year={2012} +} + +@inproceedings{borgs2014maximizing, + title={Maximizing social influence in nearly optimal time}, + author={Borgs, Christian and Brautbar, Michael and Chayes, Jennifer and Lucier, Brendan}, + booktitle={SODA}, + volume={14}, + year={2014}, + organization={SIAM} +} + +@inproceedings{HIMM11, + author = {Nima Haghpanah and + Nicole Immorlica and + Vahab S. Mirrokni and + Kamesh Munagala}, + title = {Optimal auctions with positive network externalities}, + booktitle = {ACM Conference on Electronic Commerce}, + year = {2011}, + pages = {11-20}, + ee = {http://doi.acm.org/10.1145/1993574.1993577}, + crossref = {DBLP:conf/sigecom/2011}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{W82, + title={Maximising real-valued submodular functions: Primal and dual heuristics for location problems}, + author={Wolsey, Laurence A}, + journal={Mathematics of Operations Research}, + volume={7}, + number={3}, + pages={410--425}, + year={1982}, + publisher={INFORMS} +} + +@article{fb, + author = {Johan Ugander and + Brian Karrer and + Lars Backstrom and + Cameron Marlow}, + title = {The Anatomy of the Facebook Social Graph}, + journal = {CoRR}, + volume = {abs/1111.4503}, + year = {2011}, + ee = {http://arxiv.org/abs/1111.4503}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{ACKS13, + author = {Ittai Abraham and + Shiri Chechik and + David Kempe and + Aleksandrs Slivkins}, + title = {Low-distortion Inference of Latent Similarities from a Multiplex + Social Network}, + booktitle = {SODA}, + year = {2013}, + pages = {1853-1872}, + ee = {http://knowledgecenter.siam.org/0236-000019/}, + crossref = {DBLP:conf/soda/2013}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{KKT05, + author = {David Kempe and + Jon M. Kleinberg and + {\'E}va Tardos}, + title = {Influential Nodes in a Diffusion Model for Social Networks}, + booktitle = {ICALP}, + year = {2005}, + pages = {1127-1138}, + ee = {http://dx.doi.org/10.1007/11523468_91}, + crossref = {DBLP:conf/icalp/2005}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{HMS08, + author = {Jason D. Hartline and + Vahab S. Mirrokni and + Mukund Sundararajan}, + title = {Optimal marketing strategies over social networks}, + booktitle = {WWW}, + year = {2008}, + pages = {189-198}, + ee = {http://doi.acm.org/10.1145/1367497.1367524}, + crossref = {DBLP:conf/www/2008}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@misc{facebook, + howpublished = "\url{http://www.facebook.com}" +} + +@misc{clp, + howpublished = "\url{https://projects.coin-or.org/Clp}" +} + +@CONFERENCE{manuel2013icml, + author = {Gomez-Rodriguez, M. and Leskovec, J. and Sch\"{o}lkopf, B>}, + title = {Modeling Information Propagation with Survival Theory}, + booktitle = {ICML}, + year = {2013} +} + + +@conference{du13nips, + title={Scalable Influence Estimation in Continuous-Time Diffusion Networks}, + author={Du, N. and Song, L. and Gomez-Rodriguez, M. and Zha, H.}, + booktitle={NIPS '13: Advances in Neural Information Processing Systems}, + year={2013} +} diff --git a/paper/para.pdf b/paper/para.pdf Binary files differnew file mode 100644 index 0000000..396034c --- /dev/null +++ b/paper/para.pdf diff --git a/paper/perf.pdf b/paper/perf.pdf Binary files differnew file mode 100644 index 0000000..d86ec39 --- /dev/null +++ b/paper/perf.pdf diff --git a/paper/scalable.pdf b/paper/scalable.pdf Binary files differnew file mode 100644 index 0000000..f921d1c --- /dev/null +++ b/paper/scalable.pdf diff --git a/paper/scalable_adaptive_seeding.pdf b/paper/scalable_adaptive_seeding.pdf Binary files differnew file mode 100644 index 0000000..f921d1c --- /dev/null +++ b/paper/scalable_adaptive_seeding.pdf diff --git a/paper/sections/abstract.tex b/paper/sections/abstract.tex new file mode 100644 index 0000000..b166d6a --- /dev/null +++ b/paper/sections/abstract.tex @@ -0,0 +1,6 @@ +In recent years social networking platforms have developed into extraordinary channels for spreading and consuming information. +Along with the rise of such infrastructure, there is continuous progress on techniques for spreading information effectively through influential users. + +In this paper, we describe scalable algorithms for a new method of information diffusion called adaptive seeding. In many applications, one is restricted to select influencers from a set of users who engaged with the topic being promoted, and due to the structure of social networks, these users often rank low in terms of their influence potential. To overcome this hurdle, adaptive seeding aims to select users in a manner which targets their influential neighbors. + +Despite the various complexities involved with the optimization problem, we show that scalable adaptive seeding is achievable. In particular, we develop algorithms for linear influence models with provable approximation guarantees that can be gracefully parallelized. To show the effectiveness of our methods we collected data from various verticals social network users follow. For each vertical, we collected data on the users who responded to a certain post as well as their neighbors, and applied our methods on this data. Our experiments show that adaptive seeding is scalable, and importantly, that it obtains dramatic improvements over standard approaches of information dissemination. diff --git a/paper/sections/algorithms.log b/paper/sections/algorithms.log new file mode 100644 index 0000000..6265672 --- /dev/null +++ b/paper/sections/algorithms.log @@ -0,0 +1,1500 @@ +This is pdfTeX, Version 3.1415926-2.5-1.40.14 (TeX Live 2013) (format=pdflatex 2013.5.30) 19 FEB 2014 20:53 +entering extended mode + restricted \write18 enabled. + file:line:error style messages enabled. + %&-line parsing enabled. +**algorithms.tex +(./algorithms.tex +LaTeX2e <2011/06/27> +Babel <3.9f> and hyphenation patterns for 78 languages loaded. + +./algorithms.tex:4: LaTeX Error: Missing \begin{document}. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.4 W + e will say that a policy is non-adaptive if it selects a set of nodes $... + +? +Missing character: There is no W in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no - in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +LaTeX Font Info: External font `cmex10' loaded for size +(Font) <7> on input line 4. +LaTeX Font Info: External font `cmex10' loaded for size +(Font) <5> on input line 4. +Missing character: There is no t in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no , in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no . in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no . in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no z in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no . in font nullfont! +Missing character: There is no T in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no x in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no , in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no . in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no . in font nullfont! +Missing character: There is no . in font nullfont! +Missing character: There is no N in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no - in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no q in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no - in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no . in font nullfont! +Missing character: There is no F in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no z in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no - in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no : in font nullfont! + +Overfull \hbox (20.0pt too wide) in paragraph at lines 4--10 +[] + [] + + +Overfull \hbox (17.26382pt too wide) in paragraph at lines 4--10 +\OML/cmm/m/it/10 S \OMS/cmsy/m/n/10 ^^R + [] + + +Overfull \hbox (9.06943pt too wide) in paragraph at lines 4--10 +\OML/cmm/m/it/10 X$ + [] + + +Overfull \hbox (6.06941pt too wide) in paragraph at lines 4--10 +[]$ + [] + + +Overfull \hbox (5.72458pt too wide) in paragraph at lines 4--10 +\OML/cmm/m/it/10 u$ + [] + + +Overfull \hbox (6.70831pt too wide) in paragraph at lines 4--10 +\OML/cmm/m/it/10 S$ + [] + + +Overfull \hbox (9.69218pt too wide) in paragraph at lines 4--10 +\OML/cmm/m/it/10 q[]$ + [] + + +Overfull \hbox (20.04169pt too wide) in paragraph at lines 4--10 +\OMS/cmsy/m/n/10 j\OML/cmm/m/it/10 S\OMS/cmsy/m/n/10 j \OT1/cmr/m/n/10 + + [] + + +Overfull \hbox (29.31343pt too wide) in paragraph at lines 4--10 +[][][] \OMS/cmsy/m/n/10 ^^T + [] + + +Overfull \hbox (5.52084pt too wide) in paragraph at lines 4--10 +\OML/cmm/m/it/10 k$ + [] + + +./algorithms.tex:11: LaTeX Error: Missing \begin{document}. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.11 \begin{equation} + \label{eq:relaxed} +? + +Overfull \hbox (20.0pt too wide) in paragraph at lines 11--11 +[] + [] + + +./algorithms.tex:12: LaTeX Error: Environment split undefined. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.12 \begin{split} + +? +./algorithms.tex:14: Undefined control sequence. +l.14 \max_{\substack + {S\subseteq X\\q\in[0,1]^n} }& \; +? +./algorithms.tex:14: Misplaced alignment tab character &. +l.14 ...x_{\substack{S\subseteq X\\q\in[0,1]^n} }& + \; +? +./algorithms.tex:15: Undefined control sequence. +l.15 \sum_{R\subseteq\neigh + {X}}\textbf{p}\odot\textbf{q}_Rf(R)\\ +? +./algorithms.tex:16: Undefined control sequence. +<recently read> \text + +l.16 \text + {s.t. } & \; |S|+\textbf{p}^T\textbf{q} \leq k,\; +? +./algorithms.tex:16: Misplaced alignment tab character &. +l.16 \text{s.t. } & + \; |S|+\textbf{p}^T\textbf{q} \leq k,\; +? +./algorithms.tex:17: Undefined control sequence. +l.17 q_u \leq \mathbf{1}_{\{u\in\neigh + {S}\}} +? + +./algorithms.tex:18: LaTeX Error: \begin{equation} on input line 11 ended by \e +nd{split}. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.18 \end{split} + +? + +Overfull \hbox (255.8566pt too wide) detected at line 19 +[][] [] [] \OMS/cmsy/m/n/10 ^^L [][]\OML/cmm/m/it/10 f\OT1/cmr/m/n/10 (\OML/cm +m/m/it/10 R\OT1/cmr/m/n/10 )[] [] \OMS/cmsy/m/n/10 j\OML/cmm/m/it/10 S\OMS/cmsy +/m/n/10 j \OT1/cmr/m/n/10 + [][][] \OMS/cmsy/m/n/10 ^^T \OML/cmm/m/it/10 k; q[ +] \OMS/cmsy/m/n/10 ^^T \OT1/cmr/bx/n/10 1[] + [] + + +./algorithms.tex:21: LaTeX Error: Missing \begin{document}. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.21 w + here $n\defeq|\neigh{X}|$,$\textbf{p}\odot \textbf{q}$ denotes compone... + +? +Missing character: There is no w in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no e in font nullfont! +./algorithms.tex:21: Undefined control sequence. +l.21 where $n\defeq + |\neigh{X}|$,$\textbf{p}\odot \textbf{q}$ denotes compone... + +? +./algorithms.tex:21: Undefined control sequence. +l.21 where $n\defeq|\neigh + {X}|$,$\textbf{p}\odot \textbf{q}$ denotes compone... + +? +Missing character: There is no , in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no : in font nullfont! + +Overfull \hbox (20.0pt too wide) in paragraph at lines 21--22 +[] + [] + + +Overfull \hbox (34.794pt too wide) in paragraph at lines 21--22 +\OML/cmm/m/it/10 n\OMS/cmsy/m/n/10 j\OML/cmm/m/it/10 X\OMS/cmsy/m/n/10 j$$[] ^^ +L + [] + + +Overfull \hbox (6.06941pt too wide) in paragraph at lines 21--22 +[]$ + [] + + +Overfull \hbox (12.6295pt too wide) in paragraph at lines 21--22 +[][]$ + [] + + +Overfull \hbox (6.06941pt too wide) in paragraph at lines 21--22 +[]$ + [] + + +Overfull \hbox (7.67015pt too wide) in paragraph at lines 21--22 +\OML/cmm/m/it/10 R$ + [] + + +./algorithms.tex:23: LaTeX Error: Missing \begin{document}. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.23 \begin{displaymath} + +? + +Overfull \hbox (20.0pt too wide) in paragraph at lines 23--23 +[][] + [] + +./algorithms.tex:24: Undefined control sequence. +l.24 \txtbf + {p}\circ \textbf{q}_R = \prod_{u\in R} p_uq_u\prod_{u\in\neig... + +? +./algorithms.tex:24: Undefined control sequence. +l.24 ...R = \prod_{u\in R} p_uq_u\prod_{u\in\neigh + {X}\setminus +? + +Overfull \hbox (143.33928pt too wide) detected at line 26 +\OML/cmm/m/it/10 p \OMS/cmsy/m/n/10 ^^N [][] \OT1/cmr/m/n/10 = [] \OML/cmm/m/it +/10 p[]q[] []\OT1/cmr/m/n/10 (1 \OMS/cmsy/m/n/10 ^^@ \OML/cmm/m/it/10 p[]q[]\OT +1/cmr/m/n/10 ) + [] + + +./algorithms.tex:28: LaTeX Error: Missing \begin{document}. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.28 N + ote that because of the condition $q_u\leq \mathbf{1}_{\{u\in\neigh{S}... + +? +Missing character: There is no N in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +./algorithms.tex:28: Undefined control sequence. +l.28 ...ondition $q_u\leq \mathbf{1}_{\{u\in\neigh + {S}\}}$, +? +Missing character: There is no , in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +./algorithms.tex:30: Undefined control sequence. +<recently read> \neigh + +l.30 $\neigh + {X}\setminus\neigh{S}$. Hence, the summation in \eqref{eq:relaxe... + +? +./algorithms.tex:30: Undefined control sequence. +l.30 $\neigh{X}\setminus\neigh + {S}$. Hence, the summation in \eqref{eq:relaxe... + +? +Missing character: There is no . in font nullfont! +Missing character: There is no H in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no , in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +./algorithms.tex:30: Undefined control sequence. +l.30 ...\neigh{S}$. Hence, the summation in \eqref + {eq:relaxed} is +? +Missing character: There is no e in font nullfont! +Missing character: There is no q in font nullfont! +Missing character: There is no : in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no x in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no o in font nullfont! +./algorithms.tex:31: Undefined control sequence. +l.31 restricted to $R\subseteq\neigh + {S}$ as in \eqref{eq:problem}. +? +Missing character: There is no a in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +./algorithms.tex:31: Undefined control sequence. +l.31 ...cted to $R\subseteq\neigh{S}$ as in \eqref + {eq:problem}. +? +Missing character: There is no e in font nullfont! +Missing character: There is no q in font nullfont! +Missing character: There is no : in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no . in font nullfont! + +Overfull \hbox (20.0pt too wide) in paragraph at lines 28--32 +[] + [] + + +Overfull \hbox (20.2477pt too wide) in paragraph at lines 28--32 +\OML/cmm/m/it/10 q[] \OMS/cmsy/m/n/10 ^^T + [] + + +Overfull \hbox (29.85446pt too wide) in paragraph at lines 28--32 +\OT1/cmr/bx/n/10 1[]$ + [] + + +Overfull \hbox (10.03127pt too wide) in paragraph at lines 28--32 +\OML/cmm/m/it/10 p \OMS/cmsy/m/n/10 ^^N + [] + + +Overfull \hbox (21.57973pt too wide) in paragraph at lines 28--32 +\OML/cmm/m/it/10 q[] \OT1/cmr/m/n/10 = + [] + + +Overfull \hbox (5.00002pt too wide) in paragraph at lines 28--32 +\OT1/cmr/m/n/10 0$ + [] + + +Overfull \hbox (7.67015pt too wide) in paragraph at lines 28--32 +\OML/cmm/m/it/10 R$ + [] + + +Overfull \hbox (14.06944pt too wide) in paragraph at lines 28--32 +\OML/cmm/m/it/10 X \OMS/cmsy/m/n/10 n + [] + + +Overfull \hbox (6.70831pt too wide) in paragraph at lines 28--32 +\OML/cmm/m/it/10 S$ + [] + + +Overfull \hbox (18.22566pt too wide) in paragraph at lines 28--32 +\OML/cmm/m/it/10 R \OMS/cmsy/m/n/10 ^^R + [] + + +Overfull \hbox (6.70831pt too wide) in paragraph at lines 28--32 +\OML/cmm/m/it/10 S$ + [] + +./algorithms.tex:60: Undefined control sequence. +l.60 \subsection + {Adaptivity gap for additive functions} +? + +./algorithms.tex:60: LaTeX Error: Missing \begin{document}. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.60 \subsection{A + daptivity gap for additive functions} +? +Missing character: There is no A in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no W in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no j in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no - in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no - in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no . in font nullfont! + +Overfull \hbox (20.0pt too wide) in paragraph at lines 60--62 +[] + [] + + +./algorithms.tex:63: LaTeX Error: Missing \begin{document}. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.63 t + his form of non-adap +? +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no - in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no W in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no k in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no y in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no . in font nullfont! +Missing character: There is no F in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no , in font nullfont! +Missing character: There is no w in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no : in font nullfont! +Missing character: There is no . in font nullfont! + +Overfull \hbox (20.0pt too wide) in paragraph at lines 63--67 +[] + [] + + +Overfull \hbox (33.38863pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 relaxed- + [] + + +Overfull \hbox (16.35547pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 non + [] + + +Overfull \hbox (24.02208pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 adap- + [] + + +Overfull \hbox (15.58876pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 tive + [] + + +Overfull \hbox (18.91098pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 poli- + [] + + +Overfull \hbox (16.35544pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 cies + [] + + +Overfull \hbox (13.41655pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 are + [] + + +Overfull \hbox (35.26639pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 stronger + [] + + +Overfull \hbox (19.16655pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 than + [] + + +Overfull \hbox (19.93321pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 non- + [] + + +Overfull \hbox (36.0331pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 adaptive + [] + + +Overfull \hbox (18.91098pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 poli- + [] + + +Overfull \hbox (16.35544pt too wide) in paragraph at lines 63--67 +\OT1/cmr/m/it/10 cies + [] + + +./algorithms.tex:69: LaTeX Error: Environment proposition undefined. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.69 \begin{proposition} + \label{prop:gap} +? + +./algorithms.tex:70: LaTeX Error: Missing \begin{document}. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H <return> for immediate help. + ... + +l.70 F + or additive functions of the form given by \eqref{eq:voter}, non-a... + +? +Missing character: There is no F in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no u in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no f in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no m in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no b in font nullfont! +Missing character: There is no y in font nullfont! +./algorithms.tex:70: Undefined control sequence. +l.70 ...tive functions of the form given by \eqref + {eq:voter}, non-adaptive +? +Missing character: There is no e in font nullfont! +Missing character: There is no q in font nullfont! +Missing character: There is no : in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no , in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no - in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no c in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no s in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no g in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no r in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no h in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no n in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no d in font nullfont! +Missing character: There is no a in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no t in font nullfont! +Missing character: There is no i in font nullfont! +Missing character: There is no v in font nullfont! +Missing character: There is no e in font nullfont! +Missing character: There is no p in font nullfont! +Missing character: There is no o in font nullfont! +Missing character: There is no l in font nullfont! +Missing character: There is no i in font n
\ No newline at end of file diff --git a/paper/sections/algorithms.tex b/paper/sections/algorithms.tex new file mode 100644 index 0000000..e59de2a --- /dev/null +++ b/paper/sections/algorithms.tex @@ -0,0 +1,508 @@ +%In our context, a non-adaptive policy is simply a policy that makes all its decision before the realizations occur. That is, before the algorithm sees which neighbors arrive, it decides on how to allocate its seeding budget. This is in contrast to the optimal adaptive policy which waits for nodes to arrive. +% + +We start by introducing \emph{non-adaptive policies} for the adaptive seeding problem. These policies are used as a tool to obtain adaptive solutions as will be discussed in Sections~\ref{sec:gap} and~\ref{sec:round}. +We will say that a policy is non-adaptive if it selects a set of nodes $S +\subseteq X$ to be seeded in the first stage and a vector of probabilities +$\mathbf{q}\in[0,1]^n$, s.t. each neighbor $u$ of $S$ which realizes +is included in the solution independently with probability $q_u$. The +constraint will now be that the budget is only respected in expectation, i.e. +$|S| + \textbf{p}^T\textbf{q} \leq k$. Formally the optimization problem for non-adaptive policies can be written as: +\begin{equation}\label{eq:relaxed} + \begin{split} + %&\max_{} + \max_{\substack{S\subseteq X\\q\in[0,1]^n} }& \; + \sum_{R\subseteq\neigh{X}} \Big (\prod_{u\in R} p_uq_u\prod_{u\in\neigh{X}\setminus + R}(1-p_uq_u) \Big ) + f(R)\\ + \text{s.t. } & \; |S|+\textbf{p}^T\textbf{q} \leq k,\; +q_u \leq \mathbf{1}_{\{u\in\neigh{S}\}} +\end{split} +\end{equation} + +%$\textbf{p}\odot \textbf{q}$ denotes componentwise multiplication and $\textbf{q}_R$ denotes the positive entries of $\textbf{q}$ on nodes in $R$: +% +%\begin{displaymath} +% \textbf{p}\circ \textbf{q}_R = \prod_{u\in R} p_uq_u\prod_{u\in\neigh{X}\setminus +% R}(1-p_uq_u) +%\end{displaymath} +% +%\begin{displaymath} +% \Pr[R \ |\ \textbf{p}\odot \textbf{q} ] = \prod_{u\in R} p_uq_u\prod_{u\in\neigh{X}\setminus +% R}(1-p_uq_u) +%\end{displaymath} + +Note that because of the condition $q_u\leq \mathbf{1}_{\{u\in\neigh{S}\}}$, +the summand associated with $R$ in \eqref{eq:relaxed} vanishes whenever $R$ +contains $u\in\neigh{X}\setminus\neigh{S}$. Hence, the summation is restricted +to $R\subseteq\neigh{S}$ as in \eqref{eq:problem}. + +%The relaxed non-adaptive optimization \eqref{eq:relaxed} problem can be written +%more concisely using the \emph{multi-linear extension} of $f$: +%\begin{displaymath} +% \forall p\in[0,1]^m,\; F(p) +% \defeq\mathbb{E}_{p_R}\big[f(R)\big] +% =\sum_{R\subseteq\neigh{X}} p_R f(R) +%\end{displaymath} +%This \emph{extension by expectation} is known to present cross-convecity +%properties which can exploited in maximization problems when $f$ is +%a submodular function \cite{dughmi, vondrak}. Using this definition, \eqref{eq:relaxed} +%can be re-written as: +%\begin{equation}\label{eq:relaxed-multi} +% \begin{split} +% &\max_{S\subseteq X} \max_{q\in[0,1]^n}F(p\circ q)\\ +% &\text{s.t. }|S|+\sum_{u\in\neigh{X}}p_uq_u \leq k,\; +%q_u \leq \mathbf{1}_{\{u\in\neigh{S}\}} +%\end{split} +%\end{equation} +% +%When $f$ is an ìnfluence function from the triggering model, it has been proved +%in \cite{singer} that adaptive seeding has a bounded \emph{adaptivity gap}: +%denoting by $OPT$ the optimal solution of \eqref{eq:problem} and by $OPT_{NA}$ +%the optimal solution of \eqref{eq:relaxed}, we have $OPT\leq\alpha OPT_{NA}$. +%This inequality justifies using non-adaptive policies to approximate solutions +%to the adaptive seeding problem. + +\subsection{Adaptivity gap for additive functions}\label{sec:gap} + +We will now justify the use of non-adaptive strategies by showing that the optimal solution for this form of non-adaptive strategies yields a higher value than adaptive ones. +For brevity, given a probability vector $\mathbf{p}$ we will write: +\begin{equation}\label{eq:multi} + F(\textbf{p}) \defeq\mathbb{E}_{\mathbf{p}}\big[f(R)\big] + =\sum_{R\subseteq\neigh{X}}p_R f(R) +\end{equation} +as well as $\textbf{p}\circ \textbf{q}$ to denote the component-wise multiplication between vectors $\textbf{p}$ and $\textbf{q}$. Finally, we will use $\mathcal{F}_{A} := \{S \subseteq X : |S|\leq k\}$, and $\mathcal{F}_{NA} :=\{(S,\textbf{q}), |S|+\textbf{p}^T\textbf{q} \leq k, q_u \leq \mathbf{1}_{\{u\in\neigh{S}\}}\}$ to denote the feasible regions of the adaptive and non adaptive problems, respectively. + +%this form of non-adap +%We already know that the adaptivity gap is bounded for a general class of +%influence function. For adaptive functions, we get a stronger result: +%\emph{relaxed-non adaptive policies are stronger than non-adaptive policies}. +% +% +\begin{proposition}\label{prop:gap} +For additive functions given by \eqref{eq:voter}, non-adaptive + policies are stronger than adaptive policies: + \begin{displaymath} + \begin{aligned}[t] + &\max_{S\subseteq X} \sum_{R\subseteq\neigh{S}} p_R + \max_{\substack{T\subseteq R\\|T|\leq k-|S|}}f(T)\\ + &\text{s.t. }S \in \mathcal{F}_{A} + \end{aligned} + \leq + \begin{aligned}[t] + &\max_{\substack{S\subseteq X\\q\in[0,1]^n}} + F(\mathbf{p}\circ\mathbf{q})\\ + &\text{s.t. } (S,q) \in \mathcal{F}_{NA} + \end{aligned} + \end{displaymath} +\end{proposition} + +%\begin{proposition}\label{prop:gap} +%Let $\mathcal{F}_{A} := \{T \subseteq X : |T|\leq k\}$, $\mathcal{F}_{NA} :=\{(T,\textbf{q}), |S|+\textbf{p}^T\textbf{q} \leq k, q_u \leq \mathbf{1}_{\{u\in\neigh{S}\}}\}$. +%For additive functions of the form given by \eqref{eq:voter}, non-adaptive +% policies are stronger than adaptive policies: +% \begin{displaymath} +% \begin{aligned}[t] +% &\max_{S\subseteq X} \sum_{R\subseteq\neigh{S}} p_R +% \max_{\substack{T\subseteq R\\|T|\leq k-|S|}}f(T)\\ +% &\text{s.t. }|S|\leq k +% \end{aligned} +% \leq +% \begin{aligned}[t] +% &\max_{S\subseteq X} \max_{q\in[0,1]^n}F(p\circ q)\\ +% &\text{s.t. }|S|+\sum_{u\in\neigh{X}}p_uq_u \leq k,\; +% q_u \leq \mathbf{1}_{\{u\in\neigh{S}\}} +% \end{aligned} +% \end{displaymath} +%\end{proposition} + +\begin{proof} + We will first show that the optimal adaptive policy can be interpreted as + a non-adaptive policy. Let $S$ be the optimal adaptive + solution and define $\delta_R:\neigh{X}\mapsto \{0,1\}$: + \begin{displaymath} + \delta_R(u) \defeq \begin{cases} + 1&\text{if } u\in\argmax\big\{f(T);\; T\subseteq R,\; |T|\leq + k-|S|\big\} \\ + 0&\text{otherwise} + \end{cases}, + \end{displaymath} + one can write + \begin{displaymath} + \begin{split} + \sum_{R\subseteq\neigh{S}} p_R + \max_{\substack{T\subseteq R\\|T|\leq k-|S|}}f(T) + &= + \sum_{R\subseteq\neigh{S}} p_R + \sum_{u\in\neigh{X}}\delta_R(u)w_u\\ + &= + \sum_{u\in\neigh{X}}w_u\sum_{R\subseteq\neigh{S}}p_R\delta_R(u). + \end{split} + \end{displaymath} + + Let us now define for $u\in\neigh{X}$: + \begin{displaymath} + q_u \defeq \begin{cases} + \sum_{R\subseteq\neigh{S}}\frac{p_R}{p_u}\delta_R(u) + &\text{if }p_u\neq 0\\ + 0&\text{otherwise} + \end{cases}. + \end{displaymath} + This allows us to write: + \begin{displaymath} + \sum_{R\subseteq\neigh{S}} p_R + \max_{\substack{T\subseteq R\\|T|\leq k-|S|}}f(T) + = \sum_{u\in\neigh{X}}p_uq_uw_u = F(\mathbf{p}\circ\mathbf{q}) + \end{displaymath} + where the last equality is obtained from \eqref{eq:multi} by successively using the linearity of the expectation and the linearity of $f$. + + Furthermore, observe that $q_u\in[0,1]$, $q_u=0$ if $u\notin\neigh{S}$ and: + \begin{displaymath} + \begin{split} + |S|+\sum_{u\in\neigh{X}}p_uq_u + &= |S|+\sum_{R\subseteq\neigh{S}}p_R\sum_{u\in\neigh{X}}\delta_R(u)\\ + &\leq |S| + \sum_{R\subseteq\neigh{S}}p_R(k-|S|)\leq k + \end{split} + \end{displaymath} + + Hence, $(S,\mathbf{q})\in\mathcal{F}_{NA}$. In other words, we have written the optimal adaptive solution as a relaxed + non-adaptive solution. This conclude the proof of the proposition. +\end{proof} + +\subsection{From non-adaptive to adaptive solutions}\label{sec:round} +From the above proposition we now know that optimal non-adaptive solutions have +higher values than adaptive solutions. A priori, this does not imply that non-adaptive solutions are good adaptive solutions. More precisely, a non-adaptive solution is a pair $(S, \mathbf{q})$ such that starting from $S$ on the first stage and sampling nodes with probability $\mathbf{q}$ on the second stage will result in a solution which is as good as $\mathrm{A}(S)$ in expectation, where $\mathrm{A}$ denotes the objective function of the adaptive problem \eqref{eq:relaxed}. However, the set resulting from the sampling might exceed the budget on the second stage, hence preventing us from directly obtaining a feasible adaptive solution. + +Fortunately, the probability of exceeding the budget is small enough and with high probability the sampled set will be feasible. This property is leveraged in \cite{vondrak} to design a randomized rounding method with approximation guarantees. This randomized roundings are called \emph{contention resolution schemes}. More precisely, we note that once the set $S$ is fixed, the feasibility constraint of problem~\eqref{eq:relaxed} becomes a single Knapsack constraint, for which \cite{vondrak} constructs a $(1-\varepsilon, 1-\varepsilon)$-balanced contention resolution scheme. Applying Theorem~1.3 of the same paper, this contention resolution scheme will compute from $\mathbf{q}$ a \emph{feasible} random set $I$, such that: +\begin{equation}\label{eq:cr} +\mathbb{E}\big[f(I)\big] +\geq (1-\varepsilon) F(\mathbf{q}) +\end{equation} + +Equation~\eqref{eq:cr} allows us to prove the following proposition, where $\mathrm{OPT}_{NA}$ denotes the optimal value of problem~\eqref{eq:relaxed} and $\mathrm{OPT}_A$ denotes the optimal value of problem~\eqref{eq:problem}. + +\begin{proposition}\label{prop:cr} + Let $(S,\textbf{q})$ be an $\alpha$-approximate solution to the non-adaptive problem \eqref{eq:relaxed}, then $\mathrm{A}(S) \geq \alpha \mathrm{OPT}_A$. +\end{proposition} + +\begin{proof} + Using the definition of $\mathrm{A}(S)$, one can write: + \begin{displaymath} + \mathrm{A}(S) = \sum_{R\subseteq\neigh{S}} p_R + \max_{\substack{T\subseteq R\\|T|\leq k-|S|}}f(T) + \geq \sum_{R\subseteq\neigh{S}} p_R \mathbf{E}\big[f(I)\big] + \end{displaymath} + where the inequality comes from the fact that $I$ is a feasible random set: $|I|\leq k-|S|$, hence the expected value of $f(I)$ is bounded by the maximum of $f$ over feasible sets. + +Equation~\eqref{eq:cr} then implies: +\begin{equation}\label{eq:tmp} + \mathrm{A}(S) + \geq (1-\varepsilon)\sum_{R\subseteq\neigh{S}} p_R F(\mathbf{q}) + = (1-\varepsilon)F(\mathbf{p}\circ\mathbf{q}). +\end{equation} + +Equation~\eqref{eq:tmp} holds for any $\varepsilon\geq 0$. In particular, for $\varepsilon$ smaller than $\inf_{S\neq T} |A(S)-A(T)|$, we obtain that $\mathrm{A}(S)\geq F(\mathbf{p}\circ\mathbf{q})$. Note that such a $\varepsilon$ is at most polynomially small in the size of the instance. +$(S, \mathbf{q})$ is an $\alpha$-approximate non adaptive solution, hence $F(\mathbf{p}\circ\mathbf{q}) \geq \alpha\mathrm{OPT}_{NA}$. We can then conclude by applying Proposition~\ref{prop:gap}. +\end{proof} + +Therefore the adaptive seeding problem reduces to the non-adaptive problem. We will now discuss two approaches to construct non-adaptive solutions. The first is an LP-based approach, and the second is a combinatorial algorithm. Both approaches have the same $(1-1/e)$ approximation ratio, which is then translated to a $(1-1/e)$ approximation ratio for the adaptive seeding problem~\eqref{eq:problem} via Proposition~\ref{prop:cr}. + +\subsection{An LP-Based Approach} +Note that due to linearity of expectation, for a linear function $f$ of the form given by \eqref{eq:voter} we have: +\begin{equation}\label{eq:multi-voter} + \begin{split} + F(\textbf{p}) + &=\mathbb{E}_{p_R}\big[f(R)\big] + =\mathbb{E}_{p_R}\Bigg[\sum_{u\in\neigh{X}}w_u\mathbf{1}_{\{u\in + R\}}\Bigg]\\ + &=\sum_{u\in\neigh{X}}w_u\mathbb{P}[u\in R] + =\sum_{u\in\neigh{X}}p_uw_u + \end{split} +\end{equation} + +Thus, the non-adaptive optimization problem \eqref{eq:relaxed} can be written as: +\begin{displaymath} + \begin{split} + \max_{\substack{S\subseteq X\\q\in[0,1]^n} } + & \sum_{u\in\neigh{X}}p_uq_uw_u\\ + \text{s.t. } & |S|+ \textbf{p}^T\textbf{q} \leq k,\; + q_u \leq \mathbf{1}_{\{u\in\neigh{S}\}} + \end{split} +\end{displaymath} + +The choice of the set $S$ can be relaxed by introducing a variable +$\lambda_v\in[0,1]$ for each $v\in X$. We obtain the following +LP for the adaptive seeding problem: +\begin{equation}\label{eq:lp} + \begin{split} + \max_{\substack{q\in[0,1]^n\\\lambda\in[0,1]^m}} + & \;\sum_{u\in\neigh{X}}p_uq_uw_u\\ + \text{s.t. } & \sum_{v\in X}\lambda_v+\textbf{p}^T\textbf{q} \leq k,\; + q_u \leq \sum_{v\in\neigh{u}} \lambda_v +\end{split} +\end{equation} + +An optimal solution to the above problem can be found using standard LP-solvers, in polynomial time. The solution returned by the LP is \emph{fractional}, and requires a rounding procedure to return a feasible solution to our problem, where $S$ is integral. We briefly describe our approach which uses the \emph{pipage rounding} method.\newline + +\noindent \textbf{Pipage Rounding.} +The pipage rounding method~\cite{pipage} is a deterministic rounding method that can be applied to a variety of problems. In particular, it can be applied to LP-relaxations of the \textsc{Max-K-Cover} problem where we are given a family of sets that cover elements of a universe and the goal is to find $k$ subsets whose union has the maximal cardinality. The LP-relaxation is a fractional solution over subsets, and the pipage rounding procedure then rounds the allocation in linear time, and the integral solution is guaranteed to be within a factor of $(1-1/e)$ of the fractional solution. +We make the following key observation: for any given $\textbf{q}$, one can remove all elements in $\mathcal{N}(X)$ for which $q_{u}=0$, without changing the value of any solution $(\lambda,\textbf{q})$. +Our rounding procedure can therefore be described as follows: given a solution $(\lambda,\textbf{q})$ we remove all nodes $u \in \mathcal{N}(X)$ for which $q_{u}=0$, which leaves us with a fractional solution to a (weighted) version of the \textsc{Max-K-Cover} problem where nodes in $X$ are the sets and the universe is the set of weighted nodes in $\mathcal{N}(X)$ that were not removed. We can therefore apply pipage rounding and lose only a factor of $(1-1/e)$ in quality of the solution. + +\begin{lemma} + For \mbox{\textsc{AdaptiveSeeding-LP}} as defined in \eqref{eq:lp}, any fractional solution $(\lambda, \mathbf{q})\in[0,1]^m\times[0,1]^n$ can be rounded to an integral solution $\bar{\lambda} \in \{0,1\}^{m}$ s.t. $(1-1/e) F(\mathbf{p}\circ\mathbf{q}) \leq A(\bar{\lambda})$ in $O(m + n)$ steps. +\end{lemma} + +\subsection{A Combinatorial Algorithm} +In this section, we will introduce a combinatorial algorithm with an identical approximation guarantee to the LP-based approach. The main idea is to reduce the problem to a monotone submodular maximization problem and apply a variant of the celebrated greedy algorithm~\cite{nemhauser}. +This property is quite a remarkable feature of linear influence models; for influence models such as independent cascade and linear threshold, the adaptive seeding problem does not reduce to submodular maximization, and a completely different approach is required~\cite{singer}. In contrast with standard influence maximization, the submodularity of the non-adaptive seeding problem is not simply a consequence of properties of the influence function. It also strongly relies on the combinatorial structure of the two stage optimization. + +Intuitively, we can think of our problem as trying to find a set $S$ in the first stage, for which the nodes that can be seeded on the second stage have the largest possible value. To formalize this, for a budget $b\in\reals^+$ used in the second stage and a set of neighbors $T\subseteq\mathcal{N}(X)$, we will use +$\mathcal{O}(T,b)$ to denote the solution to: +\begin{equation}\label{eq:knap} + \begin{split} + \mathcal{O}(T,b)\defeq + \max_{q\in[0,1]^n} & \sum_{u\in\neigh{X}} p_uq_uw_u\\ + \text{s.t. } & \mathbf{p}^T\mathbf{q}\leq b\text{ and } q_u=0\text{ if + }u\notin T +\end{split} +\end{equation} + +The optimization problem \eqref{eq:relaxed} for +non-adaptive policies can now be written as: +\begin{equation}\label{eq:sub} + \begin{split} + \max_{S\subseteq X} &\; \mathcal{O}\big(\neigh{S},k-|S|\big)\\ + \text{s.t. } & |S|\leq k + \end{split} +\end{equation} + +We start by proving in Proposition~\ref{prop:sub} that for fixed $t$, $\mathcal{O}(\neigh{\cdot}, t)$ is submodular. This proposition relies on lemmas~\ref{lemma:nd} and~\ref{lemma:sub} about the properties of $\mathcal{O}(T,b)$ first seen as a function $b$, then as a function of $T$. + +\begin{lemma}\label{lemma:nd} + Let $T \subseteq \mathcal{N}(X)$ and $x \in \mathcal{N}(X)$, then + $\mathcal{O}(T\cup\{x\},b)-\mathcal{O}(T,b)$ is + non-decreasing in $b$. +\end{lemma} + +\begin{proof} +\emph{W.l.o.g} we can rename and order the pairs in $T$ so that $w_1\geq w_2\geq\ldots\geq w_m $. +Then, $\mathcal{O}(T,b)$ has the following simple piecewise linear expression: +\begin{displaymath}\label{eq:pw} + \mathcal{O}(T,b) = + \begin{cases} + b w_1&\text{if }0\leq b<p_1\\ + \displaystyle + \sum_{k=1}^{i-1}p_k(w_k-w_i) + + b w_i + &\displaystyle\text{if } 0\leq b - \sum_{k=1}^{i-1}p_k< p_i\\ + \displaystyle + \sum_{k=1}^m p_kw_k + &\displaystyle\text{if } b\geq\sum_{i=1}^m p_k + + \end{cases} +\end{displaymath} + +Let us define for $t\in\reals^+$, $n(t)\defeq \inf\Big\{i\text{ s.t. +} \sum_{k=1}^i p_k > t\Big \}$ with $n(t)=+\infty$ when the set is empty. In +particular, note that $x\mapsto n(t)$ is non-decreasing. Denoting +$\partial_+\mathcal{O}_T$ the right derivative of $\mathcal{O}(T,\cdot)$, one +can write $\partial_+\mathcal{O}_T(t)=w_{n(t)}$, with the convention that +$w_\infty = 0$. + +Writing $i \defeq \sup\Big\{j\text{ s.t. +} w_j\geq w_x\Big\}$, it is easy to see that +$\partial_+\mathcal{O}_{T\cup\{x\}}\geq\partial_+\mathcal{O}_T$. Indeed: +\begin{enumerate} + \item if $n(t)\leq i$ then $\partial_+\mathcal{O}_{T\cup\{x\}}(t) + = \partial_+\mathcal{O}_T(t)= w_{n(t)}$. + \item if $n(t)\geq i+1$ and $n(t-c)\leq i$ then $\partial_+\mathcal{O}_{T\cup\{x\}}(t) + = w_x\geq w_{n(t)}= \partial_+\mathcal{O}_T(t)$. + \item if $n(t-c)\geq i+1$, then $\partial_+\mathcal{O}_{T\cup\{x\}} + = w_{n(t-c)}\geq w_{n(t)}=\partial_+\mathcal{O}_T(t)$. +\end{enumerate} + +Let us now consider $b$ and $c$ such that $b\leq c$. Then, using the integral +representation of $\mathcal{O}(T\cup\{x\},\cdot)$ and $\mathcal{O}(T,\cdot)$, we get: +\begin{multline*} + \mathcal{O}(T\cup\{x\},c)-\mathcal{O}(T\cup\{x\},b)=\int_b^c\partial_+\mathcal{O}_{T\cup\{x\}}(t)dt\\ + \geq\int_b^c\partial_+\mathcal{O}_T(t)dt=\mathcal{O}(T,c)-\mathcal{O}(T,b) +\end{multline*} +Re-ordering the terms, $\mathcal{O}(T\cup\{x\},c)-\mathcal{O}(T,c)\geq +\mathcal{O}(T\cup\{x\},b)-\mathcal{O}(T,b)$ +which concludes the proof of the lemma. +\end{proof} + +\begin{lemma}\label{lemma:sub} + For any $b\in\reals^+$, $\mathcal{O}(T,b)$ is submodular in $T$, $T\subseteq\neigh{X}$. +\end{lemma} + +\begin{proof} + Let $T\subseteq\neigh{X}$ and $x, y\in\neigh{X}\setminus T$. Using the + second-order characterization of submodular functions, it suffices to show + that: + \begin{displaymath}\label{eq:so} + \mathcal{O}(T\cup\{x\},b)-\mathcal{O}(T,b)\geq + \mathcal{O}(T\cup\{y, x\},b)-\mathcal{O}(T\cup\{y\},b) + \end{displaymath} + + We distinguish two cases based on the relative position of $w_x$ and $w_y$. + The following notations will be useful: $S_T^x \defeq \big\{u\in + T\text{ s.t. }w_x\leq w_u\big\}$ and $P_T^x\defeq + T\setminus S_T^x$. + + \textbf{Case 1:} If $w_y\geq w_x$, then one can + write: + \begin{gather*} + \mathcal{O}(T\cup\{y,x\},b) = \mathcal{O}(P_T^y\cup\{y\},b_1)+ + \mathcal{O}(S_T^y\cup\{x\},b_2)\\ + \mathcal{O}(T\cup\{y\},b) = \mathcal{O}(P_T^y\cup\{y\},b_1) + + \mathcal{O}(S_T^y,b_2) + \end{gather*} + where $b_1$ is the fraction of the budget $b$ spent on $P_T^y\cup\{y\}$ and + $b_2=b-b_1$. + + Similarly: + \begin{gather*} + \mathcal{O}(T\cup\{x\},b) = \mathcal{O}(P_T^y, c_1) + \mathcal{O}(S_T^y\cup\{x\},c_2)\\ + \mathcal{O}(T, b) = \mathcal{O}(P_T^y, c_1) + \mathcal{O}(S_T^y,c_2) + \end{gather*} + where $c_1$ is the fraction of the budget $b$ spent on $P_T^y$ and $c_2 + = b - c_1$. + + Note that $b_1\geq c_1$: an optimal solution will first spent as much + budget as possible on $P_T^y\cup\{y\}$ before adding elements in + $S_T^y\cup\{x\}$. + + In this case: + \begin{displaymath} + \begin{split} + \mathcal{O}(T\cup\{x\},b)-\mathcal{O}(T,b)&= + \mathcal{O}(S_T^y\cup\{x\},c_2)+\mathcal{O}(S_T^y,c_2)\\ + &\geq \mathcal{O}(S_T^y\cup\{x\},b_2)+\mathcal{O}(S_T^y,b_2)\\ + & = \mathcal{O}(T\cup\{y, x\},b)-\mathcal{O}(T\cup\{y\},b) + \end{split} + \end{displaymath} + where the inequality comes from Lemma~\ref{lemma:nd} and + $c_2\geq b_2$. + + \textbf{Case 2:} If $w_x > w_y$, we now decompose + the solution on $P_T^x$ and $S_T^x$: + \begin{gather*} + \mathcal{O}(T\cup\{x\},b) = \mathcal{O}(P_T^x\cup\{x\},b_1) + + \mathcal{O}(S_T^x,b_2)\\ + \mathcal{O}(T,b) = \mathcal{O}(P_T^x,c_1)+\mathcal{O}(S_T^x,c_2)\\ + %\intertext{and} + \mathcal{O}(T\cup\{y, x\},b) = \mathcal{O}(P_T^x\cup\{x\},b_1) + + \mathcal{O}(S_T^x\cup\{y\},b_2)\\ + \mathcal{O}(T\cup\{y\},b) = \mathcal{O}(P_T^x,c_1)+\mathcal{O}(S_T^x\cup\{y\},c_2) + \end{gather*} + with $b_1+b_2=b$, $c_1+c_2=b$ and $b_2\leq c_2$. + + In this case again: + \begin{multline*} + \mathcal{O}(T\cup\{x\},b)-\mathcal{O}(T,b)= + \mathcal{O}(S_T^x,b_2)-\mathcal{O}(S_T^x,c_2)\\ + \geq \mathcal{O}(S_T^x\cup\{y\},b_2)-\mathcal{O}(S_T^x\cup\{y\},c_2)\\ + = \mathcal{O}(T\cup\{y, x\},b)-\mathcal{O}(T\cup\{y\},b) + \end{multline*} + where the inequality uses Lemma~\ref{lemma:nd} and $c_2\geq b_2$. + + In both cases, we were able to obtain the second-order characterization of submodularity. This concludes the proof of the lemma. +\end{proof} + +\begin{proposition}\label{prop:sub} + Let $b\in\mathbf{R}^+$, then $\mathcal{O}(\neigh{S},b)$ is submodular in $S$, $S\subseteq X$. +\end{proposition} + +\begin{proof} + Let us consider $S$ and $T$ such that $S\subseteq T\subseteq X$ and $x\in + X\setminus T$. In particular, note that $\neigh{S}\subseteq\neigh{T}$. + + Let us write $\neigh{S\cup\{x\}}=\neigh{S}\cup R$ with $\neigh{S}\cap + R=\emptyset$ and similarly, $\neigh{T\cup\{x\}}=\neigh{T}\cup R'$ with + $\neigh{T}\cap R'=\emptyset$. It is clear that $R'\subseteq R$. Writing $R'=\{u_1,\ldots,u_k\}$: + \begin{multline*} + \mathcal{O}(\neigh{T\cup\{x\}},b)- \mathcal{O}(\neigh{T},b)\\ + =\sum_{i=1}^k\mathcal{O}(\neigh{T}\cup\{u_1,\ldots u_i\},b) + -\mathcal{O}(\neigh{T}\cup\{u_1,\ldots u_{i-1}\},b)\\ + \leq \sum_{i=1}^k\mathcal{O}(\neigh{S}\cup\{u_1,\ldots u_i\},b) + -\mathcal{O}(\neigh{S}\cup\{u_1,\ldots u_{i-1}\},b)\\ + =\mathcal{O}(\neigh{S}\cup R',b)-\mathcal{O}(\neigh{S},b) + \end{multline*} + where the inequality comes from the submodularity of $\mathcal{O}(\cdot,b)$ proved in Lemma~\ref{lemma:sub}. This same function is also obviously set-increasing, hence: + \begin{multline*} + \mathcal{O}(\neigh{S}\cup R',b)-\mathcal{O}(\neigh{S},b)\\ + \leq \mathcal{O}(\neigh{S}\cup R,b)-\mathcal{O}(\neigh{S},b)\\ + =\mathcal{O}(\neigh{S\cup\{x\}},b)-\mathcal{O}(\neigh{S},b) + \end{multline*} + This concludes the proof of the proposition. +\end{proof} + +We can now use Proposition~\ref{prop:sub} to reduce \eqref{eq:sub} to a monotone submodular maximization problem. First, we note that~\eqref{eq:sub} can be rewritten: +\begin{equation}\label{eq:sub-mod} + \begin{split} + &\max_{t}\max_{S\subseteq X} \; \mathcal{O}\big(\neigh{S},t\big)\\ + &\text{s.t. } |S| + t\leq k + \end{split} +\end{equation} + +Intuitively, we fix $t$ arbitrarily so that the inner $\max$ in \eqref{eq:sub-mod} becomes a submodular maximization problem with fixed budget $t$. We then optimize over the value of $t$. Combining this observation with the greedy algorithm for monotone submodular maximization~\cite{nemhauser}, we obtain Algorithm~\ref{alg:comb}, whose performance guarantee is summarized in Proposition~\ref{prop:main_result}. + +\begin{algorithm} + \caption{Combinatorial algorithm} + \label{alg:comb} + \algsetup{indent=2em} + \begin{algorithmic}[1] + \STATE $S\leftarrow \emptyset$ + \FOR{$t=1$ \TO $k-1$} + \STATE $S_t\leftarrow \emptyset$ + \FOR{$i=1$ \TO $k-t$} + \STATE $x^*\leftarrow\argmax_{x\in + X\setminus S_t}\mathcal{O}(\neigh{S_t\cup\{x\}},t) + -\mathcal{O}(\neigh{S_t},t)$\label{line:argmax} + \STATE $S_t\leftarrow S_t\cup\{x^*\}$ + \ENDFOR + \IF{$\mathcal{O}(\neigh{S_t},t)>\mathcal{O}(\neigh{S},k-|S|)$} + \STATE $S\leftarrow S_t$ + \ENDIF + \ENDFOR + \RETURN $S$ + \end{algorithmic} +\end{algorithm} + +\begin{proposition}\label{prop:main_result} + Let $S$ be the set computed by Algorithm~\ref{alg:comb} and let us denote + by $\mathrm{A}(S)$ the value of the adaptive policy selecting $S$ on the first + stage. Then $\mathrm{A}(S) \geq (1-1/e)\mathrm{OPT}_A$. +\end{proposition} + +\begin{proof} + We simply note that the content of the outer \textsf{for} loop on line 2 of Algorithm~\ref{alg:comb} is the greedy submodular maximization algorithm of \cite{nemhauser}. Since $\mathcal{O}(\neigh{\cdot}, t)$ is submodular (Proposition~\ref{prop:sub}), this solves the inner $\max$ in \eqref{eq:sub-mod} with an approximation ratio of $(1-1/e)$. The outer \textsf{for} loop then computes the outer $\max$ of \eqref{eq:sub-mod}. + + As a consequence, Algorithm~\ref{alg:comb} computes a $(1-1/e)$-approximate non-adaptive solution. We conclude by applying Proposition~\ref{prop:cr}. +\end{proof} +\subsection{Running time} +The algorithm described above considers all possible ways to split the seeding budget between the first and the second stage. For each possible split $\{(t,k-t)\}_{t=1\ldots,k-1}$, the algorithm computes an approximation to the optimal non adaptive solution that uses $k-t$ nodes in the first stage and $t$ nodes in the second stage, and returns the solution for the split with the highest value (breaking ties arbitrarily). This process can be trivially parallelized across $k-1$ machines, each performing a computation of a single split. + +A slightly more sophisticated approach is to consider only $\log n$ splits: $(1,k-1),(2,k-2),\ldots,(2^{\lfloor \log n \rfloor},1)$ and then select the best solution from this set. It is not hard to see that in comparison to the previous approach, this would reduce the approximation guarantee by a factor of at most 2: if the optimal solution is obtained by spending $t$ on the first stage and $k-t$ in the second stage, then since $t \leq 2\cdot2^{\lfloor \log t \rfloor}$ the solution computed for $(2^{\lfloor \log t \rfloor}, k - 2^{\lfloor \log t \rfloor})$ will have at least half that value. +More generally, for any $\epsilon>0$ one can parallelize over $\log_{1+\epsilon}n$ machines at the cost of losing a factor of $(1+\epsilon)$ in the approximation guarantee. + + +To implement Algorithm~\ref{alg:comb} efficiently, the computation of the $\argmax$ on line 5 must be dealt with carefully. $\mathcal{O}(\neigh{S_t\cup\{x\}},t)$ is the optimal solution to the fractional Knapsack problem~\eqref{eq:knap} with budget $t$ and can be computed in time $\min(\frac{t}{p_\text{min}},n)$ by iterating over the list of nodes in $\neigh{S_t\cup\{x\}}$ by decreasing order of the degrees. This decreasing order of $\neigh{S_t}$ can be maintained throughout the greedy construction of $S_t$ by: +\begin{itemize} +\item ordering the list of neighbors of nodes in $X$ by decreasing order of the degrees when initially constructing the graph. This is responsible for the $n\log n$ additive factor. +\item when adding node $x$ to $S_t$, observe that $\neigh{S_t\cup\{x\}} = \neigh{S_t}\cup\neigh{\{x\}}$. Hence, if $\neigh{S_t}$ and $\neigh{\{x\}}$ are sorted lists, then $\mathcal{O}(\neigh{S_t\cup\{x\}},t)$ can be computed in a single iteration of length $\min(\frac{t}{p_\text{min}},n)$ where the two sorted lists are merged on the fly. +\end{itemize} +As a consequence, the running time of line 5 is bounded from above by $m\min(\frac{t}{p_\text{min}},n)$. The two nested \textsf{for} loops are responsible for the additional $k^2$ factor. The running time of Algorithm~\ref{alg:comb} is summarized in Proposition~\ref{prop:running_time}. + +\begin{proposition}\label{prop:running_time} + Algorithm~\ref{alg:comb} runs in time $O\big(n\log + n + k^2 m \min(\frac{k}{p_\text{min}},n)\big)$, with $p_\text{min} =\min\{p_u,u\in\neigh{X}\}$. +\end{proposition} + + + + + + diff --git a/paper/sections/appendix.tex b/paper/sections/appendix.tex new file mode 100644 index 0000000..64ca77e --- /dev/null +++ b/paper/sections/appendix.tex @@ -0,0 +1,76 @@ + +\noindent \textbf{From expectation to high probability.} + +%\begin{lemma}\label{lemma:nd} +% Let $A\subseteq\mathcal{U}$ and $x=(v,c)\in\mathcal{U}\setminus A$, then +% the function $b\mapsto \mathcal{O}(A\cup\{x\},b)-\mathcal{O}(A,b)$ is +% non-decreasing over $\reals^+$. +%\end{lemma} + + + + + + +\begin{proof}[of Proposition~\ref{main_result}] + For each realization of the neighbors $R$, let us define by $X_R$ the + random set which includes each $u\in R$ with probability $q_u$ on the + second day and: + \begin{displaymath} + \tilde{X}_R= + \begin{cases} + X_R&\text{if } |X_R|\leq t\\ + \emptyset&\text{otherwise} + \end{cases} + \end{displaymath} + where $t = k-|S|$. $\tilde{X}_R$ is a random variable over the feasible + solutions on the second day. As a consequence: + \begin{displaymath} + A(S) \geq \sum_{R\subseteq\neigh{S}} p_R\mathbb{E}\big[f(\tilde{X}_R)\big] + \end{displaymath} + Let us define by $Y$ the random set which includes each $u\in\neigh{X}$ + with probability $p_uq_u$ and: + \begin{displaymath} + \tilde{Y}= + \begin{cases} + Y&\text{if } |Y|\leq t\\ + \emptyset&\text{otherwise} + \end{cases}. + \end{displaymath} + It is easy to see that $\tilde{X}_R$ is the conditional expectation of + $\tilde{Y}$ given + $R$. Hence: + \begin{displaymath} + \sum_{R\subseteq\neigh{S}} p_R\mathbb{E}\big[f(\tilde{X}_R)\big] + = \mathbb{E}\big[f(\tilde{Y})\big] + \end{displaymath} + But: + \begin{align*} + \mathbb{E}\big[f(\tilde{Y})\big] + &=\sum_{T\subseteq\neigh{X}}\mathbb{P}\big[\tilde{Y}=T\big]f(T) + = \sum_{\substack{T\subseteq\neigh{X}\\|T|\leq + t}}\mathbb{P}\big[Y=T\big]f(T)\\ + &= \mathbb{E}\big[f(Y)\big]-\sum_{\substack{T\subseteq\neigh{X}\\|T|> + t}}\mathbb{P}\big[Y=T\big]f(T) + \end{align*} + Roughly: + \begin{displaymath} + \sum_{\substack{T\subseteq\neigh{X}\\|T|> + t}}\mathbb{P}\big[Y=T\big]f(T)\leq + \frac{1}{2}\mathbb{E}\big[f(Y)\big] + \end{displaymath} + Combining the above inequalities we get: + \begin{displaymath} + A(S)\geq \frac{1}{2} \mathbb{E}\big[f(Y)\big] + \end{displaymath} + But $\mathbb{E}\big[f(Y)\big]$ is precisely the value of the non-adaptive + solution computed by Algorithm~\ref{alg:comb} which is + a $\left(1-\frac{1}{e}\right)$ approximation of the + optimal non adaptive solution. Hence: + \begin{displaymath} + A(S) \geq \frac{1}{2}\left(1-\frac{1}{e}\right) OPT_{NA} + \end{displaymath} + Finally, we conclude with Proposition~\ref{prop:gap} +\end{proof} + + diff --git a/paper/sections/combinatorial.tex b/paper/sections/combinatorial.tex new file mode 100644 index 0000000..b744564 --- /dev/null +++ b/paper/sections/combinatorial.tex @@ -0,0 +1,299 @@ +\subsection{Submodularity of the problem} +Let $\mathcal{U} = \{(v_u,c_u);\, u\in\neigh{X}\}$ with $v_u=p_uw_u$ and +$c_u=p_u$. Let $b\in\reals^+$ and $A\subseteq\mathcal{U}$, we denote by +$\mathcal{O}(A,b)$ the optimal solution to: +\begin{displaymath} + \begin{split} + &\max_{q\in[0,1]^n}\sum_{u\in\neigh{X}}q_uv_u\\ + &\text{s.t. }\sum_{u\in\neigh{X}}q_uc_u\leq b\text{ and } q_u=0\text{ if + }u\notin A +\end{split} +\end{displaymath} +so that the optimization problem \eqref{eq:relaxed-multi} for relaxed +non-adaptive policies can be written: +\begin{equation}\label{eq:sub} + \begin{split} + &\max_{S\subseteq X}\mathcal{O}\big(\neigh{S},k-|S|\big)\\ + &\text{s.t. }|S|\leq k + \end{split} +\end{equation} + +In this section, we will show how \eqref{eq:sub} can be reduced to a submodular +maximization problem, leading to a fast combinatorial algorithm for the +adaptive seeding model in the voter model. + +\begin{lemma}\label{lemma:nd} + Let $A\subseteq\mathcal{U}$ and $x=(v,c)\in\mathcal{U}\setminus A$, then + the function $b\mapsto \mathcal{O}(A\cup\{x\},b)-\mathcal{O}(A,b)$ is + non-decreasing over $\reals^+$. +\end{lemma} + +\begin{proof} +\emph{W.l.o.g} we can rename and order the pairs in $A$ so that: +\begin{displaymath} +\frac{v_1}{c_1}\geq \frac{v_2}{c_2}\geq\ldots\geq\frac{v_m}{c_m}. +\end{displaymath} +Then, $\mathcal{O}(A,b)$ has the following simple piecewise linear expression: +\begin{equation}\label{eq:pw} + \mathcal{O}(A,b) = + \begin{cases} + b\frac{v_1}{c_1}&\text{if }0\leq b<c_1\\ + \sum_{k=1}^{i-1}v_k + \left(b-\sum_{k=1}^{i-1}c_k\right)\frac{v_i}{c_i} + &\text{if } \sum_{k=1}^{i-1}c_k\leq b< \sum_{k=1}^ic_k\\ + \sum_{k=1}^m v_k&\text{if } b\geq\sum_{i=1}^m c_k + + \end{cases} +\end{equation} + +Let us define for $t\in\reals^+$, $n(t)\defeq \inf\Big\{i\text{ s.t. +} \sum_{k=1}^i c_k > t\Big \}$ with $n(t)=+\infty$ when the set is empty. In +particular, note that $x\mapsto n(t)$ is non-decreasing. Denoting +$\partial_+\mathcal{O}_A$ the right derivative of $\mathcal{O}(A,\cdot)$, one +can write $\partial_+\mathcal{O}_A(t) +=\frac{v_{n(t)}}{c_{n(t)}}$, with the convention that +$\frac{v_\infty}{c_\infty} = 0$. + +Writing $i \defeq \sup\Big\{j\text{ s.t. +} \frac{v_j}{c_j}\geq\frac{v}{c}\Big\}$, it is easy to see that +$\partial_+\mathcal{O}_{A\cup\{x\}}\geq\partial_+\mathcal{O}_A$. Indeed: +\begin{enumerate} + \item if $n(t)\leq i$ then $\partial_+\mathcal{O}_{A\cup\{x\}}(t) + = \partial_+\mathcal{O}_A(t)= \frac{v_{n(t)}}{c_{n(t)}}$. + \item if $n(t)\geq i+1$ and $n(t-c)\leq i$ then $\partial_+\mathcal{O}_{A\cup\{x\}}(t) + = \frac{v}{c}\geq\frac{v_{n(t)}}{c_{n(t)}}= \partial_+\mathcal{O}_A(t)$. + \item if $n(t-c)\geq i+1$, then $\partial_+\mathcal{O}_{A\cup\{x\}} + = \frac{v_{n(t-c)}}{c_{n(t-c)}}\geq + \frac{v_{n(t)}}{c_{n(t)}}=\partial_+\mathcal{O}_A(t)$. +\end{enumerate} + +Let us now consider $b$ and $c$ such that $b\leq c$. Then, using the integral +representation of $\mathcal{O}(A\cup\{x\},\cdot)$ and $\mathcal{O}(A,\cdot)$, we get: +\begin{multline*} + \mathcal{O}(A\cup\{x\},c)-\mathcal{O}(A\cup\{x\},b)=\int_b^c\partial_+\mathcal{O}_{A\cup\{x\}}(t)dt\\ + \geq\int_b^c\partial_+\mathcal{O}_A(t)dt=\mathcal{O}(A,c)-\mathcal{O}(A,b) +\end{multline*} +Re-ordering the terms, $\mathcal{O}(A\cup\{x\},c)-\mathcal{O}(A,c)\geq +\mathcal{O}(A\cup\{x\},b)-\mathcal{O}(A,b)$ +which concludes the proof of the lemma. +\end{proof} + +\begin{lemma}\label{lemma:sub} + Let $b\in\reals^+$, then the function $A\mapsto \mathcal{O}(A,b)$ is submodular. +\end{lemma} + +\begin{proof} + Let $A\subseteq\mathcal{U}$ and $x, y\in\mathcal{U}\setminus A$. Using the + second-order characterization of submodular functions, it suffices to show + that: + \begin{equation}\label{eq:so} + \mathcal{O}(A\cup\{x\},b)-\mathcal{O}(A,b)\geq + \mathcal{O}(A\cup\{y\}\cup\{x\},b)-\mathcal{O}(A\cup\{y\},b) + \end{equation} + + Let us write $x=(v_x, c_x)$ and $y=(v_y,c_y)$. We distinguish two cases + based on the relative position of $\frac{v_x}{c_x}$ and $\frac{v_y}{c_y}$. + The following notations will be useful: $S_A^x \defeq \big\{(v,c)\in + A\text{ s.t. }\frac{v_x}{c_x}\leq\frac{v}{c}\big\}$ and $P_A^x\defeq + A\setminus S_A^x$. + + \textbf{Case 1:} If $\frac{v_y}{c_y}\geq \frac{v_x}{c_x}$, then one can + write: + \begin{gather*} + \mathcal{O}(A\cup\{y\}\cup\{x\},b) = \mathcal{O}(P_A^y\cup\{y\},b_1)+ + \mathcal{O}(S_A^y\cup\{x\},b_2)\\ + \mathcal{O}(A\cup\{y\},b) = \mathcal{O}(P_A^y\cup\{y\},b_1) + + \mathcal{O}(S_A^y,b_2) + \end{gather*} + where $b_1$ is the fraction of the budget $b$ spent on $P_A^y\cup\{y\}$ and + $b_2=b-b_1$. + + Similarly: + \begin{gather*} + \mathcal{O}(A\cup\{x\},b) = \mathcal{O}(P_A^y, c_1) + \mathcal{O}(S_A^y\cup\{x\},c_2)\\ + \mathcal{O}(A, b) = \mathcal{O}(P_A^y, c_1) + \mathcal{O}(S_A^y,c_2) + \end{gather*} + where $c_1$ is the fraction of the budget $b$ spent on $P_A^y$ and $c_2 + = b - c_1$. + + Note that $b_1\geq c_1$: an optimal solution will first spent as much + budget as possible on $P_A^y\cup\{y\}$ before adding elements in + $S_A^y\cup\{x\}$. We can now rewrite \eqref{eq:so}: + \begin{displaymath} + \mathcal{O}(S_A^y\cup\{x\},c_2)+\mathcal{O}(S_A^y,c_2)\geq + \mathcal{O}(S_A^y\cup\{x\},b_2)+\mathcal{O}(S_A^y,b_2) + \end{displaymath} + with $c_2\geq b_2$. This inequality is true by Lemma~\ref{lemma:nd}. + + \textbf{Case 2:} If $\frac{v_x}{c_x}\geq \frac{v_y}{c_y}$, we now decompose + the solution on $P_A^x$ and $S_A^x$: + \begin{gather*} + \mathcal{O}(A\cup\{x\},b) = \mathcal{O}(P_A^x\cup\{x\},b_1) + + \mathcal{O}(S_A^x,b_2)\\ + \mathcal{O}(A,b) = \mathcal{O}(P_A^x,c_1)+\mathcal{O}(S_A^x,c_2) + \intertext{and} + \mathcal{O}(A\cup\{y\}\cup\{x\},b) = \mathcal{O}(P_A^x\cup\{x\},b_1) + + \mathcal{O}(S_A^x\cup\{y\},b_2)\\ + \mathcal{O}(A\cup\{y\},b) = \mathcal{O}(P_A^x,c_1)+\mathcal{O}(S_A^x\cup\{y\},c_2) + \end{gather*} + with $b_1+b_2=b$, $c_1+c_2=b$ and $b_2\leq c_2$. The equation \eqref{eq:so} + can be rewritten: + \begin{displaymath} + \mathcal{O}(S_A^x,b_2)-\mathcal{O}(S_A^x,c_2)\geq + \mathcal{O}(S_A^x\cup\{u\},b_2)-\mathcal{O}(S_A^x\cup\{y\},c_2) + \end{displaymath} + Reordering the terms, we get: + \begin{displaymath} + \mathcal{O}(S_A^x\cup\{y\},c_2) -\mathcal{O}(S_A^x,c_2)\geq + \mathcal{O}(S_A^x\cup\{u\},b_2)-\mathcal{O}(S_A^x,b_2) + \end{displaymath} + with $c_2\geq b_2$. This is again true by Lemma~\ref{lemma:nd}. +\end{proof} + +\begin{proposition}\label{prop:sub} + Let $b\in\mathbf{R}^+$, then the function + $S\mapsto\mathcal{O}(\neigh{S},b)$ is submodular over $2^X$. +\end{proposition} + +\begin{proof} + Let us consider $S$ and $T$ such that $S\subseteq T\subseteq X$ and $x\in + X\setminus T$. In particular, note that $\neigh{S}\subseteq\neigh{T}$. + + Let us write $\neigh{S\cup\{x\}}=\neigh{S}\cup R$ with $\neigh{S}\cap + R=\emptyset$ and similarly, $\neigh{T\cup\{x\}}=\neigh{T}\cup R'$ with + $\neigh{T}\cap R'=\emptyset$. Using these notations, it is clear that + $R'\subseteq R$. Let us enumerate the elements in $R'$ using an arbitrary + order: $R'=\{u_1,\ldots,u_k\}$. Then one can write: + \begin{displaymath} + \begin{split} + \mathcal{O}(\neigh{T\cup\{x\}},b)&=\mathcal{O}(\neigh{T}\cup R',b)\\ + &=\sum_{i=1}^k\mathcal{O}(\neigh{T}\cup\{u_1,\ldots u_i\},b) + -\mathcal{O}(\neigh{T}\cup\{u_1,\ldots u_{i-1}\},b)\\ + &\leq \sum_{i=1}^k\mathcal{O}(\neigh{S}\cup\{u_1,\ldots u_i\},b) + -\mathcal{O}(\neigh{S}\cup\{u_1,\ldots u_{i-1}\},b)\\ + &=\mathcal{O}(\neigh{S}\cup R',b)-\mathcal{O}(\neigh{S},b) + \end{split} + \end{displaymath} + where the inequality comes from the submodularity of + $A\mapsto\mathcal{O}(A,b)$ proved in Lemma~\ref{lemma:sub}. This same + function is also obviously set-increasing, hence: + \begin{displaymath} + \begin{split} + \mathcal{O}(\neigh{S}\cup R',b)-\mathcal{O}(\neigh{S},b) + &\leq \mathcal{O}(\neigh{S}\cup R,b)-\mathcal{O}(\neigh{S},b)\\ + &=\mathcal{O}(\neigh{S\cup\{x\}},b)-\mathcal{O}(\neigh{S},b) + \end{split} + \end{displaymath} + This concludes the proof of the proposition. +\end{proof} + +Using Proposition~\ref{prop:sub}, we can finally reduce \eqref{eq:sub} to +a submodular optimization problem by treating $|S|$ as a variable to optimize. +Specifically, \eqref{eq:sub} is equivalent to the following problem: +\begin{equation}\label{eq:sub2} +\begin{split} + \max_{1\leq t\leq k}\max_{|S|\leq k-t}\mathcal{O}(\neigh{S},t) +\end{split} +\end{equation} + +\begin{algorithm} + \caption{Combinatorial algorithm} + \label{alg:comb} + \algsetup{indent=2em} + \begin{algorithmic}[1] + \STATE $S\leftarrow \emptyset$ + \FOR{$t=1$ \TO $k-1$} + \STATE $S_t\leftarrow \emptyset$ + \FOR{$i=1$ \TO $k-t$} + \STATE $x^*\leftarrow\argmax_{x\in + X\setminus S_t}\mathcal{O}(\neigh{S_t\cup\{x\}},t) + -\mathcal{O}(\neigh{S_t},t)$\label{line:argmax} + \STATE $S_t\leftarrow S_t\cup\{x^*\}$ + \ENDFOR + \IF{$\mathcal{O}(\neigh{S_t},t)>\mathcal{O}(\neigh{S},k-|S|)$} + \STATE $S\leftarrow S_t$ + \ENDIF + \ENDFOR + \RETURN $S$ + \end{algorithmic} +\end{algorithm} + +\begin{proposition} + Let $S$ be the set computed by Algorithm~\ref{alg:comb} and let us denote + by $A(S)$ the value of the adaptive policy which selects $S$ on the first + day. Then: + \begin{displaymath} + A(S) \geq \frac{1}{2}\left(1-\frac{1}{e}\right)OPT. + \end{displaymath} + Furthermore, Algorithm~\ref{alg:comb} runs in time $O\left(n\log + n+k^2m\min(\frac{k}{p_\text{min}},n)\right)$, where $m=|X|$, $n=|\neigh{X}|$ + and $p_\text{min} =\min\{p_u,u\in\neigh{X}\}$. +\end{proposition} + +\begin{proof} + For each realization of the neighbors $R$, let us define by $X_R$ the + random set which includes each $u\in R$ with probability $q_u$ on the + second day and: + \begin{displaymath} + \tilde{X}_R= + \begin{cases} + X_R&\text{if } |X_R|\leq t\\ + \emptyset&\text{otherwise} + \end{cases} + \end{displaymath} + where $t = k-|S|$. $\tilde{X}_R$ is a random variable over the feasible + solutions on the second day. As a consequence: + \begin{displaymath} + A(S) \geq \sum_{R\subseteq\neigh{S}} p_R\mathbb{E}\big[f(\tilde{X}_R)\big] + \end{displaymath} + Let us define by $Y$ the random set which includes each $u\in\neigh{X}$ + with probability $p_uq_u$ and: + \begin{displaymath} + \tilde{Y}= + \begin{cases} + Y&\text{if } |Y|\leq t\\ + \emptyset&\text{otherwise} + \end{cases}. + \end{displaymath} + It is easy to see that $\tilde{X}_R$ is the conditional expectation of + $\tilde{Y}$ given + $R$. Hence: + \begin{displaymath} + \sum_{R\subseteq\neigh{S}} p_R\mathbb{E}\big[f(\tilde{X}_R)\big] + = \mathbb{E}\big[f(\tilde{Y})\big] + \end{displaymath} + But: + \begin{align*} + \mathbb{E}\big[f(\tilde{Y})\big] + &=\sum_{T\subseteq\neigh{X}}\mathbb{P}\big[\tilde{Y}=T\big]f(T) + = \sum_{\substack{T\subseteq\neigh{X}\\|T|\leq + t}}\mathbb{P}\big[Y=T\big]f(T)\\ + &= \mathbb{E}\big[f(Y)\big]-\sum_{\substack{T\subseteq\neigh{X}\\|T|> + t}}\mathbb{P}\big[Y=T\big]f(T) + \end{align*} + Roughly: + \begin{displaymath} + \sum_{\substack{T\subseteq\neigh{X}\\|T|> + t}}\mathbb{P}\big[Y=T\big]f(T)\leq + \frac{1}{2}\mathbb{E}\big[f(Y)\big] + \end{displaymath} + Combining the above inequalities we get: + \begin{displaymath} + A(S)\geq \frac{1}{2} \mathbb{E}\big[f(Y)\big] + \end{displaymath} + But $\mathbb{E}\big[f(Y)\big]$ is precisely the value of the non-adaptive + solution computed by Algorithm~\ref{alg:comb} which is + a $\left(1-\frac{1}{e}\right)$ approximation of the + optimal non adaptive solution. Hence: + \begin{displaymath} + A(S) \geq \frac{1}{2}\left(1-\frac{1}{e}\right) OPT_{NA} + \end{displaymath} + Finally, we conclude with Proposition~\ref{prop:gap} +\end{proof} + +\subsection{From expectation to high probability} + +\subsection{Questions} + +\begin{itemize} + \item Can it be parallelized (map-reduce)? +\end{itemize} diff --git a/paper/sections/experiments.log b/paper/sections/experiments.log new file mode 100644 index 0000000..e69de29 --- /dev/null +++ b/paper/sections/experiments.log diff --git a/paper/sections/experiments.tex b/paper/sections/experiments.tex new file mode 100644 index 0000000..1a085d1 --- /dev/null +++ b/paper/sections/experiments.tex @@ -0,0 +1,128 @@ +In this section, we give experimental evidence of the validity of our approach. Specifically, we show that our algorithms obtain significant improvement over standard influence maximization, that these improvements are observed in various scenarios (different verticals, different models of influence propagation), and that our approach is efficient in terms of running-time and scalable to large social networks. + +\subsection{Data description} + +Our main testbed is the friendship graph of the social network service Facebook~\cite{facebook}. We start by observing that an efficient campaign run on a social network will primarily target users who have already expressed interests in the topic being promoted. In the adaptive seeding terminology, these users constitute the set of initial nodes that can be targeted during the seeding phase. + +In order to reproduce this process, we selected ten different verticals (topics) and for each of these verticals, a person, an institution or an entity whose associated Facebook page is regularly used for promotional posts related to this topic. On each of these pages, we selected a recent post (posted no later than January 2014) with approximately 1,000 \emph{likes}. The set of users who liked those posts constitute our initial sets of nodes. + +We then crawled the social network of these sets: for each user, we collected her list of friends, and the degrees (number of friends) of these friends. Table~\ref{tab:data} summarizes statistics about the collected data. + +\begin{table}[h!] + \small + \centering + \setlength{\tabcolsep}{3pt} + \begin{tabular}{llrr} + \toprule + Vertical & Page & $m$ & $n$ \\%& $S$ & $F$\\ + \midrule + Charity & Kiva & 978 & 131334 \\%& 134.29 & 1036.26\\ + Travel & Lonely Planet & 753 & 113250 \\%& 150.40 & 898.50\\ + Public Action & LaManifPourTous & 1041 & 97959 \\%& 94.10 & 722.02\\ + Fashion & GAP & 996 & 115524 \\%& 115.99 & 681.98\\ + Events & Coachella & 826 & 102291 \\%& 123.84 & 870.16\\ + Politics & Green Party & 1044 & 83490 \\%& 79.97 & 1053.25\\ + Technology & Google Nexus & 895 & 137995 \\%& 154.19 & 827.84\\ + News & The New York Times & 894 & 156222 \\%& 174.74 & 1033.94 \\ + Consumption & Peet's & 776 & 56268 \\%& 72.51 & 520.47\\ + Entertainment & HBO & 828 & 108699 \\%& 131.28 & 924.09\\ + \bottomrule +\end{tabular} +\caption{Dataset statistics. $m$: number of initial users, $n$: number of friends of the initial users.} +%$S$: avg. degree of an initial user, $F$: avg. degree of a friend of an initial user.} +\label{tab:data} +\end{table} + +We note that depending on the privacy settings of the initial users, it was not always possible to access their list of friends. We decided to remove these users since their ability to spread information could not be readily determined. This effect, combined with various errors encountered during the data collection, accounts for an approximate 15\% reduction between the users who liked a post and the number of users in the datasets we used. + +\begin{figure}[t!] + \centering + \includegraphics[scale=0.7]{images/para.pdf} + \caption{Comparison of the average degree of the initial users and the average degree of their friends.} + \label{fig:para} +\end{figure} + +Following our discussion in the introduction, we observe that on average, the degrees of initial users is much lower than the degrees of their friends. This is highlighted on Figure~\ref{fig:para} and justifies our approach. + +\subsection{Performance of Adaptive Seeding} +\label{sec:performance} + +We start by comparing the performance of adaptive seeding to standard influence maximization approaches. The following heuristics were considered: +\begin{itemize} + \item \emph{Max degree:} selecting as many initial users as the budget permits, in decreasing order of degrees. + \item \emph{Random:} selecting a random sample of initial users of the size permitted by the budget. + \item \emph{Random friend:} spending half of the budget to select a random sample of initial users. For each of the selected random users, we then select randomly one of her friend (hence spending the total budget overall). +\end{itemize} + +\begin{figure*}[p] + \centerline{\includegraphics{images/perf.pdf}} + \caption{Performance of adaptive seeding compared to other influence maximization approaches. The influence, on the $y$-axis is displayed in logarithmic scale and is measured by the sum of the degrees of the selected users~\eqref{eq:voter}. The budget is represented on the $x$-axis as a fraction of the seed size.} + \label{fig:performance} +\end{figure*} + +Figure~\ref{fig:performance} compares the performance of \emph{Adaptive seeding}, our own approach, to the afore-mentioned approaches for all the verticals we collected. For this figure, the probability of initial users' friends joining on the second day was set to one. Section~\ref{sec:robustness} explores other influence propagation scenarios. + +We note that the \emph{Random friend} heuristic significantly outperforms \emph{Max degree}. Using the same budget, the degree gain induced by moving from initial users to their friends is such that selecting at random among the initial users' friends already does better than the best heuristic restricted only on initial users. Using \emph{Adaptive seeding} to optimize the choice of initial users based on their friends' degrees then results in an order of magnitude increase over \emph{Random friend}, consistently for all the verticals. + +We also compare the relative improvements of \emph{Adaptive seeding} over \emph{Max degree} across the different verticals. The results are shown in Figure~\ref{fig:compare}. +\begin{figure}[ht!] + \centerline{ \includegraphics[scale=0.7]{images/comp.pdf} } + \vspace{-10pt} + \caption{Ratio of the performance of adaptive seeding to max. degree for several verticals.} + \label{fig:compare} +\end{figure} + +\subsection{Robustness to spread of influence frictions} +\label{sec:robustness} + +The results presented in Section~\ref{sec:performance} were computed assuming a probability of propagation between the two stages of adaptive seeding equal to one. Estimating this probability is a research problem on its own; however, we note that it can be controlled to some extent by the social networking service on which the campaign is being run. By showing prominently the campaign material (sponsored links, fund-raising banners, etc.), the conversion rate can be increased beyond what would happen via regular word-of-mouth propagation. + +Figure~\ref{fig:prob} shows the impact of the probability of propagation between the two stages. For several values of $p$, we computed the performance of \emph{Adaptive seeding} when each friend of a seeded initial user joins during the second stage independently with probability $p$. We see that even with $p=0.01$, \emph{Adaptive seeding} still outperforms \emph{Max degree}. As $p$ increases, the performance of \emph{Adaptive seeding} quickly increases and reaches $80\%$ of the values of Figure~\ref{fig:performance} at $p=0.5$. + +\begin{figure}[ht!] + \begin{subfigure}[t]{0.23\textwidth} + \includegraphics[scale=0.45]{images/prob.pdf} + \vspace{-10pt} + \caption{} + \label{fig:prob} +\end{subfigure} +\begin{subfigure}[t]{0.23\textwidth} + \includegraphics[scale=0.45]{images/hbo_likes.pdf} + \vspace{-10pt} + \caption{} + \label{fig:killer} + \end{subfigure} + \caption{(a) Performance of Adaptive seeding in logarithmic scale for various propagation probabilities. (b) In logarithmic scale, performance of \emph{Adaptive seeding} when restricted to users who \emph{liked} HBO (\textsf{Adapt. seed. (rest.)}), compared to \emph{Max degree} and the unrestricted \emph{Adaptive seeding}.} +\end{figure} + +In practice, the propagation probability will vary among individuals. However, for those who have already expressed interest in the promoted content, we can expect this probability to be close to one. For our next experiment, we chose a vertical (HBO) and trimmed the social graph we collected by only keeping on the second stage users who indicated this vertical (HBO) in their list of interests. Figure~\ref{fig:killer} shows that even on this very restricted set of users, \emph{Adaptive seeding} still outperforms \emph{Max degree} and reaches approximately $50\%$ of the unrestricted adaptive seeding. + +%\item Fix budget; plot the number of people that tweeted coffee between 9am to 10am, between 10am to 11am, between 11am to noon,..., +%\item Argue: if the probability for a friend joining is small, then as long as each person has a few high degree friends, we will get a constant fraction of high degree friends joining, in expectation. +%\item Experiment only on friends who also followed the topic: go to a vertical with a lot of followers (but hopefully number of ``likes'' are under 1000) and perform the adaptive seeding experiment only on people who also follow that vertical. Should roughly be 3x requests as other experiments. +%\end{itemize} + +\subsection{Scalability}\label{sec:scalability} + +Finally, we look at the scalability of our approaches. More specifically, we compare the running time of the LP-based approach and the combinatorial approach for different instance sizes. + +Figure~\ref{fig:time} shows the running time and number of CPU cycles used by the LP algorithm and the combinatorial algorithm as a function of the network size $n$. The varying size of the network was obtained by randomly sampling a varying fraction of initial users and then trimming the social graph by only keeping friends of this random sample on the second stage. The computations were run on Intel Core i5 CPU 4x2.40Ghz. The LP solver used was CLP~\cite{clp}. + +\begin{figure}[h!] + \centerline{ \includegraphics[scale=0.9]{images/time.pdf} } + \vspace{-10pt} + \caption{Running time and number of CPU cycles of the combinatorial algorithm and the LP algorithm as a function of the number of nodes $n$. First row with budget $k=100$, second row with budget $k=500$.} + \label{fig:time} +\end{figure} + +We observe that for a \emph{small} value of the budget $k$ ($k=100$, first row of Figure~\ref{fig:time}), the combinatorial algorithm outperforms the LP algorithm. When $k$ becomes \emph{large} ($k=500$, second row of Figure~\ref{fig:time}), the LP algorithm becomes faster. This can be explained by the $k^2$ factor in the running time guarantee of the combinatorial algorithm (see Proposition~\ref{prop:running_time}). Even though the asymptotic $n\log n$ guarantee of the combinatorial algorithm should theoretically outperform the LP-based approach for large $n$, we were not able to observe it for our instance sizes. In practice, one can choose which of the two algorithms to apply depending on the relative sizes of $k$ and $n$. + +%\noindent \textbf{Others} +%\begin{itemize} +%\item One plot with Twitter data on the same verticals/ same posts. +%\item Run pipeline on available data sets, with random samples; +%\item It's true that adaptive seeding is looking at more people, but so what? If you waited a day, it would still be better: take a vertical, split it at random to two days. Perform adaptive seeding on one day, and compare to influence max. on two days. +%\item compare to other influence maximization algorithms? +%\item test on several public datasets +%\item LP vs combinatorial algorithm vs sampling running time +%\end{itemize} diff --git a/paper/sections/introduction.log b/paper/sections/introduction.log new file mode 100644 index 0000000..e69de29 --- /dev/null +++ b/paper/sections/introduction.log diff --git a/paper/sections/introduction.tex b/paper/sections/introduction.tex new file mode 100644 index 0000000..6c2e345 --- /dev/null +++ b/paper/sections/introduction.tex @@ -0,0 +1,92 @@ + + + +%The massive adoption of social networking services in recent years creates a unique platform for disseminating information and promoting ideas. Effective means to spread information through this platform are continuously being developed, and in particular methods for selecting influential users who can trigger large word-of-mouth cascade have been heavily studied throughout the past decade. Initially studied by Domingos and Richarson~\cite{} and formalized by Kempe +% +% +%Effective means to spread information through this platform are continuously being developed, and in particular methods for s +The massive adoption of social networking services in recent years creates a unique platform for promoting ideas and spreading information. The joy and ease of communicating through online social networks leaves traces of behavioral data which allow observing, predicting and even engineering processes of information diffusion. First posed by Domingos and Richardson~\cite{DR01,RD02} and elegantly formulated and further developed by Kempe, Kleinberg, and Tardos~\cite{KKT03}, \emph{influence maximization} is the algorithmic challenge of selecting individuals who can serve as early adopters of a new idea, product, or technology in a manner that will trigger a large cascade in the social network. Since its inception, numerous techniques and improvements have been developed ranging from sophisticated predictive models of influence ~\cite{LAH06,RLK10,BHMW11,ACKS13,manuel2013icml,du13nips} to fast approximation methods~\cite{LKGFVG07,MR07,C08,KDD11,borgs2012influence}. + +While there has been a great deal of progress on efficient algorithmic methods for this problem and impressive methods for learning models of influence from data, a fundamental problem has been largely overlooked. Due to the heavy-tailed degree distribution of social networks, influential users are rare, and thus the application of influence maximization techniques can often become ineffective. + +For a concrete example, consider a scenario where the goal is to select influential users who visit an online store and reward them for promoting a product through their social network. In such a case, if the users who visit the online store are not influential, even the best techniques for identifying influential users would have poor performance. \newline + +\begin{figure} + \centering + \includegraphics[scale=0.55]{images/dist.pdf} + \caption{CDF of the degree distribution of users who liked a post by Kiva on Facebook and that of their friends.} + \label{fig:para} +\end{figure} + + +\noindent \textbf{The power of random neighbors.} Remarkably, while a random individual in a social networks is not likely to be influential, it turns out that she is likely to know someone who is. Recent work shows that for any network with a power law degree distribution with a small fraction of random edges, with constant probability there is an asymptotic gap between influence (either the total number of neighbors or sum of degrees) of small samples of the network and that of their neighbors~\cite{LS13}. %Intuitively, as influential nodes are well connected, one can hope that many users know an influential user who can serve as an early adopter. +The implication is that when considering the accessible users (e.g. those who visit the online store) as random samples from a social network, any algorithm which can use their neighbors as influencers will have dramatic improvement over the direct application of influence maximization over the accessible users.\newline + +%\begin{figure*}[t!] +% \centering +% \includegraphics[scale=0.60]{images/dist.pdf} +% \caption{CDF of the degree distribution of seed users and their friends.} +% \label{fig:para} +%\end{figure*} + + + +\noindent \textbf{Adaptive Seeding.} +An alternative approach to spending the entire budget on the users who are accessible is to follow a two-stage approach. In the first stage, one can spend a fraction of the budget on the accessible users to invite their friends to participate in the campaign, hope their friends arrive, and in the second stage spend the rest of the budget on the friends who arrived. This approach, called \emph{adaptive seeding} has been recently formalized in~\cite{singer}. As in the standard formulation of influence maximization, the setup in adaptive seeding includes a network, a budget, and an influence function. %which encodes the expected number of nodes influenced as a result of selecting a subset in the network. +In addition, there is a subset of nodes $X$, the set of accessible users, and their neighbors $\mathcal{N}(X)$, where each neighbor has some probability indicating their likelihood to arrive if invited. The framework is a two-stage stochastic optimization problem. In the first stage any fraction of the budget can be used to select a subset of nodes in $X$, and as a result each neighbor of this set is then realized independently. In the second stage the remaining budget can be used to select from the set of neighbors that arrived. The goal is to select a subset of nodes in $X$, s.t. the influence function is maximized in expectation over all possible arrivals of the neighbors. The main result in~\cite{singer} is a constant factor approximation algorithm for well-studied influence models such as independent cascade and linear threshold. +%More formally, adaptive seeding is phrased as a two-stage stochastic optimization problem. + +\subsection{A scalable approach to adaptive seeding} +The constant-factor approximation guarantees for adaptive seeding are, at large, a theoretical triumph. +Although the algorithms for adaptive seeding have desirable approximation guarantees~\cite{singer}, they rely on various forms of sampling, which creates significant blowup in the input size. While such techniques provide strong theoretical guarantees, for social network data sets which are often either large or massive, such approaches are inapplicable. The natural question is therefore: + +\begin{center} +\textit{Is adaptive seeding scalable?} +\end{center} + +In this paper our main goal is to develop scalable approaches to adaptive seeding and to provide compelling experimental evidence of the dramatic impact such approaches can have in various applications of influence maximization. +\newline + +\noindent \textbf{Challenges.} +The challenges in designing adaptive seeding algorithms are due to both the combinatorial and stochastic nature of the problem. The combinatorial aspect involves the selection of the nodes in the first stage which affects which nodes will realize in the second stage. As we will later show, this aspect makes the problem $\textsc{NP}$-Hard even for the simplest of objective functions. The stochastic aspect requires the optimization to be over potentially exponentially-many realizations. A common approach in stochastic optimization is Sample Average Approximation (SAA). The main idea behind SAA is to sample realizations of the second stage, solve the optimization problem by taking a solution which is optimal on average over the sampled instances. + For the instances we are interested in here that have size of over $N=10^5$ nodes, the required number of samples are on the order of $O(N^3)$, the algorithms can have $O(N^2)$ running time, and the total running time is then on the order of $10^{30}$ operations and SAA is simply infeasible.\footnote{In \cite{singer} SAA is used for linear models. For models such as independent cascade and linear threshold, a different sampling method is introduced which requires similar blowup in the input size to generate a concave relaxation of the optimization problem.}\newline + +%The first of these challenges can be addressed by sampling realizations of the +%neighbors $R$ and averaging over them to get an arbitrarly-accurate +%approximation of the objective function. This approach, which is widely used in +%classical influence maximization, has been succesfully applied in \cite{singer} +%to obtain general guarantees on the approximability of the adaptive seeding +%problem. +% +%The second challenge has been addressed in \cite{singer} by considering relaxed +%an non-adaptive policies which are discussed in Section~\ref{sec:relaxed}. + + + +\noindent \textbf{Stochastic optimization sans sampling.} +In this paper we develop a framework for adaptive seeding which circumvents the use of sampling, while maintaining desirable approximation guarantees. We say that a policy is \emph{adaptive} if it selects nodes in the first stage, and only after the realization of their neighbors, selects a subset of nodes with the remaining budget in the second stage. In contract, a \emph{non-adaptive} policy makes all its decisions before the realizations occur. +The framework we develop in this work involves designing non-adaptive policies which could then be turned into adaptive ones. At a high level, the main idea would be to use a particular version of non-adaptive policies whose optimal solution is an upper bound to the optimal adaptive policy. We will then argue that a solution to the non-adaptive problem can be turned into a solution to the adaptive policy, without losing almost any value. This will therefore reduce our problem to that of designing solutions to the non-adaptive problem we define, for which we then develop specialized algorithms. The main advantage in the non-adaptive framework is that unlike standard approaches in stochastic optimization, it avoids using sampling. As we will later discuss, this dramatically reduces the running time of the algorithms, both in theory and in practice.\newline + +%\noindent \textbf{Main results.} +\subsection{Main results} +Our results are for linear models of influence, i.e. models for which the influence of a set can be expressed as the sum of the influence of its members. While this class does not include models such as the independent cascade and the linear threshold model, it includes the well-studied \emph{voter model}~\cite{holley1975ergodic} and measures such as node degree and click-through-rate of users which serve as a natural proxies of influence in many settings. In comparison to submodular influence functions, the relative simplicity of linear models allows making substantial progress on this challenging problem. +Using this framework, we develop two algorithms, both achieving an approximation ratio of $(1-1/e)$ for the adaptive problem. The first algorithm is implemented through a linear program, which proves to be extremely efficient over instances where there is a large budget. The second approach is a combinatorial algorithm with the same approximation guarantee which has good theoretical guarantees on its running time and does well on instances with smaller budgets. + +To show the applicability of these approaches, and the potential of adaptive seeding at large, we performed several experiments on real social network data sets. We collected publicly available data from Facebook on users who expressed interest (``liked'') a certain post from a topic they follow and data on their friends. The premise here is that such users mimic potential participants in a viral marketing campaign. The performance of our algorithms on these data sets shows adaptive seeding can have dramatic improvements over standard approaches for influence maximization. + + + + +%\subsection{Stochastic optimization sans sampling} +%A common approach in stochastic optimization is Sample Average Approximation (SAA). +%The main idea behind SAA is to sample realizations of the second stage, solve the optimization problem on the sampled instances, and average the solution. Often, when the number of samples is polynomial in the input size of the problem. In our case the problem is too large. +% +%In this paper we show a new technique for solving stochastic optimization problems which does not use sampling. +% +% +%\subsection{Roadmap} +%The main framework we apply in this paper is to develop non-adaptive algorithms which we will then use to create adaptive solutions. At a high level, the main idea would be to use a particular version of non-adaptive algorithms whose optimal solution is an upper bound to the optimal adaptive policy. We will then argue that a solution to the non-adaptive problem can be turned into a solution to the adaptive policy, without losing almost any value. This will therefore reduce our problem to that of designing solutions to the non-adaptive problem we define, for which we develop specialized algorithms. +% +%Beyond the approximation guarantees, the main advantage in the non-adaptive framework is that unlike standard approaches in stochastic optimization, it avoids using sampling. As we will later discuss, this dramatically reduces the running time the algorithms, both in theory and practice. +% +% diff --git a/paper/sections/lp.log b/paper/sections/lp.log new file mode 100644 index 0000000..e69de29 --- /dev/null +++ b/paper/sections/lp.log diff --git a/paper/sections/model.tex b/paper/sections/model.tex new file mode 100644 index 0000000..10c34d0 --- /dev/null +++ b/paper/sections/model.tex @@ -0,0 +1,67 @@ +%\subsection{Problem and notations} +Let us begin by introducing the following notation. +%We will use the following notation to formally discuss the model. +Given a graph $G=(V,E)$, for a node $u\in V$ we denote by $\neigh{u}$ +the neighborhood of $u$. By extension, for any subset of nodes $S\subseteq V$, +$\neigh{S}\defeq \bigcup_{u\in S}\neigh{u}$ will denote the neighborhood of +$S$. The notion of influence in the graph is captured by a function +$f:2^{|V|}\rightarrow \reals_+$ mapping a subset of nodes to a non-negative +influence value.\newline + +\noindent \textbf{The adaptive seeding model.} +The input of the \emph{adaptive seeding} problem is a set of initial nodes +$X\subseteq V$ and for any node $u\in\neigh{X}$ a probability $p_u$ that $u$ +realizes if one of its neighbor in $X$ is seeded. We will write $m=|X|$ and $n=|\neigh{X}|$ the parameters controlling the input size. The seeding process +is the following: +\begin{enumerate} + \item \emph{Seeding:} the seeder selects a subset of nodes $S\subseteq + X$ among the initial nodes. + \item \emph{Realization of the neighbors:} every node $u\in\neigh{S}$ + realizes independently with probability $p_u$. We denote by + $R\subseteq\neigh{S}$ the subset of nodes that is realized during this + stage. + \item \emph{Influence maximization:} the seeder selects the set of nodes + $T\subseteq R$ that maximizes the influence function $f$. +\end{enumerate} + +There is a budget constraint $k$ on the total number of nodes that can be +selected: $S$ and $T$ must satisfy $|S|+|T|\leq k$. The seeder chooses the set +$S$ before observing the realization $R$ and thus wishes to select optimally in +expectation over all such possible realizations. Formally, the objective can be stated +as: +\begin{equation}\label{eq:problem} + \begin{split} + &\max_{S\subseteq X} \sum_{R\subseteq\neigh{S}} p_R + \max_{\substack{T\subseteq R\\|T|\leq k-|S|}}f(T)\\ + &\text{s.t. }|S|\leq k + \end{split} +\end{equation} +where $p_R$ is the probability that the set $R$ realizes under the +probabilities $p_u,\,u\in\neigh{S}$: +\begin{displaymath} + p_R \defeq \prod_{u\in R}p_u\prod_{u\in\neigh{S}\setminus R}(1-p_u) +\end{displaymath} + +It is important to note that the process through which nodes arrive in the second stage is \emph{not} an influence process. The nodes in the second stage arrive if they are willing to spread information in exchange for a unit of the budget. Only when they have arrived does the influence process occur. This process is encoded in the influence function and occurs during the influence maximization stage without incentivizing nodes along the propagation path.\newline + + +\noindent \textbf{Influence functions.} +In this paper we focus on \emph{linear} (or additive) influence models: influence models for which the value of a subset of nodes can be expressed as a weighted sum of their individual influence. +One important example of such models is the \emph{voter model} \cite{richardson} used to represent the spread of opinions in a social network: at each time step, a node +adopts an opinion with a probability equal to the fraction of its neighbors +sharing this opinion at the previous time step. Formally, this can be written +as a discrete-time Markov chain over opinion configurations of the network. +In this model influence maximization amounts to ``converting'' the +optimal subset of nodes to a given opinion at the initial time so as to +maximize the number of converts after a given period of time. +Remarkably, a simple analysis shows that under this model, the influence +function $f$ is additive: +\begin{equation}\label{eq:voter} + \forall S\subseteq V,\; f(S) = \sum_{u\in S} w_u +\end{equation} +where $w_u, u\in V$ are weights which can be easily computed from the powers of +the transition matrix of the Markov chain. This observation led to the +development of fast algorithms for influence maximization under the voter +model~\cite{even-dar}.\newline + +\noindent \textbf{\textsc{NP}-Hardness.} In contrast to standard influence maximization, adaptive seeding is already \textsc{NP}-Hard even for the simplest influence functions. In the case when $f(S)=|S|$ and all probabilities equal one, the decision problem is whether given a budget $k$ and target value $\ell$ there exists a subset of $X$ of size $k-t$ which yields a solution with expected value of $\ell$ using $t$ nodes in $\mathcal{N}(X)$. This is equivalent to deciding whether there are $k-t$ nodes in $X$ that have $t$ neighbors in $\mathcal{N}(X)$. To see this is \textsc{NP}-hard, consider reducing from \textsc{Set-Cover} where there is one node $i$ for each input set $T_i$, $1\leq i\leq n$, with $\neigh{i}= T_i$ and integers $k,\ell$, and the output is ``yes'' if there is a family of $k$ sets in the input which cover at least $\ell$ elements, and ``no'' otherwise. diff --git a/paper/sections/performance.tex b/paper/sections/performance.tex new file mode 100644 index 0000000..8b13789 --- /dev/null +++ b/paper/sections/performance.tex @@ -0,0 +1 @@ + diff --git a/paper/sections/related.tex b/paper/sections/related.tex new file mode 100644 index 0000000..b4200c1 --- /dev/null +++ b/paper/sections/related.tex @@ -0,0 +1,9 @@ +\subsection{Related work} +Influence maximization was introduced by Domingos and Richardson~\cite{DR01, RD02}, and later formulated by Kempe, Kleinberg and Tardos~\cite{KKT03, KKT05}, and has been extensively studied since. Kempe, Kleinberg and Tardos~\cite{KKT03, KKT05} were able to cast this problem as a submodular optimization problem for many classes of influence models, hence allowing for algorithms with good approximations guarantees. Further refinements of the influence models and associated approximation guarantees can be found in \cite{MR07, C08}. In~\cite{even-dar}, the authors look at the special case of the voter model and design efficient algorithms in this setting. + +Our two-stage model for influence maximization is related to the field of stochastic optimization where problems are commonly solved using the \emph{sample average approximation} method \cite{SampleAverage}. In \cite{dean2004approximating, gupta2012approximation}, the authors use a notion of non-adaptive solutions related though not equivalent to ours. + +%The problem we study is the same as in \cite{singer} but our goals are different. +%Our main goal here is to obtain scalable algorithms that can be applied on the datasets we collected. + +Other models of adaptive optimization have been previously studied in the context of influence maximization. In \cite{asadpour2008stochastic}, the authors study a stochastic sequential submodular maximization problem where at each step an element is chosen, its realization is revealed and the next decision is made. Golovin and Krause \cite{golovin2011adaptive} study a similar model and apply it to a multi-stage influence maximization problem. We note that contrary to our model, the decision made at a given stage does not affect the following stages as the entire set of nodes is available as potential seeds at every stage. diff --git a/paper/sig-alternate.cls b/paper/sig-alternate.cls new file mode 100644 index 0000000..694a897 --- /dev/null +++ b/paper/sig-alternate.cls @@ -0,0 +1,1649 @@ +% SIG-ALTERNATE.CLS - VERSION 2.5
+% "COMPATIBLE" WITH THE "ACM_PROC_ARTICLE-SP.CLS" V3.2SP
+% Gerald Murray - May 23rd 2012
+%
+% ---- Start of 'updates' ----
+% Changed $10 fee to $15 -- May 2012 -- Gerry
+% Changed $5 fee to $10 -- April 2009 -- Gerry
+% April 22nd. 2009 - Fixed 'Natbib' incompatibility problem - Gerry
+% April 22nd. 2009 - Fixed 'Babel' incompatibility problem - Gerry
+% April 22nd. 2009 - Inserted various bug-fixes and improvements - Gerry
+%
+% To produce Type 1 fonts in the document plus allow for 'normal LaTeX accenting' in the critical areas;
+% title, author block, section-heads, confname, etc. etc.
+% i.e. the whole purpose of this version update is to NOT resort to 'inelegant accent patches'.
+% After much research, three extra .sty packages were added to the the tail (ae, aecompl, aeguill) to solve,
+% in particular, the accenting problem(s). We _could_ ask authors (via instructions/sample file) to 'include' these in
+% the source .tex file - in the preamble - but if everything is already provided ('behind the scenes' - embedded IN the .cls)
+% then this is less work for authors and also makes everything appear 'vanilla'.
+% NOTE: all 'patchwork accenting" has been commented out (here) and is no longer 'used' in the sample .tex file (either).
+% Gerry June 2007
+%
+% Patch for accenting in conference name/location. Gerry May 3rd. 2007
+% Rule widths changed to .5, author count (>6) fixed, roll-back for Type 3 problem. Gerry March 20th. 2007
+% Changes made to 'modernize' the fontnames but esp. for MikTeX users V2.4/2.5 - Nov. 30th. 2006
+% Updated the \email definition to allow for its use inside of 'shared affiliations' - Nov. 30th. 2006
+% Fixed the 'section number depth value' - Nov. 30th. 2006
+%
+% Footnotes inside table cells using \minipage (Oct. 2002)
+% Georgia fixed bug in sub-sub-section numbering in paragraphs (July 29th. 2002)
+% JS/GM fix to vertical spacing before Proofs (July 30th. 2002)
+%
+% Made the Permission Statement / Conference Info / Copyright Info
+% 'user definable' in the source .tex file OR automatic if
+% not specified.
+%
+% Allowance made to switch default fonts between those systems using
+% normal/modern font names and those using 'Type 1' or 'Truetype' fonts.
+% See LINE NUMBER 255 for details.
+% Also provided for enumerated/annotated Corollaries 'surrounded' by
+% enumerated Theorems (line 848).
+% Gerry November 11th. 1999
+%
+% ---- End of 'updates' ----
+%
+\def\fileversion{v2.5} % for ACM's tracking purposes
+\def\filedate{May 23, 2012} % Gerry Murray's tracking data
+\def\docdate {Wednesday 23rd. May 2012} % Gerry Murray (with deltas to doc}
+\usepackage{epsfig}
+\usepackage{amssymb}
+\usepackage{amsmath}
+\usepackage{amsfonts}
+% Need this for accents in Arial/Helvetica
+%\usepackage[T1]{fontenc} % Gerry March 12, 2007 - causes Type 3 problems (body text)
+%\usepackage{textcomp}
+%
+% SIG-ALTERNATE DOCUMENT STYLE
+% G.K.M. Tobin August-October 1999
+% adapted from ARTICLE document style by Ken Traub, Olin Shivers
+% also using elements of esub2acm.cls
+% HEAVILY MODIFIED, SUBSEQUENTLY, BY GERRY MURRAY 2000
+% ARTICLE DOCUMENT STYLE -- Released 16 March 1988
+% for LaTeX version 2.09
+% Copyright (C) 1988 by Leslie Lamport
+%
+%
+%%% sig-alternate.cls is an 'ALTERNATE' document style for producing
+%%% two-column camera-ready pages for ACM conferences.
+%%% THIS FILE DOES NOT STRICTLY ADHERE TO THE SIGS (BOARD-ENDORSED)
+%%% PROCEEDINGS STYLE. It has been designed to produce a 'tighter'
+%%% paper in response to concerns over page budgets.
+%%% The main features of this style are:
+%%%
+%%% 1) Two columns.
+%%% 2) Side and top margins of 4.5pc, bottom margin of 6pc, column gutter of
+%%% 2pc, hence columns are 20pc wide and 55.5pc tall. (6pc =3D 1in, approx)
+%%% 3) First page has title information, and an extra 6pc of space at the
+%%% bottom of the first column for the ACM copyright notice.
+%%% 4) Text is 9pt on 10pt baselines; titles (except main) are 9pt bold.
+%%%
+%%%
+%%% There are a few restrictions you must observe:
+%%%
+%%% 1) You cannot change the font size; ACM wants you to use 9pt.
+%%% 3) You must start your paper with the \maketitle command. Prior to the
+%%% \maketitle you must have \title and \author commands. If you have a
+%%% \date command it will be ignored; no date appears on the paper, since
+%%% the proceedings will have a date on the front cover.
+%%% 4) Marginal paragraphs, tables of contents, lists of figures and tables,
+%%% and page headings are all forbidden.
+%%% 5) The `figure' environment will produce a figure one column wide; if you
+%%% want one that is two columns wide, use `figure*'.
+%%%
+%
+%%% Copyright Space:
+%%% This style automatically reserves 1" blank space at the bottom of page 1/
+%%% column 1. This space can optionally be filled with some text using the
+%%% \toappear{...} command. If used, this command must be BEFORE the \maketitle
+%%% command. If this command is defined AND [preprint] is on, then the
+%%% space is filled with the {...} text (at the bottom); otherwise, it is
+%%% blank. If you use \toappearbox{...} instead of \toappear{...} then a
+%%% box will be drawn around the text (if [preprint] is on).
+%%%
+%%% A typical usage looks like this:
+%%% \toappear{To appear in the Ninth AES Conference on Medievil Lithuanian
+%%% Embalming Technique, June 1991, Alfaretta, Georgia.}
+%%% This will be included in the preprint, and left out of the conference
+%%% version.
+%%%
+%%% WARNING:
+%%% Some dvi-ps converters heuristically allow chars to drift from their
+%%% true positions a few pixels. This may be noticeable with the 9pt sans-serif
+%%% bold font used for section headers.
+%%% You may turn this hackery off via the -e option:
+%%% dvips -e 0 foo.dvi >foo.ps
+%%%
+\typeout{Document Class 'sig-alternate' <23rd. May '12>. Modified by G.K.M. Tobin/Gerry Murray}
+\typeout{Based in part upon document Style `acmconf' <22 May 89>. Hacked 4/91 by}
+\typeout{shivers@cs.cmu.edu, 4/93 by theobald@cs.mcgill.ca}
+\typeout{Excerpts were taken from (Journal Style) 'esub2acm.cls'.}
+\typeout{****** Bugs/comments/suggestions/technicalities to Gerry Murray -- murray@hq.acm.org ******}
+\typeout{Questions on the style, SIGS policies, etc. to Adrienne Griscti griscti@acm.org}
+\oddsidemargin 4.5pc
+\evensidemargin 4.5pc
+\advance\oddsidemargin by -1in % Correct for LaTeX gratuitousness
+\advance\evensidemargin by -1in % Correct for LaTeX gratuitousness
+\marginparwidth 0pt % Margin pars are not allowed.
+\marginparsep 11pt % Horizontal space between outer margin and
+ % marginal note
+
+ % Top of page:
+\topmargin 4.5pc % Nominal distance from top of page to top of
+ % box containing running head.
+\advance\topmargin by -1in % Correct for LaTeX gratuitousness
+\headheight 0pt % Height of box containing running head.
+\headsep 0pt % Space between running head and text.
+ % Bottom of page:
+\footskip 30pt % Distance from baseline of box containing foot
+ % to baseline of last line of text.
+\@ifundefined{footheight}{\newdimen\footheight}{}% this is for LaTeX2e
+\footheight 12pt % Height of box containing running foot.
+
+%% Must redefine the top margin so there's room for headers and
+%% page numbers if you are using the preprint option. Footers
+%% are OK as is. Olin.
+\advance\topmargin by -37pt % Leave 37pt above text for headers
+\headheight 12pt % Height of box containing running head.
+\headsep 25pt % Space between running head and text.
+
+\textheight 666pt % 9 1/4 column height
+\textwidth 42pc % Width of text line.
+ % For two-column mode:
+\columnsep 2pc % Space between columns
+\columnseprule 0pt % Width of rule between columns.
+\hfuzz 1pt % Allow some variation in column width, otherwise it's
+ % too hard to typeset in narrow columns.
+
+\footnotesep 5.6pt % Height of strut placed at the beginning of every
+ % footnote =3D height of normal \footnotesize strut,
+ % so no extra space between footnotes.
+
+\skip\footins 8.1pt plus 4pt minus 2pt % Space between last line of text and
+ % top of first footnote.
+\floatsep 11pt plus 2pt minus 2pt % Space between adjacent floats moved
+ % to top or bottom of text page.
+\textfloatsep 18pt plus 2pt minus 4pt % Space between main text and floats
+ % at top or bottom of page.
+\intextsep 11pt plus 2pt minus 2pt % Space between in-text figures and
+ % text.
+\@ifundefined{@maxsep}{\newdimen\@maxsep}{}% this is for LaTeX2e
+\@maxsep 18pt % The maximum of \floatsep,
+ % \textfloatsep and \intextsep (minus
+ % the stretch and shrink).
+\dblfloatsep 11pt plus 2pt minus 2pt % Same as \floatsep for double-column
+ % figures in two-column mode.
+\dbltextfloatsep 18pt plus 2pt minus 4pt% \textfloatsep for double-column
+ % floats.
+\@ifundefined{@dblmaxsep}{\newdimen\@dblmaxsep}{}% this is for LaTeX2e
+\@dblmaxsep 18pt % The maximum of \dblfloatsep and
+ % \dbltexfloatsep.
+\@fptop 0pt plus 1fil % Stretch at top of float page/column. (Must be
+ % 0pt plus ...)
+\@fpsep 8pt plus 2fil % Space between floats on float page/column.
+\@fpbot 0pt plus 1fil % Stretch at bottom of float page/column. (Must be
+ % 0pt plus ... )
+\@dblfptop 0pt plus 1fil % Stretch at top of float page. (Must be 0pt plus ...)
+\@dblfpsep 8pt plus 2fil % Space between floats on float page.
+\@dblfpbot 0pt plus 1fil % Stretch at bottom of float page. (Must be
+ % 0pt plus ... )
+\marginparpush 5pt % Minimum vertical separation between two marginal
+ % notes.
+
+\parskip 0pt plus 1pt % Extra vertical space between paragraphs.
+\parindent 9pt % GM July 2000 / was 0pt - width of paragraph indentation.
+\partopsep 2pt plus 1pt minus 1pt% Extra vertical space, in addition to
+ % \parskip and \topsep, added when user
+ % leaves blank line before environment.
+
+\@lowpenalty 51 % Produced by \nopagebreak[1] or \nolinebreak[1]
+\@medpenalty 151 % Produced by \nopagebreak[2] or \nolinebreak[2]
+\@highpenalty 301 % Produced by \nopagebreak[3] or \nolinebreak[3]
+
+\@beginparpenalty -\@lowpenalty % Before a list or paragraph environment.
+\@endparpenalty -\@lowpenalty % After a list or paragraph environment.
+\@itempenalty -\@lowpenalty % Between list items.
+
+%\@namedef{ds@10pt}{\@latexerr{The `10pt' option is not allowed in the `acmconf'
+\@namedef{ds@10pt}{\ClassError{The `10pt' option is not allowed in the `acmconf' % January 2008
+ document style.}\@eha}
+%\@namedef{ds@11pt}{\@latexerr{The `11pt' option is not allowed in the `acmconf'
+\@namedef{ds@11pt}{\ClassError{The `11pt' option is not allowed in the `acmconf' % January 2008
+ document style.}\@eha}
+%\@namedef{ds@12pt}{\@latexerr{The `12pt' option is not allowed in the `acmconf'
+\@namedef{ds@12pt}{\ClassError{The `12pt' option is not allowed in the `acmconf' % January 2008
+ document style.}\@eha}
+
+\@options
+
+\lineskip 2pt % \lineskip is 1pt for all font sizes.
+\normallineskip 2pt
+\def\baselinestretch{1}
+
+\abovedisplayskip 9pt plus2pt minus4.5pt%
+\belowdisplayskip \abovedisplayskip
+\abovedisplayshortskip \z@ plus3pt%
+\belowdisplayshortskip 5.4pt plus3pt minus3pt%
+\let\@listi\@listI % Setting of \@listi added 9 Jun 87
+
+\def\small{\@setsize\small{9pt}\viiipt\@viiipt
+\abovedisplayskip 7.6pt plus 3pt minus 4pt%
+\belowdisplayskip \abovedisplayskip
+\abovedisplayshortskip \z@ plus2pt%
+\belowdisplayshortskip 3.6pt plus2pt minus 2pt
+\def\@listi{\leftmargin\leftmargini %% Added 22 Dec 87
+\topsep 4pt plus 2pt minus 2pt\parsep 2pt plus 1pt minus 1pt
+\itemsep \parsep}}
+
+\def\footnotesize{\@setsize\footnotesize{9pt}\ixpt\@ixpt
+\abovedisplayskip 6.4pt plus 2pt minus 4pt%
+\belowdisplayskip \abovedisplayskip
+\abovedisplayshortskip \z@ plus 1pt%
+\belowdisplayshortskip 2.7pt plus 1pt minus 2pt
+\def\@listi{\leftmargin\leftmargini %% Added 22 Dec 87
+\topsep 3pt plus 1pt minus 1pt\parsep 2pt plus 1pt minus 1pt
+\itemsep \parsep}}
+
+\newcount\aucount
+\newcount\originalaucount
+\newdimen\auwidth
+\auwidth=\textwidth
+\newdimen\auskip
+\newcount\auskipcount
+\newdimen\auskip
+\global\auskip=1pc
+\newdimen\allauboxes
+\allauboxes=\auwidth
+\newtoks\addauthors
+\newcount\addauflag
+\global\addauflag=0 %Haven't shown additional authors yet
+
+\newtoks\subtitletext
+\gdef\subtitle#1{\subtitletext={#1}}
+
+\gdef\additionalauthors#1{\addauthors={#1}}
+
+\gdef\numberofauthors#1{\global\aucount=#1
+\ifnum\aucount>3\global\originalaucount=\aucount \global\aucount=3\fi %g} % 3 OK - Gerry March 2007
+\global\auskipcount=\aucount\global\advance\auskipcount by 1
+\global\multiply\auskipcount by 2
+\global\multiply\auskip by \auskipcount
+\global\advance\auwidth by -\auskip
+\global\divide\auwidth by \aucount}
+
+% \and was modified to count the number of authors. GKMT 12 Aug 1999
+\def\alignauthor{% % \begin{tabular}
+\end{tabular}%
+ \begin{tabular}[t]{p{\auwidth}}\centering}%
+
+% *** NOTE *** NOTE *** NOTE *** NOTE ***
+% If you have 'font problems' then you may need
+% to change these, e.g. 'arialb' instead of "arialbd".
+% Gerry Murray 11/11/1999
+% *** OR ** comment out block A and activate block B or vice versa.
+% **********************************************
+%
+% -- Start of block A -- (Type 1 or Truetype fonts)
+%\newfont{\secfnt}{timesbd at 12pt} % was timenrb originally - now is timesbd
+%\newfont{\secit}{timesbi at 12pt} %13 Jan 00 gkmt
+%\newfont{\subsecfnt}{timesi at 11pt} % was timenrri originally - now is timesi
+%\newfont{\subsecit}{timesbi at 11pt} % 13 Jan 00 gkmt -- was times changed to timesbi gm 2/4/2000
+% % because "normal" is italic, "italic" is Roman
+%\newfont{\ttlfnt}{arialbd at 18pt} % was arialb originally - now is arialbd
+%\newfont{\ttlit}{arialbi at 18pt} % 13 Jan 00 gkmt
+%\newfont{\subttlfnt}{arial at 14pt} % was arialr originally - now is arial
+%\newfont{\subttlit}{ariali at 14pt} % 13 Jan 00 gkmt
+%\newfont{\subttlbf}{arialbd at 14pt} % 13 Jan 00 gkmt
+%\newfont{\aufnt}{arial at 12pt} % was arialr originally - now is arial
+%\newfont{\auit}{ariali at 12pt} % 13 Jan 00 gkmt
+%\newfont{\affaddr}{arial at 10pt} % was arialr originally - now is arial
+%\newfont{\affaddrit}{ariali at 10pt} %13 Jan 00 gkmt
+%\newfont{\eaddfnt}{arial at 12pt} % was arialr originally - now is arial
+%\newfont{\ixpt}{times at 9pt} % was timenrr originally - now is times
+%\newfont{\confname}{timesi at 8pt} % was timenrri - now is timesi
+%\newfont{\crnotice}{times at 8pt} % was timenrr originally - now is times
+%\newfont{\ninept}{times at 9pt} % was timenrr originally - now is times
+
+% *********************************************
+% -- End of block A --
+%
+%
+% -- Start of block B -- UPDATED FONT NAMES
+% *********************************************
+% Gerry Murray 11/30/2006
+% *********************************************
+\newfont{\secfnt}{ptmb8t at 12pt}
+\newfont{\secit}{ptmbi8t at 12pt} %13 Jan 00 gkmt
+\newfont{\subsecfnt}{ptmri8t at 11pt}
+\newfont{\subsecit}{ptmbi8t at 11pt} %
+\newfont{\ttlfnt}{phvb8t at 18pt}
+\newfont{\ttlit}{phvbo8t at 18pt} % GM 2/4/2000
+\newfont{\subttlfnt}{phvr8t at 14pt}
+\newfont{\subttlit}{phvro8t at 14pt} % GM 2/4/2000
+\newfont{\subttlbf}{phvb8t at 14pt} % 13 Jan 00 gkmt
+\newfont{\aufnt}{phvr8t at 12pt}
+\newfont{\auit}{phvro8t at 12pt} % GM 2/4/2000
+\newfont{\affaddr}{phvr8t at 10pt}
+\newfont{\affaddrit}{phvro8t at 10pt} % GM 2/4/2000
+\newfont{\eaddfnt}{phvr8t at 12pt}
+\newfont{\ixpt}{ptmr8t at 9pt}
+\newfont{\confname}{ptmri8t at 8pt}
+\newfont{\crnotice}{ptmr8t at 8pt}
+\newfont{\ninept}{ptmr8t at 9pt}
+% +++++++++++++++++++++++++++++++++++++++++++++
+% -- End of block B --
+
+%\def\email#1{{{\eaddfnt{\vskip 4pt#1}}}}
+% If we have an email, inside a "shared affiliation" then we need the following instead
+\def\email#1{{{\eaddfnt{\par #1}}}} % revised - GM - 11/30/2006
+
+\def\addauthorsection{\ifnum\originalaucount>6 % was 3 - Gerry March 2007
+ \section{Additional Authors}\the\addauthors
+ \fi}
+
+\newcount\savesection
+\newcount\sectioncntr
+\global\sectioncntr=1
+
+\setcounter{secnumdepth}{3}
+
+\def\appendix{\par
+\section*{APPENDIX}
+\setcounter{section}{0}
+ \setcounter{subsection}{0}
+ \def\thesection{\Alph{section}} }
+
+\leftmargini 22.5pt
+\leftmarginii 19.8pt % > \labelsep + width of '(m)'
+\leftmarginiii 16.8pt % > \labelsep + width of 'vii.'
+\leftmarginiv 15.3pt % > \labelsep + width of 'M.'
+\leftmarginv 9pt
+\leftmarginvi 9pt
+
+\leftmargin\leftmargini
+\labelsep 4.5pt
+\labelwidth\leftmargini\advance\labelwidth-\labelsep
+
+\def\@listI{\leftmargin\leftmargini \parsep 3.6pt plus 2pt minus 1pt%
+\topsep 7.2pt plus 2pt minus 4pt%
+\itemsep 3.6pt plus 2pt minus 1pt}
+
+\let\@listi\@listI
+\@listi
+
+\def\@listii{\leftmargin\leftmarginii
+ \labelwidth\leftmarginii\advance\labelwidth-\labelsep
+ \topsep 3.6pt plus 2pt minus 1pt
+ \parsep 1.8pt plus 0.9pt minus 0.9pt
+ \itemsep \parsep}
+
+\def\@listiii{\leftmargin\leftmarginiii
+ \labelwidth\leftmarginiii\advance\labelwidth-\labelsep
+ \topsep 1.8pt plus 0.9pt minus 0.9pt
+ \parsep \z@ \partopsep 1pt plus 0pt minus 1pt
+ \itemsep \topsep}
+
+\def\@listiv{\leftmargin\leftmarginiv
+ \labelwidth\leftmarginiv\advance\labelwidth-\labelsep}
+
+\def\@listv{\leftmargin\leftmarginv
+ \labelwidth\leftmarginv\advance\labelwidth-\labelsep}
+
+\def\@listvi{\leftmargin\leftmarginvi
+ \labelwidth\leftmarginvi\advance\labelwidth-\labelsep}
+
+\def\labelenumi{\theenumi.}
+\def\theenumi{\arabic{enumi}}
+
+\def\labelenumii{(\theenumii)}
+\def\theenumii{\alph{enumii}}
+\def\p@enumii{\theenumi}
+
+\def\labelenumiii{\theenumiii.}
+\def\theenumiii{\roman{enumiii}}
+\def\p@enumiii{\theenumi(\theenumii)}
+
+\def\labelenumiv{\theenumiv.}
+\def\theenumiv{\Alph{enumiv}}
+\def\p@enumiv{\p@enumiii\theenumiii}
+
+\def\labelitemi{$\bullet$}
+\def\labelitemii{\bf --}
+\def\labelitemiii{$\ast$}
+\def\labelitemiv{$\cdot$}
+
+\def\verse{\let\\=\@centercr
+ \list{}{\itemsep\z@ \itemindent -1.5em\listparindent \itemindent
+ \rightmargin\leftmargin\advance\leftmargin 1.5em}\item[]}
+\let\endverse\endlist
+
+\def\quotation{\list{}{\listparindent 1.5em
+ \itemindent\listparindent
+ \rightmargin\leftmargin \parsep 0pt plus 1pt}\item[]}
+\let\endquotation=\endlist
+
+\def\quote{\list{}{\rightmargin\leftmargin}\item[]}
+\let\endquote=\endlist
+
+\def\descriptionlabel#1{\hspace\labelsep \bf #1}
+\def\description{\list{}{\labelwidth\z@ \itemindent-\leftmargin
+ \let\makelabel\descriptionlabel}}
+
+\let\enddescription\endlist
+
+\def\theequation{\arabic{equation}}
+
+\arraycolsep 4.5pt % Half the space between columns in an array environment.
+\tabcolsep 5.4pt % Half the space between columns in a tabular environment.
+\arrayrulewidth .5pt % Width of rules in array and tabular environment. % (was .4) updated Gerry March 20 2007
+\doublerulesep 1.8pt % Space between adjacent rules in array or tabular env.
+
+\tabbingsep \labelsep % Space used by the \' command. (See LaTeX manual.)
+
+\skip\@mpfootins =\skip\footins
+
+\fboxsep =2.7pt % Space left between box and text by \fbox and \framebox.
+\fboxrule =.5pt % Width of rules in box made by \fbox and \framebox. % (was .4) updated Gerry March 20 2007
+
+\def\thepart{\Roman{part}} % Roman numeral part numbers.
+\def\thesection {\arabic{section}}
+\def\thesubsection {\thesection.\arabic{subsection}}
+%\def\thesubsubsection {\thesubsection.\arabic{subsubsection}} % GM 7/30/2002
+%\def\theparagraph {\thesubsubsection.\arabic{paragraph}} % GM 7/30/2002
+\def\thesubparagraph {\theparagraph.\arabic{subparagraph}}
+
+\def\@pnumwidth{1.55em}
+\def\@tocrmarg {2.55em}
+\def\@dotsep{4.5}
+\setcounter{tocdepth}{3}
+
+%\def\tableofcontents{\@latexerr{\tableofcontents: Tables of contents are not
+% allowed in the `acmconf' document style.}\@eha}
+
+\def\tableofcontents{\ClassError{%
+ \string\tableofcontents\space is not allowed in the `acmconf' document % January 2008
+ style}\@eha}
+
+\def\l@part#1#2{\addpenalty{\@secpenalty}
+ \addvspace{2.25em plus 1pt} % space above part line
+ \begingroup
+ \@tempdima 3em % width of box holding part number, used by
+ \parindent \z@ \rightskip \@pnumwidth %% \numberline
+ \parfillskip -\@pnumwidth
+ {\large \bf % set line in \large boldface
+ \leavevmode % TeX command to enter horizontal mode.
+ #1\hfil \hbox to\@pnumwidth{\hss #2}}\par
+ \nobreak % Never break after part entry
+ \endgroup}
+
+\def\l@section#1#2{\addpenalty{\@secpenalty} % good place for page break
+ \addvspace{1.0em plus 1pt} % space above toc entry
+ \@tempdima 1.5em % width of box holding section number
+ \begingroup
+ \parindent \z@ \rightskip \@pnumwidth
+ \parfillskip -\@pnumwidth
+ \bf % Boldface.
+ \leavevmode % TeX command to enter horizontal mode.
+ \advance\leftskip\@tempdima %% added 5 Feb 88 to conform to
+ \hskip -\leftskip %% 25 Jan 88 change to \numberline
+ #1\nobreak\hfil \nobreak\hbox to\@pnumwidth{\hss #2}\par
+ \endgroup}
+
+
+\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
+\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
+\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
+\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
+
+%\def\listoffigures{\@latexerr{\listoffigures: Lists of figures are not
+% allowed in the `acmconf' document style.}\@eha}
+
+\def\listoffigures{\ClassError{%
+ \string\listoffigures\space is not allowed in the `acmconf' document % January 2008
+ style}\@eha}
+
+\def\l@figure{\@dottedtocline{1}{1.5em}{2.3em}}
+
+%\def\listoftables{\@latexerr{\listoftables: Lists of tables are not
+% allowed in the `acmconf' document style.}\@eha}
+%\let\l@table\l@figure
+
+\def\listoftables{\ClassError{%
+ \string\listoftables\space is not allowed in the `acmconf' document % January 2008
+ style}\@eha}
+ \let\l@table\l@figure
+
+\def\footnoterule{\kern-3\p@
+ \hrule width .5\columnwidth % (was .4) updated Gerry March 20 2007
+ \kern 2.6\p@} % The \hrule has default height of .4pt % (was .4) updated Gerry March 20 2007
+% ------
+\long\def\@makefntext#1{\noindent
+%\hbox to .5em{\hss$^{\@thefnmark}$}#1} % original
+\hbox to .5em{\hss\textsuperscript{\@thefnmark}}#1} % C. Clifton / GM Oct. 2nd. 2002
+% -------
+
+\long\def\@maketntext#1{\noindent
+#1}
+
+\long\def\@maketitlenotetext#1#2{\noindent
+ \hbox to 1.8em{\hss$^{#1}$}#2}
+
+\setcounter{topnumber}{2}
+\def\topfraction{.7}
+\setcounter{bottomnumber}{1}
+\def\bottomfraction{.3}
+\setcounter{totalnumber}{3}
+\def\textfraction{.2}
+\def\floatpagefraction{.5}
+\setcounter{dbltopnumber}{2}
+\def\dbltopfraction{.7}
+\def\dblfloatpagefraction{.5}
+
+%
+\long\def\@makecaption#1#2{
+ \vskip \baselineskip
+ \setbox\@tempboxa\hbox{\textbf{#1: #2}}
+ \ifdim \wd\@tempboxa >\hsize % IF longer than one line:
+ \textbf{#1: #2}\par % THEN set as ordinary paragraph.
+ \else % ELSE center.
+ \hbox to\hsize{\hfil\box\@tempboxa\hfil}\par
+ \fi}
+
+%
+
+\long\def\@makecaption#1#2{
+ \vskip 10pt
+ \setbox\@tempboxa\hbox{\textbf{#1: #2}}
+ \ifdim \wd\@tempboxa >\hsize % IF longer than one line:
+ \textbf{#1: #2}\par % THEN set as ordinary paragraph.
+ \else % ELSE center.
+ \hbox to\hsize{\hfil\box\@tempboxa\hfil}
+ \fi}
+
+\@ifundefined{figure}{\newcounter {figure}} % this is for LaTeX2e
+
+\def\fps@figure{tbp}
+\def\ftype@figure{1}
+\def\ext@figure{lof}
+\def\fnum@figure{Figure \thefigure}
+\def\figure{\@float{figure}}
+%\let\endfigure\end@float
+\def\endfigure{\end@float} % Gerry January 2008
+\@namedef{figure*}{\@dblfloat{figure}}
+\@namedef{endfigure*}{\end@dblfloat}
+
+\@ifundefined{table}{\newcounter {table}} % this is for LaTeX2e
+
+\def\fps@table{tbp}
+\def\ftype@table{2}
+\def\ext@table{lot}
+\def\fnum@table{Table \thetable}
+\def\table{\@float{table}}
+%\let\endtable\end@float
+\def\endtable{\end@float} % Gerry January 2008
+\@namedef{table*}{\@dblfloat{table}}
+\@namedef{endtable*}{\end@dblfloat}
+
+\newtoks\titleboxnotes
+\newcount\titleboxnoteflag
+
+\def\maketitle{\par
+ \begingroup
+ \def\thefootnote{\fnsymbol{footnote}}
+ \def\@makefnmark{\hbox
+ to 0pt{$^{\@thefnmark}$\hss}}
+ \twocolumn[\@maketitle]
+\@thanks
+ \endgroup
+ \setcounter{footnote}{0}
+ \let\maketitle\relax
+ \let\@maketitle\relax
+ \gdef\@thanks{}\gdef\@author{}\gdef\@title{}\gdef\@subtitle{}\let\thanks\relax
+ \@copyrightspace}
+
+%% CHANGES ON NEXT LINES
+\newif\if@ll % to record which version of LaTeX is in use
+
+\expandafter\ifx\csname LaTeXe\endcsname\relax % LaTeX2.09 is used
+\else% LaTeX2e is used, so set ll to true
+\global\@lltrue
+\fi
+
+\if@ll
+ \NeedsTeXFormat{LaTeX2e}
+ \ProvidesClass{sig-alternate} [2012/05/23 - V2.5 - based on acmproc.cls V1.3 <Nov. 30 '99>]
+ \RequirePackage{latexsym}% QUERY: are these two really needed?
+ \let\dooptions\ProcessOptions
+\else
+ \let\dooptions\@options
+\fi
+%% END CHANGES
+
+\def\@height{height}
+\def\@width{width}
+\def\@minus{minus}
+\def\@plus{plus}
+\def\hb@xt@{\hbox to}
+\newif\if@faircopy
+\@faircopyfalse
+\def\ds@faircopy{\@faircopytrue}
+
+\def\ds@preprint{\@faircopyfalse}
+
+\@twosidetrue
+\@mparswitchtrue
+\def\ds@draft{\overfullrule 5\p@}
+%% CHANGE ON NEXT LINE
+\dooptions
+
+\lineskip \p@
+\normallineskip \p@
+\def\baselinestretch{1}
+\def\@ptsize{0} %needed for amssymbols.sty
+
+%% CHANGES ON NEXT LINES
+\if@ll% allow use of old-style font change commands in LaTeX2e
+\@maxdepth\maxdepth
+%
+\DeclareOldFontCommand{\rm}{\ninept\rmfamily}{\mathrm}
+\DeclareOldFontCommand{\sf}{\normalfont\sffamily}{\mathsf}
+\DeclareOldFontCommand{\tt}{\normalfont\ttfamily}{\mathtt}
+\DeclareOldFontCommand{\bf}{\normalfont\bfseries}{\mathbf}
+\DeclareOldFontCommand{\it}{\normalfont\itshape}{\mathit}
+\DeclareOldFontCommand{\sl}{\normalfont\slshape}{\@nomath\sl}
+\DeclareOldFontCommand{\sc}{\normalfont\scshape}{\@nomath\sc}
+\DeclareRobustCommand*{\cal}{\@fontswitch{\relax}{\mathcal}}
+\DeclareRobustCommand*{\mit}{\@fontswitch{\relax}{\mathnormal}}
+\fi
+%
+\if@ll
+ \renewcommand{\rmdefault}{cmr} % was 'ttm'
+% Note! I have also found 'mvr' to work ESPECIALLY well.
+% Gerry - October 1999
+% You may need to change your LV1times.fd file so that sc is
+% mapped to cmcsc - -for smallcaps -- that is if you decide
+% to change {cmr} to {times} above. (Not recommended)
+ \renewcommand{\@ptsize}{}
+ \renewcommand{\normalsize}{%
+ \@setfontsize\normalsize\@ixpt{10.5\p@}%\ninept%
+ \abovedisplayskip 6\p@ \@plus2\p@ \@minus\p@
+ \belowdisplayskip \abovedisplayskip
+ \abovedisplayshortskip 6\p@ \@minus 3\p@
+ \belowdisplayshortskip 6\p@ \@minus 3\p@
+ \let\@listi\@listI
+ }
+\else
+ \def\@normalsize{%changed next to 9 from 10
+ \@setsize\normalsize{9\p@}\ixpt\@ixpt
+ \abovedisplayskip 6\p@ \@plus2\p@ \@minus\p@
+ \belowdisplayskip \abovedisplayskip
+ \abovedisplayshortskip 6\p@ \@minus 3\p@
+ \belowdisplayshortskip 6\p@ \@minus 3\p@
+ \let\@listi\@listI
+ }%
+\fi
+\if@ll
+ \newcommand\scriptsize{\@setfontsize\scriptsize\@viipt{8\p@}}
+ \newcommand\tiny{\@setfontsize\tiny\@vpt{6\p@}}
+ \newcommand\large{\@setfontsize\large\@xiipt{14\p@}}
+ \newcommand\Large{\@setfontsize\Large\@xivpt{18\p@}}
+ \newcommand\LARGE{\@setfontsize\LARGE\@xviipt{20\p@}}
+ \newcommand\huge{\@setfontsize\huge\@xxpt{25\p@}}
+ \newcommand\Huge{\@setfontsize\Huge\@xxvpt{30\p@}}
+\else
+ \def\scriptsize{\@setsize\scriptsize{8\p@}\viipt\@viipt}
+ \def\tiny{\@setsize\tiny{6\p@}\vpt\@vpt}
+ \def\large{\@setsize\large{14\p@}\xiipt\@xiipt}
+ \def\Large{\@setsize\Large{18\p@}\xivpt\@xivpt}
+ \def\LARGE{\@setsize\LARGE{20\p@}\xviipt\@xviipt}
+ \def\huge{\@setsize\huge{25\p@}\xxpt\@xxpt}
+ \def\Huge{\@setsize\Huge{30\p@}\xxvpt\@xxvpt}
+\fi
+\normalsize
+
+% make aubox hsize/number of authors up to 3, less gutter
+% then showbox gutter showbox gutter showbox -- GKMT Aug 99
+\newbox\@acmtitlebox
+\def\@maketitle{\newpage
+ \null
+ \setbox\@acmtitlebox\vbox{%
+\baselineskip 20pt
+\vskip 2em % Vertical space above title.
+ \begin{center}
+ {\ttlfnt \@title\par} % Title set in 18pt Helvetica (Arial) bold size.
+ \vskip 1.5em % Vertical space after title.
+%This should be the subtitle.
+{\subttlfnt \the\subtitletext\par}\vskip 1.25em%\fi
+ {\baselineskip 16pt\aufnt % each author set in \12 pt Arial, in a
+ \lineskip .5em % tabular environment
+ \begin{tabular}[t]{c}\@author
+ \end{tabular}\par}
+ \vskip 1.5em % Vertical space after author.
+ \end{center}}
+ \dimen0=\ht\@acmtitlebox
+ \advance\dimen0 by -12.75pc\relax % Increased space for title box -- KBT
+ \unvbox\@acmtitlebox
+ \ifdim\dimen0<0.0pt\relax\vskip-\dimen0\fi}
+
+
+\newcount\titlenotecount
+\global\titlenotecount=0
+\newtoks\tntoks
+\newtoks\tntokstwo
+\newtoks\tntoksthree
+\newtoks\tntoksfour
+\newtoks\tntoksfive
+
+\def\abstract{
+\ifnum\titlenotecount>0 % was =1
+ \insert\footins{%
+ \reset@font\footnotesize
+ \interlinepenalty\interfootnotelinepenalty
+ \splittopskip\footnotesep
+ \splitmaxdepth \dp\strutbox \floatingpenalty \@MM
+ \hsize\columnwidth \@parboxrestore
+ \protected@edef\@currentlabel{%
+ }%
+ \color@begingroup
+\ifnum\titlenotecount=1
+ \@maketntext{%
+ \raisebox{4pt}{$\ast$}\rule\z@\footnotesep\ignorespaces\the\tntoks\@finalstrut\strutbox}%
+\fi
+\ifnum\titlenotecount=2
+ \@maketntext{%
+ \raisebox{4pt}{$\ast$}\rule\z@\footnotesep\ignorespaces\the\tntoks\par\@finalstrut\strutbox}%
+\@maketntext{%
+ \raisebox{4pt}{$\dagger$}\rule\z@\footnotesep\ignorespaces\the\tntokstwo\@finalstrut\strutbox}%
+\fi
+\ifnum\titlenotecount=3
+ \@maketntext{%
+ \raisebox{4pt}{$\ast$}\rule\z@\footnotesep\ignorespaces\the\tntoks\par\@finalstrut\strutbox}%
+\@maketntext{%
+ \raisebox{4pt}{$\dagger$}\rule\z@\footnotesep\ignorespaces\the\tntokstwo\par\@finalstrut\strutbox}%
+\@maketntext{%
+ \raisebox{4pt}{$\ddagger$}\rule\z@\footnotesep\ignorespaces\the\tntoksthree\@finalstrut\strutbox}%
+\fi
+\ifnum\titlenotecount=4
+ \@maketntext{%
+ \raisebox{4pt}{$\ast$}\rule\z@\footnotesep\ignorespaces\the\tntoks\par\@finalstrut\strutbox}%
+\@maketntext{%
+ \raisebox{4pt}{$\dagger$}\rule\z@\footnotesep\ignorespaces\the\tntokstwo\par\@finalstrut\strutbox}%
+\@maketntext{%
+ \raisebox{4pt}{$\ddagger$}\rule\z@\footnotesep\ignorespaces\the\tntoksthree\par\@finalstrut\strutbox}%
+\@maketntext{%
+ \raisebox{4pt}{$\S$}\rule\z@\footnotesep\ignorespaces\the\tntoksfour\@finalstrut\strutbox}%
+\fi
+\ifnum\titlenotecount=5
+ \@maketntext{%
+ \raisebox{4pt}{$\ast$}\rule\z@\footnotesep\ignorespaces\the\tntoks\par\@finalstrut\strutbox}%
+\@maketntext{%
+ \raisebox{4pt}{$\dagger$}\rule\z@\footnotesep\ignorespaces\the\tntokstwo\par\@finalstrut\strutbox}%
+\@maketntext{%
+ \raisebox{4pt}{$\ddagger$}\rule\z@\footnotesep\ignorespaces\the\tntoksthree\par\@finalstrut\strutbox}%
+\@maketntext{%
+ \raisebox{4pt}{$\S$}\rule\z@\footnotesep\ignorespaces\the\tntoksfour\par\@finalstrut\strutbox}%
+\@maketntext{%
+ \raisebox{4pt}{$\P$}\rule\z@\footnotesep\ignorespaces\the\tntoksfive\@finalstrut\strutbox}%
+\fi
+ \color@endgroup} %g}
+\fi
+\setcounter{footnote}{0}
+\section*{ABSTRACT}\normalsize%\ninept
+}
+
+\def\endabstract{\if@twocolumn\else\endquotation\fi}
+
+\def\keywords{\if@twocolumn
+\section*{Keywords}
+\else \small
+\quotation
+\fi}
+
+\def\terms{\if@twocolumn
+\section*{General Terms}
+\else \small
+\quotation
+\fi}
+
+% -- Classification needs to be a bit smart due to optionals - Gerry/Georgia November 2nd. 1999
+\newcount\catcount
+\global\catcount=1
+
+\def\category#1#2#3{%
+\ifnum\catcount=1
+\section*{Categories and Subject Descriptors}
+\advance\catcount by 1\else{\unskip; }\fi
+ \@ifnextchar [{\@category{#1}{#2}{#3}}{\@category{#1}{#2}{#3}[]}%
+}
+
+\def\@category#1#2#3[#4]{%
+ \begingroup
+ \let\and\relax
+ #1 [\textbf{#2}]%
+ \if!#4!%
+ \if!#3!\else : #3\fi
+ \else
+ :\space
+ \if!#3!\else #3\kern\z@---\hskip\z@\fi
+ \textit{#4}%
+ \fi
+ \endgroup
+}
+%
+
+%%% This section (written by KBT) handles the 1" box in the lower left
+%%% corner of the left column of the first page by creating a picture,
+%%% and inserting the predefined string at the bottom (with a negative
+%%% displacement to offset the space allocated for a non-existent
+%%% caption).
+%%%
+\newtoks\copyrightnotice
+\def\ftype@copyrightbox{8}
+\def\@copyrightspace{
+\@float{copyrightbox}[b]
+\begin{center}
+\setlength{\unitlength}{1pc}
+\begin{picture}(20,6) %Space for copyright notice
+\put(0,-0.95){\crnotice{\@toappear}}
+\end{picture}
+\end{center}
+\end@float}
+
+\def\@toappear{} % Default setting blank - commands below change this.
+\long\def\toappear#1{\def\@toappear{\parbox[b]{20pc}{\baselineskip 9pt#1}}}
+\def\toappearbox#1{\def\@toappear{\raisebox{5pt}{\framebox[20pc]{\parbox[b]{19pc}{#1}}}}}
+
+\newtoks\conf
+\newtoks\confinfo
+\def\conferenceinfo#1#2{\global\conf={#1}\global\confinfo{#2}}
+
+
+%\def\marginpar{\@latexerr{The \marginpar command is not allowed in the
+% `acmconf' document style.}\@eha}
+
+\def\marginpar{\ClassError{%
+ \string\marginpar\space is not allowed in the `acmconf' document % January 2008
+ style}\@eha}
+
+\mark{{}{}} % Initializes TeX's marks
+
+\def\today{\ifcase\month\or
+ January\or February\or March\or April\or May\or June\or
+ July\or August\or September\or October\or November\or December\fi
+ \space\number\day, \number\year}
+
+\def\@begintheorem#1#2{%
+ \parskip 0pt % GM July 2000 (for tighter spacing)
+ \trivlist
+ \item[%
+ \hskip 10\p@
+ \hskip \labelsep
+ {{\sc #1}\hskip 5\p@\relax#2.}%
+ ]
+ \it
+}
+\def\@opargbegintheorem#1#2#3{%
+ \parskip 0pt % GM July 2000 (for tighter spacing)
+ \trivlist
+ \item[%
+ \hskip 10\p@
+ \hskip \labelsep
+ {\sc #1\ #2\ % This mod by Gerry to enumerate corollaries
+ \setbox\@tempboxa\hbox{(#3)} % and bracket the 'corollary title'
+ \ifdim \wd\@tempboxa>\z@ % and retain the correct numbering of e.g. theorems
+ \hskip 5\p@\relax % if they occur 'around' said corollaries.
+ \box\@tempboxa % Gerry - Nov. 1999.
+ \fi.}%
+ ]
+ \it
+}
+\newif\if@qeded
+\global\@qededfalse
+
+% -- original
+%\def\proof{%
+% \vspace{-\parskip} % GM July 2000 (for tighter spacing)
+% \global\@qededfalse
+% \@ifnextchar[{\@xproof}{\@proof}%
+%}
+% -- end of original
+
+% (JSS) Fix for vertical spacing bug - Gerry Murray July 30th. 2002
+\def\proof{%
+\vspace{-\lastskip}\vspace{-\parsep}\penalty-51%
+\global\@qededfalse
+\@ifnextchar[{\@xproof}{\@proof}%
+}
+
+\def\endproof{%
+ \if@qeded\else\qed\fi
+ \endtrivlist
+}
+\def\@proof{%
+ \trivlist
+ \item[%
+ \hskip 10\p@
+ \hskip \labelsep
+ {\sc Proof.}%
+ ]
+ \ignorespaces
+}
+\def\@xproof[#1]{%
+ \trivlist
+ \item[\hskip 10\p@\hskip \labelsep{\sc Proof #1.}]%
+ \ignorespaces
+}
+\def\qed{%
+ \unskip
+ \kern 10\p@
+ \begingroup
+ \unitlength\p@
+ \linethickness{.4\p@}%
+ \framebox(6,6){}%
+ \endgroup
+ \global\@qededtrue
+}
+
+\def\newdef#1#2{%
+ \expandafter\@ifdefinable\csname #1\endcsname
+ {\@definecounter{#1}%
+ \expandafter\xdef\csname the#1\endcsname{\@thmcounter{#1}}%
+ \global\@namedef{#1}{\@defthm{#1}{#2}}%
+ \global\@namedef{end#1}{\@endtheorem}%
+ }%
+}
+\def\@defthm#1#2{%
+ \refstepcounter{#1}%
+ \@ifnextchar[{\@ydefthm{#1}{#2}}{\@xdefthm{#1}{#2}}%
+}
+\def\@xdefthm#1#2{%
+ \@begindef{#2}{\csname the#1\endcsname}%
+ \ignorespaces
+}
+\def\@ydefthm#1#2[#3]{%
+ \trivlist
+ \item[%
+ \hskip 10\p@
+ \hskip \labelsep
+ {\it #2%
+% \savebox\@tempboxa{#3}%
+ \saveb@x\@tempboxa{#3}% % January 2008
+ \ifdim \wd\@tempboxa>\z@
+ \ \box\@tempboxa
+ \fi.%
+ }]%
+ \ignorespaces
+}
+\def\@begindef#1#2{%
+ \trivlist
+ \item[%
+ \hskip 10\p@
+ \hskip \labelsep
+ {\it #1\ \rm #2.}%
+ ]%
+}
+\def\theequation{\arabic{equation}}
+
+\newcounter{part}
+\newcounter{section}
+\newcounter{subsection}[section]
+\newcounter{subsubsection}[subsection]
+\newcounter{paragraph}[subsubsection]
+\def\thepart{\Roman{part}}
+\def\thesection{\arabic{section}}
+\def\thesubsection{\thesection.\arabic{subsection}}
+\def\thesubsubsection{\thesubsection.\arabic{subsubsection}} %removed \subsecfnt 29 July 2002 gkmt
+\def\theparagraph{\thesubsubsection.\arabic{paragraph}} %removed \subsecfnt 29 July 2002 gkmt
+\newif\if@uchead
+\@ucheadfalse
+
+%% CHANGES: NEW NOTE
+%% NOTE: OK to use old-style font commands below, since they were
+%% suitably redefined for LaTeX2e
+%% END CHANGES
+\setcounter{secnumdepth}{3}
+\def\part{%
+ \@startsection{part}{9}{\z@}{-10\p@ \@plus -4\p@ \@minus -2\p@}
+ {4\p@}{\normalsize\@ucheadtrue}%
+}
+\def\section{%
+ \@startsection{section}{1}{\z@}{-10\p@ \@plus -4\p@ \@minus -2\p@}% GM
+ {4\p@}{\baselineskip 14pt\secfnt\@ucheadtrue}%
+}
+
+\def\subsection{%
+ \@startsection{subsection}{2}{\z@}{-8\p@ \@plus -2\p@ \@minus -\p@}
+ {4\p@}{\secfnt}%
+}
+\def\subsubsection{%
+ \@startsection{subsubsection}{3}{\z@}{-8\p@ \@plus -2\p@ \@minus -\p@}%
+ {4\p@}{\subsecfnt}%
+}
+%\def\paragraph{%
+% \vskip 12pt\@startsection{paragraph}{3}{\z@}{6\p@ \@plus \p@}% original
+% {-5\p@}{\subsecfnt}%
+%}
+% If one wants sections, subsections and subsubsections numbered,
+% but not paragraphs, one usually sets secnumepth to 3.
+% For that, the "depth" of paragraphs must be given correctly
+% in the definition (``4'' instead of ``3'' as second argument
+% of @startsection):
+\def\paragraph{%
+ \vskip 12pt\@startsection{paragraph}{4}{\z@}{6\p@ \@plus \p@}% % GM and Wolfgang May - 11/30/06
+ {-5\p@}{\subsecfnt}%
+}
+\let\@period=.
+\def\@startsection#1#2#3#4#5#6{%
+ \if@noskipsec %gkmt, 11 aug 99
+ \global\let\@period\@empty
+ \leavevmode
+ \global\let\@period.%
+ \fi
+ \par %
+ \@tempskipa #4\relax
+ \@afterindenttrue
+ \ifdim \@tempskipa <\z@
+ \@tempskipa -\@tempskipa
+ \@afterindentfalse
+ \fi
+ \if@nobreak
+ \everypar{}%
+ \else
+ \addpenalty\@secpenalty
+ \addvspace\@tempskipa
+ \fi
+\parskip=0pt % GM July 2000 (non numbered) section heads
+ \@ifstar
+ {\@ssect{#3}{#4}{#5}{#6}}
+ {\@dblarg{\@sect{#1}{#2}{#3}{#4}{#5}{#6}}}%
+}
+\def\@sect#1#2#3#4#5#6[#7]#8{%
+ \ifnum #2>\c@secnumdepth
+ \let\@svsec\@empty
+ \else
+ \refstepcounter{#1}%
+ \edef\@svsec{%
+ \begingroup
+ %\ifnum#2>2 \noexpand\rm \fi % changed to next 29 July 2002 gkmt
+ \ifnum#2>2 \noexpand#6 \fi
+ \csname the#1\endcsname
+ \endgroup
+ \ifnum #2=1\relax .\fi
+ \hskip 1em
+ }%
+ \fi
+ \@tempskipa #5\relax
+ \ifdim \@tempskipa>\z@
+ \begingroup
+ #6\relax
+ \@hangfrom{\hskip #3\relax\@svsec}%
+ \begingroup
+ \interlinepenalty \@M
+ \if@uchead
+ \uppercase{#8}%
+ \else
+ #8%
+ \fi
+ \par
+ \endgroup
+ \endgroup
+ \csname #1mark\endcsname{#7}%
+ \vskip -12pt %gkmt, 11 aug 99 and GM July 2000 (was -14) - numbered section head spacing
+\addcontentsline{toc}{#1}{%
+ \ifnum #2>\c@secnumdepth \else
+ \protect\numberline{\csname the#1\endcsname}%
+ \fi
+ #7%
+ }%
+ \else
+ \def\@svsechd{%
+ #6%
+ \hskip #3\relax
+ \@svsec
+ \if@uchead
+ \uppercase{#8}%
+ \else
+ #8%
+ \fi
+ \csname #1mark\endcsname{#7}%
+ \addcontentsline{toc}{#1}{%
+ \ifnum #2>\c@secnumdepth \else
+ \protect\numberline{\csname the#1\endcsname}%
+ \fi
+ #7%
+ }%
+ }%
+ \fi
+ \@xsect{#5}\hskip 1pt
+ \par
+}
+\def\@xsect#1{%
+ \@tempskipa #1\relax
+ \ifdim \@tempskipa>\z@
+ \par
+ \nobreak
+ \vskip \@tempskipa
+ \@afterheading
+ \else
+ \global\@nobreakfalse
+ \global\@noskipsectrue
+ \everypar{%
+ \if@noskipsec
+ \global\@noskipsecfalse
+ \clubpenalty\@M
+ \hskip -\parindent
+ \begingroup
+ \@svsechd
+ \@period
+ \endgroup
+ \unskip
+ \@tempskipa #1\relax
+ \hskip -\@tempskipa
+ \else
+ \clubpenalty \@clubpenalty
+ \everypar{}%
+ \fi
+ }%
+ \fi
+ \ignorespaces
+}
+\def\@trivlist{%
+ \@topsepadd\topsep
+ \if@noskipsec
+ \global\let\@period\@empty
+ \leavevmode
+ \global\let\@period.%
+ \fi
+ \ifvmode
+ \advance\@topsepadd\partopsep
+ \else
+ \unskip
+ \par
+ \fi
+ \if@inlabel
+ \@noparitemtrue
+ \@noparlisttrue
+ \else
+ \@noparlistfalse
+ \@topsep\@topsepadd
+ \fi
+ \advance\@topsep \parskip
+ \leftskip\z@skip
+ \rightskip\@rightskip
+ \parfillskip\@flushglue
+ \@setpar{\if@newlist\else{\@@par}\fi}
+ \global\@newlisttrue
+ \@outerparskip\parskip
+}
+
+%%% Actually, 'abbrev' works just fine as the default
+%%% Bibliography style.
+
+\typeout{Using 'Abbrev' bibliography style}
+\newcommand\bibyear[2]{%
+ \unskip\quad\ignorespaces#1\unskip
+ \if#2..\quad \else \quad#2 \fi
+}
+\newcommand{\bibemph}[1]{{\em#1}}
+\newcommand{\bibemphic}[1]{{\em#1\/}}
+\newcommand{\bibsc}[1]{{\sc#1}}
+\def\@normalcite{%
+ \def\@cite##1##2{[##1\if@tempswa , ##2\fi]}%
+}
+\def\@citeNB{%
+ \def\@cite##1##2{##1\if@tempswa , ##2\fi}%
+}
+\def\@citeRB{%
+ \def\@cite##1##2{##1\if@tempswa , ##2\fi]}%
+}
+\def\start@cite#1#2{%
+ \edef\citeauthoryear##1##2##3{%
+ ###1%
+ \ifnum#2=\z@ \else\ ###2\fi
+ }%
+ \ifnum#1=\thr@@
+ \let\@@cite\@citeyear
+ \else
+ \let\@@cite\@citenormal
+ \fi
+ \@ifstar{\@citeNB\@@cite}{\@normalcite\@@cite}%
+}
+%\def\cite{\start@cite23}
+\DeclareRobustCommand\cite{\start@cite23} % January 2008
+\def\citeNP{\cite*} % No Parentheses e.g. 5
+%\def\citeA{\start@cite10}
+\DeclareRobustCommand\citeA{\start@cite10} % January 2008
+\def\citeANP{\citeA*}
+%\def\shortcite{\start@cite23}
+\DeclareRobustCommand\shortcite{\start@cite23} % January 2008
+\def\shortciteNP{\shortcite*}
+%\def\shortciteA{\start@cite20}
+\DeclareRobustCommand\shortciteA{\start@cite20} % January 2008
+\def\shortciteANP{\shortciteA*}
+%\def\citeyear{\start@cite30}
+\DeclareRobustCommand\citeyear{\start@cite30} % January 2008
+\def\citeyearNP{\citeyear*}
+%\def\citeN{%
+\DeclareRobustCommand\citeN{% % January 2008
+ \@citeRB
+ \def\citeauthoryear##1##2##3{##1\ [##3%
+ \def\reserved@a{##1}%
+ \def\citeauthoryear####1####2####3{%
+ \def\reserved@b{####1}%
+ \ifx\reserved@a\reserved@b
+ ####3%
+ \else
+ \errmessage{Package acmart Error: author mismatch
+ in \string\citeN^^J^^J%
+ See the acmart package documentation for explanation}%
+ \fi
+ }%
+ }%
+ \@ifstar\@citeyear\@citeyear
+}
+%\def\shortciteN{%
+\DeclareRobustCommand\shortciteN{% % January 2008
+ \@citeRB
+ \def\citeauthoryear##1##2##3{##2\ [##3%
+ \def\reserved@a{##2}%
+ \def\citeauthoryear####1####2####3{%
+ \def\reserved@b{####2}%
+ \ifx\reserved@a\reserved@b
+ ####3%
+ \else
+ \errmessage{Package acmart Error: author mismatch
+ in \string\shortciteN^^J^^J%
+ See the acmart package documentation for explanation}%
+ \fi
+ }%
+ }%
+ \@ifstar\@citeyear\@citeyear % GM July 2000
+}
+
+\def\@citenormal{%
+ \@ifnextchar [{\@tempswatrue\@citex;}%
+% original {\@tempswafalse\@citex,[]}% was ; Gerry 2/24/00
+{\@tempswafalse\@citex[]}% % GERRY FIX FOR BABEL 3/20/2009
+}
+
+\def\@citeyear{%
+ \@ifnextchar [{\@tempswatrue\@citex,}%
+% original {\@tempswafalse\@citex,[]}%
+{\@tempswafalse\@citex[]}% % GERRY FIX FOR BABEL 3/20/2009
+}
+
+\def\@citex#1[#2]#3{%
+ \let\@citea\@empty
+ \@cite{%
+ \@for\@citeb:=#3\do{%
+ \@citea
+% original \def\@citea{#1 }%
+ \def\@citea{#1, }% % GERRY FIX FOR BABEL 3/20/2009 -- SO THAT YOU GET [1, 2] IN THE BODY TEXT
+ \edef\@citeb{\expandafter\@iden\@citeb}%
+ \if@filesw
+ \immediate\write\@auxout{\string\citation{\@citeb}}%
+ \fi
+ \@ifundefined{b@\@citeb}{%
+ {\bf ?}%
+ \@warning{%
+ Citation `\@citeb' on page \thepage\space undefined%
+ }%
+ }%
+ {\csname b@\@citeb\endcsname}%
+ }%
+ }{#2}%
+}
+%\let\@biblabel\@gobble % Dec. 2008 - Gerry
+% ----
+\def\@biblabelnum#1{[#1]} % Gerry's solution #1 - for Natbib -- April 2009
+\let\@biblabel=\@biblabelnum % Gerry's solution #1 - for Natbib -- April 2009
+\def\newblock{\relax} % Gerry Dec. 2008
+% ---
+\newdimen\bibindent
+\setcounter{enumi}{1}
+\bibindent=0em
+\def\thebibliography#1{%
+\ifnum\addauflag=0\addauthorsection\global\addauflag=1\fi
+ \section[References]{% <=== OPTIONAL ARGUMENT ADDED HERE
+ {References} % was uppercased but this affects pdf bookmarks (SP/GM October 2004)
+ {\vskip -9pt plus 1pt} % GM Nov. 2006 / GM July 2000 (for somewhat tighter spacing)
+ \@mkboth{{\refname}}{{\refname}}%
+ }%
+ \list{[\arabic{enumi}]}{%
+ \settowidth\labelwidth{[#1]}%
+ \leftmargin\labelwidth
+ \advance\leftmargin\labelsep
+ \advance\leftmargin\bibindent
+ \parsep=0pt\itemsep=1pt % GM July 2000
+ \itemindent -\bibindent
+ \listparindent \itemindent
+ \usecounter{enumi}
+ }%
+ \let\newblock\@empty
+ \raggedright % GM July 2000
+ \sloppy
+ \sfcode`\.=1000\relax
+}
+
+
+\gdef\balancecolumns
+{\vfill\eject
+\global\@colht=\textheight
+\global\ht\@cclv=\textheight
+}
+
+\newcount\colcntr
+\global\colcntr=0
+%\newbox\savebox
+\newbox\saveb@x % January 2008
+
+\gdef \@makecol {%
+\global\advance\colcntr by 1
+\ifnum\colcntr>2 \global\colcntr=1\fi
+ \ifvoid\footins
+ \setbox\@outputbox \box\@cclv
+ \else
+ \setbox\@outputbox \vbox{%
+\boxmaxdepth \@maxdepth
+ \@tempdima\dp\@cclv
+ \unvbox \@cclv
+ \vskip-\@tempdima
+ \vskip \skip\footins
+ \color@begingroup
+ \normalcolor
+ \footnoterule
+ \unvbox \footins
+ \color@endgroup
+ }%
+ \fi
+ \xdef\@freelist{\@freelist\@midlist}%
+ \global \let \@midlist \@empty
+ \@combinefloats
+ \ifvbox\@kludgeins
+ \@makespecialcolbox
+ \else
+ \setbox\@outputbox \vbox to\@colht {%
+\@texttop
+ \dimen@ \dp\@outputbox
+ \unvbox \@outputbox
+ \vskip -\dimen@
+ \@textbottom
+ }%
+ \fi
+ \global \maxdepth \@maxdepth
+}
+\def\titlenote{\@ifnextchar[\@xtitlenote{\stepcounter\@mpfn
+\global\advance\titlenotecount by 1
+\ifnum\titlenotecount=1
+ \raisebox{9pt}{$\ast$}
+\fi
+\ifnum\titlenotecount=2
+ \raisebox{9pt}{$\dagger$}
+\fi
+\ifnum\titlenotecount=3
+ \raisebox{9pt}{$\ddagger$}
+\fi
+\ifnum\titlenotecount=4
+\raisebox{9pt}{$\S$}
+\fi
+\ifnum\titlenotecount=5
+\raisebox{9pt}{$\P$}
+\fi
+ \@titlenotetext
+}}
+
+\long\def\@titlenotetext#1{\insert\footins{%
+\ifnum\titlenotecount=1\global\tntoks={#1}\fi
+\ifnum\titlenotecount=2\global\tntokstwo={#1}\fi
+\ifnum\titlenotecount=3\global\tntoksthree={#1}\fi
+\ifnum\titlenotecount=4\global\tntoksfour={#1}\fi
+\ifnum\titlenotecount=5\global\tntoksfive={#1}\fi
+ \reset@font\footnotesize
+ \interlinepenalty\interfootnotelinepenalty
+ \splittopskip\footnotesep
+ \splitmaxdepth \dp\strutbox \floatingpenalty \@MM
+ \hsize\columnwidth \@parboxrestore
+ \protected@edef\@currentlabel{%
+ }%
+ \color@begingroup
+ \color@endgroup}}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%
+\ps@plain
+\baselineskip=11pt
+\let\thepage\relax % For NO page numbers - GM Nov. 30th. 1999 and July 2000
+\def\setpagenumber#1{\global\setcounter{page}{#1}}
+%\pagenumbering{arabic} % Arabic page numbers GM July 2000
+\twocolumn % Double column.
+\flushbottom % Even bottom -- alas, does not balance columns at end of document
+\pagestyle{plain}
+
+% Need Copyright Year and Copyright Data to be user definable (in .tex file).
+% Gerry Nov. 30th. 1999
+\newtoks\copyrtyr
+\newtoks\acmcopyr
+\newtoks\boilerplate
+\global\acmcopyr={X-XXXXX-XX-X/XX/XX} % Default - 5/11/2001 *** Gerry
+\global\copyrtyr={20XX} % Default - 3/3/2003 *** Gerry
+\def\CopyrightYear#1{\global\copyrtyr{#1}}
+\def\crdata#1{\global\acmcopyr{#1}}
+\def\permission#1{\global\boilerplate{#1}}
+%
+\global\boilerplate={Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.}
+\newtoks\copyrightetc
+\global\copyrightetc{Copyright \the\copyrtyr\ ACM \the\acmcopyr\ ...\$15.00} % Gerry changed to 15 May 2012
+\toappear{\the\boilerplate\par
+{\confname{\the\conf}} \the\confinfo\par \the\copyrightetc.}
+%\DeclareFixedFont{\altcrnotice}{OT1}{tmr}{m}{n}{8} % << patch needed for accenting e.g. Montreal - Gerry, May 2007
+%\DeclareFixedFont{\altconfname}{OT1}{tmr}{m}{it}{8} % << patch needed for accenting in italicized confname - Gerry, May 2007
+%
+%{\altconfname{{\the\conf}}} {\altcrnotice\the\confinfo\par} \the\copyrightetc.} % << Gerry, May 2007
+%
+% The following section (i.e. 3 .sty inclusions) was added in May 2007 so as to fix the problems that many
+% authors were having with accents. Sometimes accents would occur, but the letter-character would be of a different
+% font. Conversely the letter-character font would be correct but, e.g. a 'bar' would appear superimposed on the
+% character instead of, say, an unlaut/diaresis. Sometimes the letter-character would NOT appear at all.
+% Using [T1]{fontenc} outright was not an option as this caused 99% of the authors to 'produce' a Type-3 (bitmapped)
+% PDF file - useless for production.
+%
+% For proper (font) accenting we NEED these packages to be part of the .cls file i.e. 'ae', 'aecompl' and 'aeguil'
+% ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+%% This is file `ae.sty'
+\def\fileversion{1.3}
+\def\filedate{2001/02/12}
+\NeedsTeXFormat{LaTeX2e}
+%\ProvidesPackage{ae}[\filedate\space\fileversion\space % GM
+% Almost European Computer Modern] % GM - keeping the log file clean(er)
+\newif\if@ae@slides \@ae@slidesfalse
+\DeclareOption{slides}{\@ae@slidestrue}
+\ProcessOptions
+\fontfamily{aer}
+\RequirePackage[T1]{fontenc}
+\if@ae@slides
+ \renewcommand{\sfdefault}{laess}
+ \renewcommand{\rmdefault}{laess} % no roman
+ \renewcommand{\ttdefault}{laett}
+\else
+ \renewcommand{\sfdefault}{aess}
+ \renewcommand{\rmdefault}{aer}
+ \renewcommand{\ttdefault}{aett}
+\fi
+\endinput
+%%
+%% End of file `ae.sty'.
+%
+%
+\def\fileversion{0.9}
+\def\filedate{1998/07/23}
+\NeedsTeXFormat{LaTeX2e}
+%\ProvidesPackage{aecompl}[\filedate\space\fileversion\space % GM
+%T1 Complements for AE fonts (D. Roegel)] % GM -- keeping the log file clean(er)
+
+\def\@ae@compl#1{{\fontencoding{T1}\fontfamily{cmr}\selectfont\symbol{#1}}}
+\def\guillemotleft{\@ae@compl{19}}
+\def\guillemotright{\@ae@compl{20}}
+\def\guilsinglleft{\@ae@compl{14}}
+\def\guilsinglright{\@ae@compl{15}}
+\def\TH{\@ae@compl{222}}
+\def\NG{\@ae@compl{141}}
+\def\ng{\@ae@compl{173}}
+\def\th{\@ae@compl{254}}
+\def\DJ{\@ae@compl{208}}
+\def\dj{\@ae@compl{158}}
+\def\DH{\@ae@compl{208}}
+\def\dh{\@ae@compl{240}}
+\def\@perthousandzero{\@ae@compl{24}}
+\def\textperthousand{\%\@perthousandzero}
+\def\textpertenthousand{\%\@perthousandzero\@perthousandzero}
+\endinput
+%
+%
+%% This is file `aeguill.sty'
+% This file gives french guillemets (and not guillemots!)
+% built with the Polish CMR fonts (default), WNCYR fonts, the LASY fonts
+% or with the EC fonts.
+% This is useful in conjunction with the ae package
+% (this package loads the ae package in case it has not been loaded)
+% and with or without the french(le) package.
+%
+% In order to get the guillemets, it is necessary to either type
+% \guillemotleft and \guillemotright, or to use an 8 bit encoding
+% (such as ISO-Latin1) which selects these two commands,
+% or, if you use the french package (but not the frenchle package),
+% to type << or >>.
+%
+% By default, you get the Polish CMR guillemets; if this package is loaded
+% with the `cm' option, you get the LASY guillemets; with `ec,' you
+% get the EC guillemets, and with `cyr,' you get the cyrillic guillemets.
+%
+% In verbatim mode, you always get the EC/TT guillemets.
+%
+% The default option is interesting in conjunction with PDF,
+% because there is a Type 1 version of the Polish CMR fonts
+% and these guillemets are very close in shape to the EC guillemets.
+% There are no free Type 1 versions of the EC fonts.
+%
+% Support for Polish CMR guillemets was kindly provided by
+% Rolf Niepraschk <niepraschk@ptb.de> in version 0.99 (2000/05/22).
+% Bernd Raichle provided extensive simplifications to the code
+% for version 1.00.
+%
+% This package is released under the LPPL.
+%
+% Changes:
+% Date version
+% 2001/04/12 1.01 the frenchle and french package are now distinguished.
+%
+\def\fileversion{1.01}
+\def\filedate{2001/04/12}
+\NeedsTeXFormat{LaTeX2e}
+%\ProvidesPackage{aeguill}[2001/04/12 1.01 % % GM
+%AE fonts with french guillemets (D. Roegel)] % GM - keeping the log file clean(er)
+%\RequirePackage{ae} % GM May 2007 - already embedded here
+
+\newcommand{\@ae@switch}[4]{#4}
+\DeclareOption{ec}{\renewcommand\@ae@switch[4]{#1}}
+\DeclareOption{cm}{\renewcommand\@ae@switch[4]{#2}}
+\DeclareOption{cyr}{\renewcommand\@ae@switch[4]{#3}}
+\DeclareOption{pl}{\renewcommand\@ae@switch[4]{#4}}
+\ExecuteOptions{pl}
+\ProcessOptions
+
+%
+% Load necessary packages
+%
+\@ae@switch{% ec
+ % do nothing
+}{% cm
+ \RequirePackage{latexsym}% GM - May 2007 - already 'mentioned as required' up above
+}{% cyr
+ \RequirePackage[OT2,T1]{fontenc}%
+}{% pl
+ \RequirePackage[OT4,T1]{fontenc}%
+}
+
+% The following command will be compared to \frenchname,
+% as defined in french.sty and frenchle.sty.
+\def\aeguillfrenchdefault{french}%
+
+\let\guill@verbatim@font\verbatim@font
+\def\verbatim@font{\guill@verbatim@font\ecguills{cmtt}%
+ \let\guillemotleft\@oguills\let\guillemotright\@fguills}
+
+\begingroup \catcode`\<=13 \catcode`\>=13
+\def\x{\endgroup
+ \def\ae@lfguill{<<}%
+ \def\ae@rfguill{>>}%
+}\x
+
+\newcommand{\ecguills}[1]{%
+ \def\selectguillfont{\fontencoding{T1}\fontfamily{#1}\selectfont}%
+ \def\@oguills{{\selectguillfont\symbol{19}}}%
+ \def\@fguills{{\selectguillfont\symbol{20}}}%
+ }
+
+\newcommand{\aeguills}{%
+ \ae@guills
+ % We redefine \guillemotleft and \guillemotright
+ % in order to catch them when they are used
+ % with \DeclareInputText (in latin1.def for instance)
+ % We use \auxWARNINGi as a safe indicator that french.sty is used.
+ \gdef\guillemotleft{\ifx\auxWARNINGi\undefined
+ \@oguills % neither french.sty nor frenchle.sty
+ \else
+ \ifx\aeguillfrenchdefault\frenchname
+ \ae@lfguill % french.sty
+ \else
+ \@oguills % frenchle.sty
+ \fi
+ \fi}%
+ \gdef\guillemotright{\ifx\auxWARNINGi\undefined
+ \@fguills % neither french.sty nor frenchle.sty
+ \else
+ \ifx\aeguillfrenchdefault\frenchname
+ \ae@rfguill % french.sty
+ \else
+ \@fguills % frenchle.sty
+ \fi
+ \fi}%
+ }
+
+%
+% Depending on the class option
+% define the internal command \ae@guills
+\@ae@switch{% ec
+ \newcommand{\ae@guills}{%
+ \ecguills{cmr}}%
+}{% cm
+ \newcommand{\ae@guills}{%
+ \def\selectguillfont{\fontencoding{U}\fontfamily{lasy}%
+ \fontseries{m}\fontshape{n}\selectfont}%
+ \def\@oguills{\leavevmode\nobreak
+ \hbox{\selectguillfont (\kern-.20em(\kern.20em}\nobreak}%
+ \def\@fguills{\leavevmode\nobreak
+ \hbox{\selectguillfont \kern.20em)\kern-.2em)}%
+ \ifdim\fontdimen\@ne\font>\z@\/\fi}}%
+}{% cyr
+ \newcommand{\ae@guills}{%
+ \def\selectguillfont{\fontencoding{OT2}\fontfamily{wncyr}\selectfont}%
+ \def\@oguills{{\selectguillfont\symbol{60}}}%
+ \def\@fguills{{\selectguillfont\symbol{62}}}}
+}{% pl
+ \newcommand{\ae@guills}{%
+ \def\selectguillfont{\fontencoding{OT4}\fontfamily{cmr}\selectfont}%
+ \def\@oguills{{\selectguillfont\symbol{174}}}%
+ \def\@fguills{{\selectguillfont\symbol{175}}}}
+}
+
+
+\AtBeginDocument{%
+ \ifx\GOfrench\undefined
+ \aeguills
+ \else
+ \let\aeguill@GOfrench\GOfrench
+ \gdef\GOfrench{\aeguill@GOfrench \aeguills}%
+ \fi
+ }
+
+\endinput
+%
+
diff --git a/paper/sig-alternate.tex b/paper/sig-alternate.tex new file mode 100644 index 0000000..623b0f9 --- /dev/null +++ b/paper/sig-alternate.tex @@ -0,0 +1,418 @@ +\documentclass{sig-alternate}
+
+\begin{document}
+\conferenceinfo{WOODSTOCK}{'97 El Paso, Texas USA}
+\title{Alternate {\ttlit ACM} SIG Proceedings Paper in LaTeX
+Format\titlenote{(Produces the permission block, and
+copyright information). For use with
+SIG-ALTERNATE.CLS. Supported by ACM.}}
+
+\numberofauthors{2}
+\alignauthor
+Ben Trovato\titlenote{Dr.~Trovato insisted his name be first.}\\
+ \affaddr{Institute for Clarity in Documentation}\\
+ \affaddr{1932 Wallamaloo Lane}\\
+ \affaddr{Wallamaloo, New Zealand}\\
+ \email{trovato@corporation.com}
+\alignauthor
+G.K.M. Tobin\titlenote{The secretary disavows
+any knowledge of this author's actions.}\\
+ \affaddr{Institute for Clarity in Documentation}\\
+ \affaddr{P.O. Box 1212}\\
+ \affaddr{Dublin, Ohio 43017-6221}\\
+ \email{webmaster@marysville-ohio.com}
+}
+\date{30 July 1999}
+
+\maketitle
+\begin{abstract}
+\end{abstract}
+
+\category{H.4}{Information Systems Applications}{Miscellaneous}
+\category{D.2.8}{Software Engineering}{Metrics}[complexity measures, performance measures]
+\terms{Theory}
+\keywords{ACM proceedings, \LaTeX, text tagging}
+
+\section{Introduction}
+The \textit{proceedings} are the records of a conference.
+ACM seeks to give these conference by-products a uniform,
+high-quality appearance. To do this, ACM has some rigid
+requirements for the format of the proceedings documents: there
+is a specified format (balanced double columns), a specified
+set of fonts (Arial or Helvetica and Times Roman) in
+certain specified sizes (for instance, 9 point for body copy),
+a specified live area (18 $\times$ 23.5 cm [7" $\times$ 9.25"]) centered on
+the page, specified size of margins (1.9 cm [0.75"]) top, (2.54 cm [1"]) bottom
+and (1.9 cm [.75"]) left and right; specified column width
+(8.45 cm [3.33"]) and gutter size (.83 cm [.33"]).
+
+The good news is, with only a handful of manual
+settings\footnote{Two of these, the {\texttt{\char'134 numberofauthors}}
+and {\texttt{\char'134 alignauthor}} commands, you have
+already used; another, {\texttt{\char'134 balancecolumns}}, will
+be used in your very last run of \LaTeX\ to ensure
+balanced column heights on the last page.}, the \LaTeX\ document
+class file handles all of this for you.
+
+The remainder of this document is concerned with showing, in
+the context of an ``actual'' document, the \LaTeX\ commands
+specifically available for denoting the structure of a
+proceedings paper, rather than with giving rigorous descriptions
+or explanations of such commands.
+
+\section{The {\secit Body} of The Paper}
+Typically, the body of a paper is organized
+into a hierarchical structure, with numbered or unnumbered
+headings for sections, subsections, sub-subsections, and even
+smaller sections. The command \texttt{{\char'134}section} that
+precedes this paragraph is part of such a
+hierarchy.\footnote{This is the second footnote. It
+starts a series of three footnotes that add nothing
+informational, but just give an idea of how footnotes work
+and look. It is a wordy one, just so you see
+how a longish one plays out.} \LaTeX\ handles the numbering
+and placement of these headings for you, when you use
+the appropriate heading commands around the titles
+of the headings. If you want a sub-subsection or
+smaller part to be unnumbered in your output, simply append an
+asterisk to the command name. Examples of both
+numbered and unnumbered headings will appear throughout the
+balance of this sample document.
+
+Because the entire article is contained in
+the \textbf{document} environment, you can indicate the
+start of a new paragraph with a blank line in your
+input file; that is why this sentence forms a separate paragraph.
+
+\subsection{Type Changes and {\subsecit Special} Characters}
+We have already seen several typeface changes in this sample. You
+can indicate italicized words or phrases in your text with
+the command \texttt{{\char'134}textit}; emboldening with the
+command \texttt{{\char'134}textbf}
+and typewriter-style (for instance, for computer code) with
+\texttt{{\char'134}texttt}. But remember, you do not
+have to indicate typestyle changes when such changes are
+part of the \textit{structural} elements of your
+article; for instance, the heading of this subsection will
+be in a sans serif\footnote{A third footnote, here.
+Let's make this a rather short one to
+see how it looks.} typeface, but that is handled by the
+document class file. Take care with the use
+of\footnote{A fourth, and last, footnote.}
+the curly braces in typeface changes; they mark
+the beginning and end of
+the text that is to be in the different typeface.
+
+You can use whatever symbols, accented characters, or
+non-English characters you need anywhere in your document;
+you can find a complete list of what is
+available in the \textit{\LaTeX\
+User's Guide}\cite{Lamport:LaTeX}.
+
+\subsection{Math Equations}
+You may want to display math equations in three distinct styles:
+inline, numbered or non-numbered display. Each of
+the three are discussed in the next sections.
+
+\subsubsection{Inline (In-text) Equations}
+A formula that appears in the running text is called an
+inline or in-text formula. It is produced by the
+\textbf{math} environment, which can be
+invoked with the usual \texttt{{\char'134}begin. . .{\char'134}end}
+construction or with the short form \texttt{\$. . .\$}. You
+can use any of the symbols and structures,
+from $\alpha$ to $\omega$, available in
+\LaTeX\cite{Lamport:LaTeX}; this section will simply show a
+few examples of in-text equations in context. Notice how
+this equation: \begin{math}\lim_{n\rightarrow \infty}x=0\end{math},
+set here in in-line math style, looks slightly different when
+set in display style. (See next section).
+
+\subsubsection{Display Equations}
+A numbered display equation -- one set off by vertical space
+from the text and centered horizontally -- is produced
+by the \textbf{equation} environment. An unnumbered display
+equation is produced by the \textbf{displaymath} environment.
+
+Again, in either environment, you can use any of the symbols
+and structures available in \LaTeX; this section will just
+give a couple of examples of display equations in context.
+First, consider the equation, shown as an inline equation above:
+\begin{equation}\lim_{n\rightarrow \infty}x=0\end{equation}
+Notice how it is formatted somewhat differently in
+the \textbf{displaymath}
+environment. Now, we'll enter an unnumbered equation:
+\begin{displaymath}\sum_{i=0}^{\infty} x + 1\end{displaymath}
+and follow it with another numbered equation:
+\begin{equation}\sum_{i=0}^{\infty}x_i=\int_{0}^{\pi+2} f\end{equation}
+just to demonstrate \LaTeX's able handling of numbering.
+
+\subsection{Citations}
+Citations to articles \cite{bowman:reasoning,
+clark:pct, braams:babel, herlihy:methodology},
+conference proceedings \cite{clark:pct} or
+books \cite{salas:calculus, Lamport:LaTeX} listed
+in the Bibliography section of your
+article will occur throughout the text of your article.
+You should use BibTeX to automatically produce this bibliography;
+you simply need to insert one of several citation commands with
+a key of the item cited in the proper location in
+the \texttt{.tex} file \cite{Lamport:LaTeX}.
+The key is a short reference you invent to uniquely
+identify each work; in this sample document, the key is
+the first author's surname and a
+word from the title. This identifying key is included
+with each item in the \texttt{.bib} file for your article.
+
+The details of the construction of the \texttt{.bib} file
+are beyond the scope of this sample document, but more
+information can be found in the \textit{Author's Guide},
+and exhaustive details in the \textit{\LaTeX\ User's
+Guide}\cite{Lamport:LaTeX}.
+
+This article shows only the plainest form
+of the citation command, using \texttt{{\char'134}cite}.
+This is what is stipulated in the SIGS style specifications.
+No other citation format is endorsed or supported.
+
+\subsection{Tables}
+Because tables cannot be split across pages, the best
+placement for them is typically the top of the page
+nearest their initial cite. To
+ensure this proper ``floating'' placement of tables, use the
+environment \textbf{table} to enclose the table's contents and
+the table caption. The contents of the table itself must go
+in the \textbf{tabular} environment, to
+be aligned properly in rows and columns, with the desired
+horizontal and vertical rules. Again, detailed instructions
+on \textbf{tabular} material
+is found in the \textit{\LaTeX\ User's Guide}.
+
+Immediately following this sentence is the point at which
+Table 1 is included in the input file; compare the
+placement of the table here with the table in the printed
+dvi output of this document.
+
+\begin{table}
+\centering
+\caption{Frequency of Special Characters}
+\begin{tabular}{|c|c|l|} \hline
+Non-English or Math&Frequency&Comments\\ \hline
+\O & 1 in 1,000& For Swedish names\\ \hline
+$\pi$ & 1 in 5& Common in math\\ \hline
+\$ & 4 in 5 & Used in business\\ \hline
+$\Psi^2_1$ & 1 in 40,000& Unexplained usage\\
+\hline\end{tabular}
+\end{table}
+
+To set a wider table, which takes up the whole width of
+the page's live area, use the environment
+\textbf{table*} to enclose the table's contents and
+the table caption. As with a single-column table, this wide
+table will ``float" to a location deemed more desirable.
+Immediately following this sentence is the point at which
+Table 2 is included in the input file; again, it is
+instructive to compare the placement of the
+table here with the table in the printed dvi
+output of this document.
+
+
+\begin{table*}
+\centering
+\caption{Some Typical Commands}
+\begin{tabular}{|c|c|l|} \hline
+Command&A Number&Comments\\ \hline
+\texttt{{\char'134}alignauthor} & 100& Author alignment\\ \hline
+\texttt{{\char'134}numberofauthors}& 200& Author enumeration\\ \hline
+\texttt{{\char'134}table}& 300 & For tables\\ \hline
+\texttt{{\char'134}table*}& 400& For wider tables\\ \hline\end{tabular}
+\end{table*}
+% end the environment with {table*}, NOTE not {table}!
+
+\subsection{Figures}
+Like tables, figures cannot be split across pages; the
+best placement for them
+is typically the top or the bottom of the page nearest
+their initial cite. To ensure this proper ``floating'' placement
+of figures, use the environment
+\textbf{figure} to enclose the figure and its caption.
+
+This sample document contains examples of \textbf{.eps}
+and \textbf{.ps} files to be displayable with \LaTeX. More
+details on each of these is found in the \textit{Author's Guide}.
+
+
+
+As was the case with tables, you may want a figure
+that spans two columns. To do this, and still to
+ensure proper ``floating'' placement of tables, use the environment
+\textbf{figure*} to enclose the figure and its caption.
+and don't forget to end the environment with
+{figure*}, not {figure}!
+
+
+Note that either {\textbf{.ps}} or {\textbf{.eps}} formats are
+used; use
+the \texttt{{\char'134}epsfig} or \texttt{{\char'134}psfig}
+commands as appropriate for the different file types.
+
+Other common constructs that may occur in your article are
+the forms for logical constructs like theorems, axioms,
+corollaries and proofs. There are
+two forms, one produced by the
+command \texttt{{\char'134}newtheorem} and the
+other by the command \texttt{{\char'134}newdef}; perhaps
+the clearest and easiest way to distinguish them is
+to compare the two in the output of this sample document:
+
+This uses the \textbf{theorem} environment, created by
+the\linebreak\texttt{{\char'134}newtheorem} command:
+\newtheorem{theorem}{Theorem}
+\begin{theorem}
+Let $f$ be continuous on $[a,b]$. If $G$ is
+an antiderivative for $f$ on $[a,b]$, then
+\begin{displaymath}\int^b_af(t)dt = G(b) - G(a).\end{displaymath}
+\end{theorem}
+
+The other uses the \textbf{definition} environment, created
+by the \texttt{{\char'134}newdef} command:
+\newdef{definition}{Definition}
+\begin{definition}
+If $z$ is irrational, then by $e^z$ we mean the
+unique number which has
+logarithm $z$: \begin{displaymath}{\log e^z = z}\end{displaymath}
+\end{definition}
+
+Two lists of constructs that use one of these
+forms is given in the
+\textit{Author's Guidelines}.
+
+There is one other similar construct environment, which is
+already set up
+for you; i.e. you must \textit{not} use
+a \texttt{{\char'134}newdef} command to
+create it: the \textbf{proof} environment. Here
+is a example of its use:
+\begin{proof}
+Suppose on the contrary there exists a real number $L$ such that
+\begin{displaymath}
+\lim_{x\rightarrow\infty} \frac{f(x)}{g(x)} = L.
+\end{displaymath}
+Then
+\begin{displaymath}
+l=\lim_{x\rightarrow c} f(x)
+= \lim_{x\rightarrow c}
+\left[ g{x} \cdot \frac{f(x)}{g(x)} \right ]
+= \lim_{x\rightarrow c} g(x) \cdot \lim_{x\rightarrow c}
+\frac{f(x)}{g(x)} = 0\cdot L = 0,
+\end{displaymath}
+which contradicts our assumption that $l\neq 0$.
+\end{proof}
+
+Complete rules about using these environments and using the
+two different creation commands are in the
+\textit{Author's Guide}; please consult it for more
+detailed instructions. If you need to use another construct,
+not listed therein, which you want to have the same
+formatting as the Theorem
+or the Definition\cite{salas:calculus} shown above,
+use the \texttt{{\char'134}newtheorem} or the
+\texttt{{\char'134}newdef} command,
+respectively, to create it.
+
+\subsection*{A {\secit Caveat} for the \TeX\ Expert}
+Because you have just been given permission to
+use the \texttt{{\char'134}newdef} command to create a
+new form, you might think you can
+use \TeX's \texttt{{\char'134}def} to create a
+new command: \textit{Please refrain from doing this!}
+Remember that your \LaTeX\ source code is primarily intended
+to create camera-ready copy, but may be converted
+to other forms -- e.g. HTML. If you inadvertently omit
+some or all of the \texttt{{\char'134}def}s recompilation will
+be, to say the least, problematic.
+
+\section{Conclusions}
+This paragraph will end the body of this sample document.
+Remember that you might still have Acknowledgments or
+Appendices; brief samples of these
+follow. There is still the Bibliography to deal with; and
+we will make a disclaimer about that here: with the exception
+of the reference to the \LaTeX\ book, the citations in
+this paper are to articles which have nothing to
+do with the present subject and are used as
+examples only.
+%\end{document} % This is where a 'short' article might terminate
+
+%ACKNOWLEDGMENTS are optional
+\section{Acknowledgments}
+This section is optional; it is a location for you
+to acknowledge grants, funding, editing assistance and
+what have you. In the present case, for example, the
+authors would like to thank Gerald Murray of ACM for
+his help in codifying this \textit{Author's Guide}
+and the \textbf{.cls} and \textbf{.tex} files that it describes.
+
+%
+% The following two commands are all you need in the
+% initial runs of your .tex file to
+% produce the bibliography for the citations in your paper.
+\bibliographystyle{abbrv}
+\bibliography{sigproc} % sigproc.bib is the name of the Bibliography in this case
+% You must have a proper ".bib" file
+% and remember to run:
+% latex bibtex latex latex
+% to resolve all references
+%
+% ACM needs 'a single self-contained file'!
+%
+%APPENDICES are optional
+%\balancecolumns
+\appendix
+%Appendix A
+\section{Headings in Appendices}
+The rules about hierarchical headings discussed above for
+the body of the article are different in the appendices.
+In the \textbf{appendix} environment, the command
+\textbf{section} is used to
+indicate the start of each Appendix, with alphabetic order
+designation (i.e. the first is A, the second B, etc.) and
+a title (if you include one). So, if you need
+hierarchical structure
+\textit{within} an Appendix, start with \textbf{subsection} as the
+highest level. Here is an outline of the body of this
+document in Appendix-appropriate form:
+\subsection{Introduction}
+\subsection{The Body of the Paper}
+\subsubsection{Type Changes and Special Characters}
+\subsubsection{Math Equations}
+\paragraph{Inline (In-text) Equations}
+\paragraph{Display Equations}
+\subsubsection{Citations}
+\subsubsection{Tables}
+\subsubsection{Figures}
+\subsubsection{Theorem-like Constructs}
+\subsubsection*{A Caveat for the \TeX\ Expert}
+\subsection{Conclusions}
+\subsection{Acknowledgments}
+\subsection{Additional Authors}
+This section is inserted by \LaTeX; you do not insert it.
+You just add the names and information in the
+\texttt{{\char'134}additionalauthors} command at the start
+of the document.
+\subsection{References}
+Generated by bibtex from your ~.bib file. Run latex,
+then bibtex, then latex twice (to resolve references)
+to create the ~.bbl file. Insert that ~.bbl file into
+the .tex source file and comment out
+the command \texttt{{\char'134}thebibliography}.
+% This next section command marks the start of
+% Appendix B, and does not continue the present hierarchy
+\section{More Help for the Hardy}
+The sig-alternate.cls file itself is chock-full of succinct
+and helpful comments. If you consider yourself a moderately
+experienced to expert user of \LaTeX, you may find reading
+it useful but please remember not to change it.
+%\balancecolumns % GM June 2007
+% That's all folks!
+\end{document}
diff --git a/paper/sigproc.bib b/paper/sigproc.bib new file mode 100644 index 0000000..df5b8bc --- /dev/null +++ b/paper/sigproc.bib @@ -0,0 +1,59 @@ +@ARTICLE{bowman:reasoning,
+ AUTHOR = "Mic Bowman and Saumya K. Debray and Larry L. Peterson",
+ TITLE = "Reasoning About Naming Systems",
+ JOURNAL = "ACM Trans. Program. Lang. Syst.",
+ VOLUME = {15},
+ NUMBER = {5},
+ PAGES = {795-825},
+ MONTH = "November",
+ YEAR = {1993} }
+
+@ARTICLE{braams:babel,
+ AUTHOR = "Johannes Braams",
+ TITLE = "Babel, a Multilingual Style-Option System for Use with LaTeX's Standard Document Styles",
+ JOURNAL = {TUGboat},
+ VOLUME = {12},
+ NUMBER = {2},
+ PAGES = {291-301},
+ MONTH = "June",
+ YEAR = {1991} }
+
+@INPROCEEDINGS{clark:pct,
+ AUTHOR = "Malcolm Clark",
+ TITLE = "Post Congress Tristesse",
+ BOOKTITLE = "TeX90 Conference Proceedings",
+ PAGES = "84-89",
+ ORGANIZATION = "TeX Users Group",
+ MONTH = "March",
+ YEAR = {1991} }
+
+@ARTICLE{herlihy:methodology,
+ AUTHOR = "Maurice Herlihy",
+ TITLE = "A Methodology for Implementing Highly Concurrent
+ Data Objects",
+ JOURNAL = {ACM Trans. Program. Lang. Syst.},
+ VOLUME = {15},
+ NUMBER = {5},
+ PAGES = {745-770},
+ MONTH = "November",
+ YEAR = {1993} }
+
+@BOOK{Lamport:LaTeX,
+ AUTHOR = "Leslie Lamport",
+ TITLE = "LaTeX User's Guide and Document Reference Manual",
+ PUBLISHER = "Addison-Wesley Publishing Company",
+ ADDRESS = "Reading, Massachusetts",
+ YEAR = "1986" }
+
+@BOOK{salas:calculus,
+ AUTHOR = "S.L. Salas and Einar Hille",
+ TITLE = "Calculus: One and Several Variable",
+ PUBLISHER = "John Wiley and Sons",
+ ADDRESS = "New York",
+ YEAR = "1978" }
+
+
+
+
+
+
|
