This book explores the view that normative behaviour is part of a complex of social mechanisms, processes and narratives that are constantly shifting. From this perspective, norms are not a kind of self-contained social object or fact, but rather an interplay of many things that we label as norms when we ‘take a snapshot’ of them at a particular instant. Further, this book pursues the hypothesis that considering the dynamic aspects of these phenomena sheds new light on them. The sort of issues that this perspective opens to exploration include: Of what is this complex we call a "social norm" composed of? How do new social norms emerge and what kind of circumstances might facilitate such an appearance? How context-specific are the norms and patterns of normative behaviour that arise? How do the cognitive and the social aspects of norms interact over time? How do expectations, beliefs and individual rationality interact with social norm complexes to effect behaviour? How does our social embeddedness relate to social constraint upon behaviour? How might the socio-cognitive complexes that we call norms be usefully researched?

In recent years, auctions have become an important field and many markets have designed new and sophisticated auction models to assign different types of items. The prime goal of this book is to set an organized classification of the main auction mechanisms in a way that readers can understand the importance of auction design and the advantages and drawbacks of each model. Given the relevance of the subject, there is a great volume of research about this topic. Nevertheless, most of these contributions use complex mathematical language difficult to understand for the average reader. In this book, the authors summarize the main ideas of the auction theory and explain them with simple language and plenty of examples. This book is a good starting point for any researcher interested in embracing the auction design as it also includes numerous real-world examples to engage the reader in the topic. “This book fills an important gap by making the main ideas and findings of auction research accessible.� Professor Paul Milgrom, Department of Economics, Stanford University.

This book, based on a selection of talks given at a dedicated meeting in Cortona, Italy, in June 2013, shows the high degree of interaction between a number of fields related to applied sciences. Applied sciences consider situations in which the evolution of a given system over time is observed, and the related models can be formulated in terms of evolution equations (EEs). These equations have been studied intensively in theoretical research and are the source of an enormous number of applications. In this volume, particular attention is given to direct, inverse and control problems for EEs. The book provides an updated overview of the field, revealing its richness and vitality.

This collection of essays honouring Dan Felsenthal and Moshe Machover reconsiders foundational aspects of the measurement of voting power. The specific case of voting power in two-tier systems - for instance the US system and the EU system - is analysed. Furthermore major power indices - Penrose, Banzhaf, Shapley-Shubik and others are revisited. The book proposes new voting procedures and studies well-known procedures and/or apportionment methods either from a technical or historical point of view.

This book contains state-of-the-art contributions in the field of evolutionary and deterministic methods for design, optimization and control in engineering and sciences. Specialists have written each of the 34 chapters as extended versions of selected papers presented at the International Conference on Evolutionary and Deterministic Methods for Design, Optimization and Control with Applications to Industrial and Societal Problems (EUROGEN 2013). The conference was one of the Thematic Conferences of the European Community on Computational Methods in Applied Sciences (ECCOMAS). Topics treated in the various chapters are classified in the following sections: theoretical and numerical methods and tools for optimization (theoretical methods and tools; numerical methods and tools) and engineering design and societal applications (turbo machinery; structures, materials and civil engineering; aeronautics and astronautics; societal applications; electrical and electronics applications), focused particularly on intelligent systems for multidisciplinary design optimization (mdo) problems based on multi-hybridized software, adjoint-based and one-shot methods, uncertainty quantification and optimization, multidisciplinary design optimization, applications of game theory to industrial optimization problems, applications in structural and civil engineering optimum design and surrogate models based optimization methods in aerodynamic design.

