東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Strategic and secure interactions in...

Tan, Jinsong.

FindBook

Google Book

Amazon

博客來

Strategic and secure interactions in networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Strategic and secure interactions in networks./
作者:	Tan, Jinsong.
面頁冊數:	144 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-05, Section: B, page: .
Contained By:	Dissertation Abstracts International72-05B.
標題:	Economics, General. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3447601
ISBN:	9781124530291

Strategic and secure interactions in networks.
Tan, Jinsong.

Strategic and secure interactions in networks. - 144 p.

Source: Dissertation Abstracts International, Volume: 72-05, Section: B, page: .

Thesis (Ph.D.)--University of Pennsylvania, 2010.

The goal of this dissertation is to understand how network plays a role in shaping certain strategic interactions, in particular biased voting and bargaining, on networks; and to understand how interactions can be made secure when they are constrained by the network topology. Our works take an interdisciplinary approach by drawing on theories and models from economics, sociology, as well as computer science, and using methodologies that include both theories and behavioral experiments.

ISBN: 9781124530291Subjects--Topical Terms:

1017424
Economics, General.

Strategic and secure interactions in networks.
LDR:04395nam 2200325 4500 001 1395277
005 20110506125654.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124530291
035 $a (UMI)AAI3447601
035 $a AAI3447601
040 $a UMI $c UMI
100 1 $a Tan, Jinsong. $3 1673939
245 1 0 $a Strategic and secure interactions in networks.
300 $a 144 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-05, Section: B, page: .
500 $a Adviser: Michael Kearns.
502 $a Thesis (Ph.D.)--University of Pennsylvania, 2010.
520 $a The goal of this dissertation is to understand how network plays a role in shaping certain strategic interactions, in particular biased voting and bargaining, on networks; and to understand how interactions can be made secure when they are constrained by the network topology. Our works take an interdisciplinary approach by drawing on theories and models from economics, sociology, as well as computer science, and using methodologies that include both theories and behavioral experiments.
520 $a First, we consider biased voting in networks, which models distributed collective decision making processes where individuals in a network must balance between their private biases or preferences with a collective goal of consensus. Our study of this problem is two-folded. On the theoretical side, we start by introducing a diffusion model called biased voter model, which is a natural extension of the classic voter model. Among other results, we show in the presence of biases, no matter how small, there exists certain networks where it takes exponential time to converge to a consensus through distributed interaction in networks. This is a stark and interesting contrast to the well-known result that it always takes polynomial time to converge in the voter model, when there are no biases. On the experimental side, a group human subjects were arranged in various carefully designed virtual networks to solve the biased voting problem. Along with analyses of how collective and individual performance vary with network structure and incentives generally, we find there are well-studied network topologies in which the minority preference consistently wins globally, and that the presence of "extremist" individuals, or the awareness of opposing incentives, reliably improve collective performance
520 $a Second, we consider bargaining in networks, which has long been studied by economists and sociologists. A basic premise behind the many theoretical study of bargaining in networks is that pure topological differences in agents' network positions endow them with different bargaining power. Complementary to these theories, we conduct a series of controlled behavioral experiments, where human subjects were arranged in various carefully designed virtual networks to playing bargaining games. Along with other findings of how individual and collective performance vary with network structures and individual playing styles, we find that the number of neighbors one can negotiate with confers bargaining power, whereas the limit on the number of deals one can close undermines it, and we find that competitions from distant parts of the network, though invisible locally, also play a significant and subtle role in shaping bargaining powers.
520 $a And last, we consider the question of how interactions in networks can be made secure. Traditional methods and tools from cryptography, for example secure multi-party computation, can be applied only if each party can talk to everyone else directly; but cannot be directly applied if interactions are distributed over a network without completely eradicating the distributed nature. We develop a general 'compiler' that turns each algorithm from a broad class collectively known as message-passing algorithms into a secure one that has exactly the same functionality and communication pattern. And we show a fundamental trade-off between preserving the distributed nature of communication and the level of security one can hope for. vi
590 $a School code: 0175.
650 4 $a Economics, General. $3 1017424
650 4 $a Psychology, Behavioral Sciences. $3 1669657
650 4 $a Computer Science. $3 626642
690 $a 0501
690 $a 0602
690 $a 0984
710 2 $a University of Pennsylvania. $3 1017401
773 0 $t Dissertation Abstracts International $g 72-05B.
790 1 0 $a Kearns, Michael, $e advisor
790 $a 0175
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3447601