This book constitutes the refereed proceedings of the 5th International Workshop on Internet and Network Economics, WINE 2009, held in Rome, Italy, in December 2009.

The 34 regular and 29 short revised full papers presented together with 3 invited talks were carefully reviewed and selected from 142 submissions. The papers address various topics in theoretical computer science, networking and security, economics, mathematics, sociology, and management sciences devoted to the analysis of problems arising in the internet and the worldwide Web, such as auction algorithms, computational advertising, general and majority equilibrium, coalitions, collective action, economics aspects of security and privacy in distributed and network computing, algorithmic design and game theory, information economics, network games, price dynamics, and social networks.

This volume contains the 75 contributed papers and the abstracts of the three invited lectures presented at the 13th Annual European Symposium on Al- rithms (ESA 2005), held in Palma de Mallorca, Spain, October 3-6, 2005. The threedistinguishedinvitedspeakerswereGiuseppeF.Italiano,CristopherMoore and Joseph (Se?) Naor. Since 2002,ESA has consisted of two tracks, with separate programcomm- tees, which dealt respectively with - the designandmathematicalanalysis ofalgorithms(the "DesignandAna- sis" track); - real-worldapplications, engineering and experimental analysis of algorithms (the "Engineering and Applications" track). Previous ESAs in the current two track format were held in Rome, Italy (2002);Budapest,Hungary(2003);andBergen,Norway(2004).Theproceedings of these symposia were published as Springer's LNCS volumes 2461, 2832, and 3221 respectively. Papers were solicited in all areas of algorithmic research, including but not limited to algorithmic aspects of networks, approximation and on-line al- rithms, computational biology, computational geometry, computational ?nance and algorithmic game theory, data structures, database and information - trieval, external memory algorithms, graph algorithms, graph drawing, machine learning, mobile computing, pattern matching and data compression, quantum computing, and randomized algorithms. The algorithms could be sequential, distributed, or parallel. Submissions were especially encouraged in the area of mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics, and semide?nite programming.

Information systems can be complex due to numerous factors including scale, decentralization, heterogeneity, mobility, dynamism, bugs and failures. Depl- ing, operating and maintaining such systems can be not only very di?cult, but also very costly. A ?urry of recent activity has been directed at this pr- lem, and future information systems are envisioned as self-con?guring, se- organizing, self-managingandself-repairing.Collectively, wecalltheseproperties self- properties. This book is a "spin-o?" of a by-invitation-only Bertinoro workshop on se- propertiesincomplexsystemswhichwasheldinsummer2004inBertinoro, Italy. The Self-star workshop brought together researchers and practitioners from d- ferent disciplines and with di?erent backgrounds to discuss complex information systems.Thethemeoftheworkshopwastoidentifytheconceptualandpractical foundationsformodeling, analyzingandachievingself- propertiesindistributed and networked systems. Partly based on these discussions, we solicited papers from the workshop participants and a set of invitees for this book. We sought original contributions in which authors explicitly take a position concerningrequirements, usefulness, potentialandlimitations oftechnologies for self- properties of complex systems. This position needed to be founded on - search results that were put clearly in context with respect to the position sta- ment. We strongly encouraged visionary statements, thought-provoking ideas, and exploratory results that will help the reader form her or his own opinions on the importance of self- properties in current and future complex information systems.

This volume contains the 14 contributed papers and the contribution of the distinguished invited speaker B ela Bollob as presented at the 3rd Workshop on Algorithms and Models for the Web-Graph (WAW 2004), held in Rome, Italy, October 16, 2004, in conjunction with the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004). The World Wide Web has become part of our everyday life and information retrievalanddataminingontheWebisnowofenormouspracticalinterest.Some of the algorithms supporting these activities are based substantially on viewing the Web as a graph, induced in various ways by links among pages, links among hosts, or other similar networks. Theaimofthe2004WorkshoponAlgorithmsandModelsfortheWeb-Graph was to further the understanding of these Web-induced graphs, and stimulate the development of high-performance algorithms and applications that use the graphstructureoftheWeb.Theworkshopwasmeantbothtofosteranexchange of ideas among the diverse set of researchers already involved in this topic, and to act as an introduction for the larger community to the state of the art in this area. This was the third edition of a very successful workshop on this topic, WAW 2002 was held in Vancouver, Canada, in conjunction with the 43rd - nual IEEE Symposium on Foundations of Computer Science, FOCS 2002, and WAW 2003 was held in Budapest, Hungary, in conjunction with the 12th Int- national World Wide Web Conference, WWW 2003. This was the ?rst edition of the workshop with formal proceedings."

This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002.The 20 revised full papers presented were carefully reviewed and selected from 54 submissions. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and other fields.