This book integrates multiple criteria concepts and methods for problems within the Risk, Reliability and Maintenance (RRM) context. The concepts and foundations related to RRM are considered for this integration with multicriteria approaches. In the book, a general framework for building decision models is presented and this is illustrated in various chapters by discussing many different decision models related to the RRM context. The scope of the book is related to ways of how to integrate Applied Probability and Decision Making. In Applied Probability, this mainly includes: decision analysis and reliability theory, amongst other topics closely related to risk analysis and maintenance. In Decision Making, it includes a broad range of topics in MCDM (Multi-Criteria Decision Making) and MCDA (Multi-Criteria Decision Aiding; also known as Multi-Criteria Decision Analysis). In addition to decision analysis, some of the topics related to Mathematical Programming area are briefly considered, such as multiobjective optimization, since methods related to these topics have been applied to the context of RRM. The book addresses an innovative treatment for the decision making in RRM, thereby improving the integration of fundamental concepts from the areas of both RRM and decision making. This is accomplished by presenting an overview of the literature on decision making in RRM. Some pitfalls of decision models when applying them to RRM in practice are discussed and guidance on overcoming these drawbacks is offered. The procedure enables multicriteria models to be built for the RRM context, including guidance on choosing an appropriate multicriteria method for a particular problem faced in the RRM context. The book also includes many research advances in these topics. Most of the multicriteria decision models that are described are specific applications that have been influenced by this research and the advances in this field. Multicriteria and Multiobjective Models for Risk, Reliability and Maintenance Decision Analysis is implicitly structured in three parts, with 12 chapters. The first part deals with MCDM/A concepts methods and decision processes. The second part presents the main concepts and foundations of RRM. Finally the third part deals with specific decision problems in the RRM context approached with MCDM/A models.

This book presents comprehensive state-of-the-art theoretical analysis of the fundamental Newtonian and Newtonian-related approaches to solving optimization and variational problems. A central focus is the relationship between the basic Newton scheme for a given problem and algorithms that also enjoy fast local convergence. The authors develop general perturbed Newtonian frameworks that preserve fast convergence and consider specific algorithms as particular cases within those frameworks, i.e., as perturbations of the associated basic Newton iterations. This approach yields a set of tools for the unified treatment of various algorithms, including some not of the Newton type per se. Among the new subjects addressed is the class of degenerate problems. In particular, the phenomenon of attraction of Newton iterates to critical Lagrange multipliers and its consequences as well as stabilized Newton methods for variational problems and stabilized sequential quadratic programming for optimization. This volume will be useful to researchers and graduate students in the fields of optimization and variational analysis.

This monograph presents a comprehensive study of portfolio optimization, an important area of quantitative finance. Considering that the information available in financial markets is incomplete and that the markets are affected by vagueness and ambiguity, the monograph deals with fuzzy portfolio optimization models. At first, the book makes the reader familiar with basic concepts, including the classical mean–variance portfolio analysis. Then, it introduces advanced optimization techniques and applies them for the development of various multi-criteria portfolio optimization models in an uncertain environment. The models are developed considering both the financial and non-financial criteria of investment decision making, and the inputs from the investment experts. The utility of these models in practice is then demonstrated using numerical illustrations based on real-world data, which were collected from one of the premier stock exchanges in India. The book addresses both academics and professionals pursuing advanced research and/or engaged in practical issues in the rapidly evolving field of portfolio optimization.  

This book presents the basics of linear and nonlinear optimization analysis for both single and multi-objective problems in hydrosystem engineering.  The book includes several examples with various levels of complexity in different fields of water resources engineering. The examples are solved step by step to assist the reader and to make it easier to understand the concepts. In addition, the latest tools and methods are presented to help students, researchers, engineers and water managers to properly conceptualize and formulate resource allocation problems, and to deal with the complexity of constraints in water demand and available supplies in an appropriate way.

This book provides an introduction to vector optimization with variable ordering structures, i.e., to optimization problems with a vector-valued objective function where the elements in the objective space are compared based on a variable ordering structure: instead of a partial ordering defined by a convex cone, we see a whole family of convex cones, one attached to each element of the objective space. The book starts by presenting several applications that have recently sparked new interest in these optimization problems, and goes on to discuss fundamentals and important results on a wide range of topics. The theory developed includes various optimality notions, linear and nonlinear scalarization functionals, optimality conditions of Fermat and Lagrange type, existence and duality results. The book closes with a collection of numerical approaches for solving these problems in practice.

Networks and Network Analysis for Defence and Security discusses relevant theoretical frameworks and applications of network analysis in support of the defence and security domains. This book details real world applications of network analysis to support defence and security. Shocks to regional, national and global systems stemming from natural hazards, acts of armed violence, terrorism and serious and organized crime have significant defence and security implications. Today, nations face an uncertain and complex security landscape in which threats impact/target the physical, social, economic and cyber domains. Threats to national security, such as that against critical infrastructures not only stem from man-made acts but also from natural hazards. Katrina (2005), Fukushima (2011) and Hurricane Sandy (2012) are examples highlighting the vulnerability of critical infrastructures to natural hazards and the crippling effect they have on the social and economic well-being of a community and a nation. With this dynamic and complex threat landscape, network analysis has emerged as a key enabler in supporting defence and security. With the advent of ‘big data’ and increasing processing power, network analysis can reveal insights with regards to structural and dynamic properties thereby facilitating greater understanding of complex networks, their entities, interdependencies, vulnerabilities to produce insights for creative solutions. This book will be well positioned to inform defence, security and intelligence professionals and researchers with regards to leading methodologies and approaches.

