<transcript><audio_38>that every agent is happy okay that's</transcript> that every agent is happy okay that's to make everyone happier okay I mean of course happier is not a mathematical thing but you kinda know what I'm talking about right everyone gets the what do you think should how do you think you should come up let's say you want to come up with an algorithm so of course each agent has to report this preference order right so you might think that you know what I let's say you are agent one and you say you know what I prefer J ones house over J 2's house but how about I say you know I reveal that I prefer J to house over J one house okay so you can you can in order to be more strategic or you might think that you know what if the allocation algorithm is not well designed you might have a preference to lie about which house you find better than the other okay so that you get what you want so we want to avoid that situation we want to avoid situation where agents so we want to design an allocation scheme so that there is no incentive for any agent to lie about its preferences so let's
{"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"}}