To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We are living through an era of unprecedented data-driven regulatory transformation. AI and algorithmic governance are rapidly altering how global problems are known and governed, and reconfiguring how people, places, and things are drawn into legal relation across diverse areas - from labour, media and communications, and global mobilities to environmental governance, security, and war. These changes are fostering new forms of power, inequality, and violence, and posing urgent conceptual and methodological challenges for law and technology research. Global Governance by Data: Infrastructures of Algorithmic Rule brings together leading interdisciplinary scholars working at the forefront of creative thinking and research practice in this area. The book offers fresh takes on the prospects for working collectively to critique and renew those legal and technological infrastructures that order, divide, empower and immiserate across our data-driven world. This title is also available as open access on Cambridge Core.
Over the past few decades, graph theory has developed into one of the central areas of modern mathematics, with close (and growing) connections to areas of pure mathematics such as number theory, probability theory, algebra and geometry, as well as to applied areas such as the theory of networks, machine learning, statistical physics, and biology. It is a young and vibrant area, with several major breakthroughs having occurred in just the past few years. This book offers the reader a gentle introduction to the fundamental concepts and techniques of graph theory, covering classical topics such as matchings, colourings and connectivity, alongside the modern and vibrant areas of extremal graph theory, Ramsey theory, and random graphs. The focus throughout is on beautiful questions, ideas and proofs, and on illustrating simple but powerful techniques, such as the probabilistic method, that should be part of every young mathematician's toolkit.
This book presents a modern introduction to the field of algorithmic game theory. It places a heavy emphasis on optimization and online learning (a subdiscipline of machine learning), which are tools that increasingly play a central role in both the theory and practice of applying game-theoretic ideas. The book covers the core techniques used in several majorly successful applications, including techniques used for creating superhuman poker AIs, the theory behind the 'pacing' methodology that has become standard in the internet advertising industry, and the application of competitive equilibrium from equal incomes for fair course seat allocation in many business schools. With its focus on online learning tools, this book is an ideal companion to classic texts on algorithmic game theory for graduate students and researchers.
Providing a cohesive reference for advanced undergraduates, graduate students and even experienced researchers, this text contains both introductory and advanced material in extremal graph theory, hypergraph theory and Ramsey theory. Along the way, the book includes many modern proof techniques in the field such as the probabilistic method and algebraic methods. Several recent breakthroughs are presented with complete proofs, for example, recent results on the sunflower problem, and off-diagonal and geometric Ramsey theory. It is perhaps unique in containing material on both hypergraph regularity and containers. Featuring an extensive list of exercises, the text is suitable as a teaching text for a variety of courses in extremal combinatorics. Each of the two parts can form the basis of separate courses, and the majority of sections are designed to match the length of a single lecture.
Aimed at advanced undergraduate and graduate-level students, this textbook covers the core topics of quantum computing in a format designed for a single-semester course. It will be accessible to learners from a range of disciplines, with an understanding of linear algebra being the primary prerequisite. The textbook introduces central concepts such as quantum mechanics, the quantum circuit model, and quantum algorithms, and covers advanced subjects such as the surface code and topological quantum computation. These topics are essential for understanding the role of symmetries in error correction and the stability of quantum architectures, which situate quantum computation within the wider realm of theoretical physics. Graphical representations and exercises are included throughout the book and optional expanded materials are summarized within boxed 'Remarks'. Lecture notes have been made freely available for download from the textbook's webpage, with instructors having additional online access to selected exercise solutions.