This volume contains two types of papers-a selection of contributions from the "Second International Conference in Network Analysis" held in Nizhny Novgorod on May 7-9, 2012, and papers submitted to an "open call for papers" reflecting the activities of LATNA at the Higher School for Economics. This volume contains many new results in modeling and powerful algorithmic solutions applied to problems in * vehicle routing * single machine scheduling * modern financial markets * cell formation in group technology * brain activities of left- and right-handers * speeding up algorithms for the maximum clique problem * analysis and applications of different measures in clustering The broad range of applications that can be described and analyzed by means of a network brings together researchers, practitioners, and other scientific communities from numerous fields such as Operations Research, Computer Science, Transportation, Energy, Social Sciences, and more. The contributions not only come from different fields, but also cover a broad range of topics relevant to the theory and practice of network analysis. Researchers, students, and engineers from various disciplines will benefit from the state-of-the-art in models, algorithms, technologies, and techniques presented.

This present book provides an alternative approach to study the pre-kernel solution of transferable utility games based on a generalized conjugation theory from convex analysis. Although the pre-kernel solution possesses an appealing axiomatic foundation that lets one consider this solution concept as a standard of fairness, the pre-kernel and its related solutions are regarded as obscure and too technically complex to be treated as a real alternative to the Shapley value. Comprehensible and efficient computability is widely regarded as a desirable feature to qualify a solution concept apart from its axiomatic foundation as a standard of fairness. We review and then improve an approach to compute the pre-kernel of a cooperative game by the indirect function. The indirect function is known as the Fenchel-Moreau conjugation of the characteristic function. Extending the approach with the indirect function, we are able to characterize the pre-kernel of the grand coalition simply by the solution sets of a family of quadratic objective functions.

This book reports the latest findings on intelligent energy management of Internet data centers in smart-grid environments. The book gathers novel research ideas in Internet data center energy management, especially scenarios with cyber-related vulnerabilities, power outages and carbon emission constraints. The book will be of interest to university researchers, R&D engineers and graduate students in communication and networking areas who wish to learn the core principles, methods, algorithms, and applications of energy management of Internet data centers in smart grids.

The purpose of this contributed volume is to provide a primary resource for anyone interested in fixed point theory with a metric flavor. The book presents information for those wishing to find results that might apply to their own work and for those wishing to obtain a deeper understanding of the theory. The book should be of interest to a wide range of researchers in mathematical analysis as well as to those whose primary interest is the study of fixed point theory and the underlying spaces. The level of exposition is directed to a wide audience, including students and established researchers. Key topics covered include Banach contraction theorem, hyperconvex metric spaces, modular function spaces, fixed point theory in ordered sets, topological fixed point theory for set-valued maps, coincidence theorems, Lefschetz and Nielsen theories, systems of nonlinear inequalities, iterative methods for fixed point problems, and the Ekeland's variational principle.

This volume compiles the major results of conference participants from the "Third International Conference in Network Analysis" held at the Higher School of Economics, Nizhny Novgorod in May 2013, with the aim to initiate further joint research among different groups. The contributions in this book cover a broad range of topics relevant to the theory and practice of network analysis, including the reliability of complex networks, software, theory, methodology, and applications. Network analysis has become a major research topic over the last several years. The broad range of applications that can be described and analyzed by means of a network has brought together researchers, practitioners from numerous fields such as operations research, computer science, transportation, energy, biomedicine, computational neuroscience and social sciences. In addition, new approaches and computer environments such as parallel computing, grid computing, cloud computing, and quantum computing have helped to solve large scale network optimization problems.

