ͽÄêɽ -¾ÜºÙ¾ðÊó-
·ï̾ | BS Bhaskar Dutta»á |
³«»ÏÆü»þ | 2008ǯ 12·î 9Æü (²ÐÍËÆü) 10»þ40ʬ (GMT+09:00) |
½ªÎ»Æü»þ | 2008ǯ 12·î 9Æü (²ÐÍËÆü) 12»þ00ʬ (GMT+09:00) |
¾ì½ê | 6¹æ´Û 411¶µ¼¼ |
¾ÜºÙ | Êó¹ð¼Ô¡§Bhaskar Dutta (The University of Warwick) ȯɽ¥¿¥¤¥È¥ë¡§Sharing Costs in Spanning Networks ³µÍס§ The use of axiomatic methods in distributional problems involving the sharing of costs and benefits has a long tradition in social choice theory. In the vast bulk of this literature¡¤ the agents have no particular "positional" structure. However¡¤ there is a large class of practical problems in which it makes sense to identify the agents with nodes in a graph - for instance multicast transmission over the internet¡¤ sharing distribution costs over a network¡¤ sharing river water flows between upstream and downstream agents. The combinatorial structure of these problems raise a different set of issues (for instance computational complexity) and proof techniques from those which arise when a network structure is absent. This has become an active area of research amongst social choice theorists and also computer scientists recently. In the this talk¡¤ I will survey some of this recent literature¡¤ focussing mainly on axiomatic issues. ¤Ê¤ª¡¤GLOPE II¥×¥í¥¸¥§¥¯¥È»²²Ã³ØÀ¸¤Ï¡¤¼ø¶ÈÅù¤Ç½ÐÀʤǤ¤Ê¤¤¾ì¹ç¤ò½ü¤¡¤ËÜ¥»¥ß¥Ê¡¼¤Ë»²²Ã¤¹¤ë¤³¤È¤¬µá¤á¤é¤ì¤Þ¤¹¡¥ |
¥«¥Æ¥´¥ê¡¼ | À¯¼£·ÐºÑ³Ø´ðÁÃ¥»¥ß¥Ê¡¼¡¦¥é¥ó¥Á¥¿¥¤¥à¥»¥ß¥Ê¡¼ |