<transcript><audio_0>today we want to talk about the mechanism design with constraints the</transcript><caption><image_1>The image shows a man standing in front of a large blackboard in a classroom. He is wearing a red jacket and blue jeans and appears to be in the middle of a lesson. The blackboard is mounted on a white wall and there are several empty chairs and tables in the room. The man is standing in the center of the room and is facing the blackboard. There is a projector screen on the right side of the image and a bookshelf on the left side.</caption><caption><image_2>The image shows a man standing in front of a large blackboard in a classroom. He is wearing an orange shirt and blue jeans and appears to be walking towards the blackboard. The blackboard is blank and there is writing on it in white chalk. There are two empty desks and chairs in the room, and a projector screen on the wall above the blackboards. The room has a white ceiling and a window on the left side of the image.</caption><transcript><audio_3>okay and in the previous class we are talking about VCG mechanism where the idea was that we want to define based on the Preferences of the other based on</transcript><transcript><audio_4>the Preferences of the players we want to come up with a function f that map's their preferences less cost or value</transcript><transcript><audio_5>functions to outcome and some payment TI that map's the outcome or other preferences and cost to payments payment oh Claire hi okay so that's what we did</transcript><transcript><audio_6>in the last two classes so in the case of options the there was a value for the object right and you wanted to the mechanism designer wanted to come up with a function f that map's the</transcript><transcript><audio_7>Preferences or the values of the player to who wins the auction and then the payment what should the payment of the person who won the option should be and what should the payment of people who did not win the action who did not win</transcript><transcript><audio_8>the option what should their payoff speed or what they what should their payment be okay so that was also part of the auction designers action but in all cases P I is equal to zero for all</transcript> today we want to talk about the mechanism design with constraints the okay and in the previous class we are talking about VCG mechanism where the idea was that we want to define based on the Preferences of the other based on the Preferences of the players we want to come up with a function f that map's their preferences less cost or value functions to outcome and some payment TI that map's the outcome or other preferences and cost to payments payment oh Claire hi okay so that's what we did in the last two classes so in the case of options the there was a value for the object right and you wanted to the mechanism designer wanted to come up with a function f that map's the Preferences or the values of the player to who wins the auction and then the payment what should the payment of the person who won the option should be and what should the payment of people who did not win the action who did not win the option what should their payoff speed or what they what should their payment be okay so that was also part of the auction designers action but in all cases P I is equal to zero for all
{"source": "grass-yt-cc-by.-VnbOX7YpOg|shard_10024_31|create_multimodal_data.extract_yt_and_generate_transcripts.50|shard_10024|create_multimodal_data.generate_captions.41|shard_10024|create_multimodal_data.generate_captions.55", "params": {"id": "-VnbOX7YpOg", "channel_id": "UCCW34TVt0WB80MA4W2E1ZFA", "duration": 4446, "view_count": 154, "age_limit": 0, "chapters": [{"start_time": 0, "end_time": 243.0, "title": "<Untitled Chapter 1>"}, {"start_time": 243.0, "title": "Kidney Exchange", "end_time": 288.0}, {"start_time": 288.0, "title": "Google Adwords", "end_time": 430.0}, {"start_time": 430.0, "title": "The House Allocation Problem", "end_time": 715.0}, {"start_time": 715.0, "title": "Blocking Coalition", "end_time": 1043.0}, {"start_time": 1043.0, "title": "Directed Cycle", "end_time": 2135.0}, {"start_time": 2135.0, "title": "Problem of Attc Algorithm", "end_time": 2422.0}, {"start_time": 2422.0, "title": "Maximum Cardinality Matching", "end_time": 2486.0}, {"start_time": 2486.0, "title": "Multiple Maximum Cardinality Matching", "end_time": 2602.0}, {"start_time": 2602.0, "title": "Table Matching", "end_time": 2636.0}, {"start_time": 2636.0, "title": "Stable Matching", "end_time": 2810.0}, {"start_time": 2810.0, "title": "Unstable Matching", "end_time": 2825.0}, {"start_time": 2825.0, "title": "Unstable Match", "end_time": 3102.0}, {"start_time": 3102.0, "title": "Existence of Stable Match", "end_time": 3147.0}, {"start_time": 3147.0, "title": "Deferred Acceptance Algorithm", "end_time": 3889.0}, {"start_time": 3889.0, "title": "Male Optimal Match", "end_time": 4032.0}, {"start_time": 4032.0, "title": "Kidney Exchange Problem", "end_time": 4446}], "like_count": 1, "channel_follower_count": 1050, "license": "Creative Commons Attribution license (reuse allowed)", "uploader_id": "@abhigup", "yt_tar_file": "/leonardo_work/EUHPC_E03_068/audio/fixed_download/grass-yt-cc-by//shard_10024/-VnbOX7YpOg.tar.gz"}}