Two prisoners are told that they will be brought to a room and seated so that each can see the other. Hats will be placed on their heads; each hat is either red or green. The two prisoners must simultaneously submit a guess of their own hat color, and they both go free if at least one of them guesses correctly. While no communication is allowed once the hats have been placed, they will, however, be allowed to have a strategy session before being brought to the room. Is there a strategy ensuring their release? The answer turns out to be yes, and this is the simplest non-trivial example of a "hat problem." This book deals with the question of how successfully one can predict the value of an arbitrary function at one or more points of its domain based on some knowledge of its values at other points. Topics range from hat problems that are accessible to everyone willing to think hard, to some advanced topics in set theory and infinitary combinatorics. For example, there is a method of predicting the value f(a) of a function f mapping the reals to the reals, based only on knowledge of f's values on the open interval (a - 1, a), and for every such function the prediction is incorrect only on a countable set that is nowhere dense. The monograph progresses from topics requiring fewer prerequisites to those requiring more, with most of the text being accessible to any graduate student in mathematics. The broad range of readership includes researchers, postdocs, and graduate students in the fields of set theory, mathematical logic, and combinatorics. The hope is that this book will bring together mathematicians from different areas to think about set theory via a very broad array of coordinated inference problems.

This book presents a modular and expandable technique in the rapidly emerging research area of automatic configuration and selection of the best algorithm for the instance at hand. The author presents the basic model behind ISAC and then details a number of modifications and practical applications. In particular, he addresses automated feature generation, offline algorithm configuration for portfolio generation, algorithm selection, adaptive solvers, online tuning, and parallelization. The author's related thesis was honorably mentioned (runner-up) for the ACP Dissertation Award in 2014, and this book includes some expanded sections and notes on recent developments. Additionally, the techniques described in this book have been successfully applied to a number of solvers competing in the SAT and MaxSAT International Competitions, winning a total of 18 gold medals between 2011 and 2014. The book will be of interest to researchers and practitioners in artificial intelligence, in particular in the area of machine learning and constraint programming.

Martin Groetschel is one of the most influential mathematicians of our time. He has received numerous honors and holds a number of key positions in the international mathematical community. He celebrated his 65th birthday on September 10, 2013. Martin Groetschel's doctoral descendant tree 1983-2012, i.e., the first 30 years, features 39 children, 74 grandchildren, 24 great-grandchildren and 2 great-great-grandchildren, a total of 139 doctoral descendants. This book starts with a personal tribute to Martin Groetschel by the editors (Part I), a contribution by his very special "predecessor" Manfred Padberg on "Facets and Rank of Integer Polyhedra" (Part II), and the doctoral descendant tree 1983-2012 (Part III). The core of this book (Part IV) contains 16 contributions, each of which is coauthored by at least one doctoral descendant. The sequence of the articles starts with contributions to the theory of mathematical optimization, including polyhedral combinatorics, extended formulations, mixed-integer convex optimization, super classes of perfect graphs, efficient algorithms for subtree-telecenters, junctions in acyclic graphs and preemptive restricted strip covering, as well as efficient approximation of non-preemptive restricted strip covering. Combinations of new theoretical insights with algorithms and experiments deal with network design problems, combinatorial optimization problems with submodular objective functions and more general mixed-integer nonlinear optimization problems. Applications include VLSI layout design, systems biology, wireless network design, mean-risk optimization and gas network optimization. Computational studies include a semidefinite branch and cut approach for the max k-cut problem, mixed-integer nonlinear optimal control, and mixed-integer linear optimization for scheduling and routing of fly-in safari planes. The two closing articles are devoted to computational advances in general mixed integer linear optimization, the first by scientists working in industry, the second by scientists working in academia. These articles reflect the "scientific facets" of Martin Groetschel who has set standards in theory, computation and applications.

Networks of Echoes: Imitation, Innovation and Invisible Leaders is a mathematically rigorous and data rich book on a fascinating area of the science and engineering of social webs. There are hundreds of complex network phenomena whose statistical properties are described by inverse power laws. The phenomena of interest are not arcane events that we encounter only fleetingly, but are events that dominate our lives. We examine how this intermittent statistical behavior intertwines itself with what appears to be the organized activity of social groups. The book is structured as answers to a sequence of questions such as: How are decisions reached in elections and boardrooms? How is the stability of a society undermined by zealots and committed minorities and how is that stability re-established? Can we learn to answer such questions about human behavior by studying the way flocks of birds retain their formation when eluding a predator? These questions and others are answered using a generic model of a complex dynamic network-one whose global behavior is determined by a symmetric interaction among individuals based on social imitation. The complexity of the network is manifest in time series resulting from self-organized critical dynamics that have divergent first and second moments, are non-stationary, non-ergodic and non-Poisson. How phase transitions in the network dynamics influence such activity as decision making is a fascinating story and provides a context for introducing many of the mathematical ideas necessary for understanding complex networks in general. The decision making model (DMM) is selected to emphasize that there are features of complex webs that supersede specific mechanisms and need to be understood from a general perspective. This insightful overview of recent tools and their uses may serve as an introduction and curriculum guide in related courses.

