Game theory | Mechanism design | Algorithms
Algorithmic mechanism design (AMD) lies at the intersection of economic game theory, optimization, and computer science. The prototypical problem in mechanism design is to design a system for multiple self-interested participants, such that the participants' self-interested actions at equilibrium lead to good system performance. Typical objectives studied include revenue maximization and social welfare maximization. Algorithmic mechanism design differs from classical economic mechanism design in several respects. It typically employs the analytic tools of theoretical computer science, such as worst case analysis and approximation ratios, in contrast to classical mechanism design in economics which often makes distributional assumptions about the agents. It also considers computational constraints to be of central importance: mechanisms that cannot be efficiently implemented in polynomial time are not considered to be viable solutions to a mechanism design problem. This often, for example, rules out the classic economic mechanism, the Vickrey–Clarke–Groves auction. (Wikipedia).
Computational Complexity in Mechanism Design - Jing Chen
Jing Chen Massachusetts Institute of Technology; Member, School of Mathematics November 27, 2012 Some important mechanisms considered in game theory require solving optimization problems that are computationally hard. Solving these problems approximately may not help, as it may change the
From playlist Mathematics
Algorithms Explained: What is an Algorithm?
This video defines what an algorithm is, distinguishes algorithms from recipes and functions and gives some examples of algorithms. This is the first video in an "Algorithms Explained" series that discusses algorithms at a conceptual level. Videos in this series that discuss specific algo
From playlist Algorithms Explained
Algorithms Are Cool - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Make A Combination Lock - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Centrality - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Function Comparision - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Chain Network Solution - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Comparing Iterative and Recursive Factorial Functions
Comparing iterative and recursive factorial functions
From playlist Computer Science
This mechanism directly converts the continuous rotary motion of a drive shaft into the intermittent linear motion of a rack. STEP files of this video: http://www.mediafire.com/file/1c0iaa3teed88el/RatchetMechanism6STEP.zip Inventor files: http://www.mediafire.com/file/ujcw5wcp8nabb65/Ratc
From playlist Mechanisms
Differentially Private Algorithms: Some Primitives and Paradigms - Kunal Talwar
Differential Privacy Symposium: Four Facets of Differential Privacy Saturday, November 12, 2016 https://www.ias.edu/differential-privacy More videos on http://video.ias.edu
From playlist Differential Privacy Symposium - November 12, 2016
Monte Carlo methods and Optimization: Intertwinings (Lecture 1) by Gersende Fort
PROGRAM : ADVANCES IN APPLIED PROBABILITY ORGANIZERS : Vivek Borkar, Sandeep Juneja, Kavita Ramanan, Devavrat Shah and Piyush Srivastava DATE & TIME : 05 August 2019 to 17 August 2019 VENUE : Ramanujan Lecture Hall, ICTS Bangalore Applied probability has seen a revolutionary growth in r
From playlist Advances in Applied Probability 2019
Overview and Recent Results in Combinatorial Auctions - Matt Weinberg
Computer Science/Discrete Mathematics Seminar II Topic: Overview and Recent Results in Combinatorial Auctions Speaker: Matt Weinberg Affiliation: Princeton University Date: February 7, 2023 In this talk, I'll first give a broad overview of the history of combinatorial auctions within TCS
From playlist Mathematics
Stanford Seminar - Design for Collective Action
Niloufar Salehi UC Berkeley February 1, 2019 From Twitter hashtags such as #metoo to protests by Mechanical Turk workers in the public sphere, collectives come together online to make progress on shared issues. My research introduces social computing systems that directly center trust a
From playlist Stanford Seminars
Overview on Modern Cryptography
Cryptography and Network Security by Prof. D. Mukhopadhyay, Department of Computer Science and Engineering, IIT Kharagpur. For more details on NPTEL visit http://nptel.iitm.ac.in
From playlist Computer - Cryptography and Network Security
Adaptive Interaction Techniques for Sharing Design Resources
December 7, 2007 lecture by Brian Lee for the Human-Computer Interaction Seminar (CS 547). Today's designers generate content both on paper and online. Designers spread their work over physical and digital media, each of which has powerful, but distinct, sets of affordances. Recent work su
From playlist Course | Human-Computer Interaction Seminar (2007-2008)
Physical Modeling Tutorial, Part 11: Design Optimization
Learn what Simulink Design Optimization™ is and how to select and design parameters, set requirements or design goals, and optimize model parameters. - Enter the MATLAB and Simulink Racing Lounge: http://bit.ly/2HhcXnU - Download Example Files: Physical Modeling for Formula Student: htt
From playlist Physical Modeling Tutorials
Osbert Bastani - Interpretable Machine Learning via Program Synthesis - IPAM at UCLA
Recorded 10 January 2023. Osbert Bastani of the University of Pennsylvania presents "Interpretable Machine Learning via Program Synthesis" at IPAM's Explainable AI for the Sciences: Towards Novel Insights Workshop. Abstract: Existing approaches to interpretability largely focus on fixed mo
From playlist 2023 Explainable AI for the Sciences: Towards Novel Insights
Intractability in Algorithmic Game Theory - Tim Roughgarden
Tim Roughgarden Stanford University March 11, 2013 We discuss three areas of algorithmic game theory that have grappled with intractability. The first is the complexity of computing game-theoretic equilibria, like Nash equilibria. There is an urgent need for new ideas on this topic, to ena
From playlist Mathematics
From playlist Algorithms 1
Stanford Seminar - Participating and Designing around Algorithmic Sociotechnical Systems
Motahhare Eslami Carnegie Mellon University October 4, 2019 Algorithms play a vital role in curating online information in socio-technical systems, however, they are usually housed in black-boxes that limit users' understanding of how an algorithmic decision is made. While this opacity pa
From playlist Stanford Seminars