Economists can use computer algebra systems to manipulate symbolic models, derive numerical computations, and analyze empirical relationships among variables. Maxima is an open-source multi-platform computer algebra system that rivals proprietary software. Maxima's symbolic and computational capabilities enable economists and financial analysts to develop a deeper understanding of models by allowing them to explore the implications of differences in parameter values, providing numerical solutions to problems that would be otherwise intractable, and by providing graphical representations that can guide analysis. This book provides a step-by-step tutorial for using this program to examine the economic relationships that form the core of microeconomics in a way that complements traditional modeling techniques. Readers learn how to phrase the relevant analysis and how symbolic expressions, numerical computations, and graphical representations can be used to learn from microeconomic models. In particular, comparative statics analysis is facilitated. Little has been published on Maxima and its applications in economics and finance, and this volume will appeal to advanced undergraduates, graduate-level students studying microeconomics, academic researchers in economics and finance, economists, and financial analysts.

This book surveys key algorithm developments between 1990 and 2012, with brief descriptions, a unified pseudocode for each algorithm and downloadable program code. Provides a taxonomy to clarify similarities and differences as well as historical relationships.

Metaheuristics, and evolutionary algorithms in particular, are known to provide efficient, adaptable solutions for many real-world problems, but the often informal way in which they are defined and applied has led to misconceptions, and even successful applications are sometimes the outcome of trial and error. Ideally, theoretical studies should explain when and why metaheuristics work, but the challenge is huge: mathematical analysis requires significant effort even for simple scenarios and real-life problems are usually quite complex. In this book the editors establish a bridge between theory and practice, presenting principled methods that incorporate problem knowledge in evolutionary algorithms and other metaheuristics. The book consists of 11 chapters dealing with the following topics: theoretical results that show what is not possible, an assessment of unsuccessful lines of empirical research; methods for rigorously defining the appropriate scope of problems while acknowledging the compromise between the class of problems to which a search algorithm is applied and its overall expected performance; the top-down principled design of search algorithms, in particular showing that it is possible to design algorithms that are provably good for some rigorously defined classes; and, finally, principled practice, that is reasoned and systematic approaches to setting up experiments, metaheuristic adaptation to specific problems, and setting parameters. With contributions by some of the leading researchers in this domain, this book will be of significant value to scientists, practitioners, and graduate students in the areas of evolutionary computing, metaheuristics, and computational intelligence.

The book presents, in a systematic manner, the optimal controls under different mathematical models in fermentation processes. Variant mathematical models - i.e., those for multistage systems; switched autonomous systems; time-dependent and state-dependent switched systems; multistage time-delay systems and switched time-delay systems - for fed-batch fermentation processes are proposed and the theories and algorithms of their optimal control problems are studied and discussed. By putting forward novel methods and innovative tools, the book provides a state-of-the-art and comprehensive systematic treatment of optimal control problems arising in fermentation processes. It not only develops nonlinear dynamical system, optimal control theory and optimization algorithms, but can also help to increase productivity and provide valuable reference material on commercial fermentation processes.

This contributed volume focuses on aspects of dynamic game theory including differential games, evolutionary games, and stochastic games. It covers theoretical developments, algorithmic methods, and applications to fields as varied as mathematical biology, environmental management, economics, engineering, guidance and control, and social interaction. It will be of interest to an interdisciplinary audience of researchers, practitioners, and advanced graduate students. Advances in Dynamic Games presents state-of-the-art research that serves as a testament to the vitality and growth of the field of dynamic games and their applications. Its contributions, written by experts in their respective disciplines, are outgrowths of presentations originally given at the 15th International Symposium of Dynamic Games and Applications held July 19-22, 2012, in Bysice, Czech Republic.