Acknowledgments This material is based in part upon work supported by the National Science Foundation under grant number 0812039 Methods  GOAL: determine.

Slides:



Advertisements
Similar presentations
Distributed Advice-Seeking on an Evolving Social Network Dept Computer Science and Software Engineering The University of Melbourne - Australia Golriz.
Advertisements

Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
METHODOLOGY FOR IDENTIFYING NEAR-OPTIMAL INTERDICTION STRATEGIES FOR A POWER TRANSMISSION SYSTEM Vicki M. Bier, Eli Robert Gratz, Naraphorn J. Haphuriwat,
Modeling Maze Navigation Consider the case of a stationary robot and a mobile robot moving towards a goal in a maze. We can model the utility of sharing.
2012 ULA Pre-Conference COLLABORATION: A PROVEN MODEL FOR LIBRARY SUCCESS.
Chapter 8: Foundations of Group Behavior
A Revenue Enhancing Stackelberg Game for Owners in Opportunistic Spectrum Access Ali O. Ercan 1,2, Jiwoong Lee 2, Sofie Pollin 2 and Jan M. Rabaey 1,2.
IAT Heuristics for Dealing with a Shrinking Pie in Agent Coalition Formation Kevin Westwood – Utah State University Vicki Allan – Utah State University.
Methods for Coalition Formation in Adaptation-Based Social Networks Levi Barton, Vicki H. Allan Utah State University.
Partner reward – a help or a hindrance to effective business development? Peter Scott Peter Scott Consulting
Xiaowei Ying Xintao Wu Univ. of North Carolina at Charlotte 2009 SIAM Conference on Data Mining, May 1, Sparks, Nevada Graph Generation with Prescribed.
Multi-Agent Coalition Formation for Long-Term Task or Mobile Network Hsiu-Hui Lee and Chung-Hsien Chen.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
P2p, Spring 05 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems March 29, 2005.
ZIGZAG A Peer-to-Peer Architecture for Media Streaming By Duc A. Tran, Kien A. Hua and Tai T. Do Appear on “Journal On Selected Areas in Communications,
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Network Coding and Reliable Communications Group Network Coding for Multi-Resolution Multicast March 17, 2010 MinJi Kim, Daniel Lucani, Xiaomeng (Shirley)
Close Lower and Upper Bounds for the Minimum Reticulate Network of Multiple Phylogenetic Trees Yufeng Wu Dept. of Computer Science & Engineering University.
Agent-Organized Networks for Dynamic Team Formation Gaton, M.E. and desJardins, M., In Proceedings of AAMAS-2005, pp Seo, Young-Woo.
Impact of Problem Centralization on Distributed Constraint Optimization Algorithms John P. Davin and Pragnesh Jay Modi Carnegie Mellon University School.
1 Who Works Together in Agent Coalition Formation? Vicki Allan – Utah State University Kevin Westwood – Utah State University CIA 2007.
Purpose of the Project The purpose of the project was to create an online professional learning network (PLN), to support middle school math/science teachers.
1 The Orphan Problem in ZigBee- based Wireless Sensor Networks IEEE Trans. on Mobile Computing (also in MSWiM 2007) Meng-Shiuan Pan and Yu-Chee Tseng Department.
Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.
How to use media partnerships to strengthen your grant proposals and funding streams.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Modeling Information Diffusion in Networks with Unobserved Links Quang Duong Michael P. Wellman Satinder Singh Computer Science and Engineering University.
2 Introduction: phase transition phenomena Phase transition: qualitative change as a parameter crosses threshold Matter temperature magnetism demagnetism.
Trust-based Multi-Objective Optimization for Node-to-Task Assignment in Coalition Networks 1 Jin-Hee Cho, Ing-Ray Chen, Yating Wang, and Kevin S. Chan.
Coalition Formation between Self-Interested Heterogeneous Actors Arlette van Wissen Bart Kamphorst Virginia DignumKobi Gal.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Practical Schedulability Analysis for Generalized Sporadic Tasks in Distributed Real-Time Systems Yuanfang Zhang 1, Donald K. Krecker 2, Christopher Gill.
HRM Practices Human resource management (HRM) is defined as the practices, policies, and systems that influence employees’ behaviour, attitudes, and performance.
The Trust Company Strategic Partners Symposium Partnership & Collaboration October 2013.
Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem M. Karpinski Bonn University I. Măndoiu UC San Diego A. Olshevsky GaTech.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Xiaowei Ying, Xintao Wu Univ. of North Carolina at Charlotte PAKDD-09 April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks.
An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks Min Qin and Roger Zimmermann Computer Science Department, Integrated Media Systems.
Agent-Organized Networks for Dynamic Team Formation Multi-Agent Planning and Learning Laboratory (MAPLE) Department of Computer Science and EE University.
Learning the Structure of Related Tasks Presented by Lihan He Machine Learning Reading Group Duke University 02/03/2006 A. Niculescu-Mizil, R. Caruana.
By RAMMOHAN MITTAPALLI RAVI KOLAWAR PRASHANTH MANDALAPU.
ESF Member Organisation Forum Science in Society Relationships Inproving interaction with society – urge for strategy & action ESOF2012 session.
4 Introduction Broadcasting Tree and Coloring System Model and Problem Definition Broadcast Scheduling Simulation 6 Conclusion and Future Work.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
Measuring Behavioral Trust in Social Networks
SocialVoD: a Social Feature-based P2P System Wei Chang, and Jie Wu Presenter: En Wang Temple University, PA, USA IEEE ICPP, September, Beijing, China1.
Du, Faloutsos, Wang, Akoglu Large Human Communication Networks Patterns and a Utility-Driven Generator Nan Du 1,2, Christos Faloutsos 2, Bai Wang 1, Leman.
“We will lead the nation in improving student achievement.” CLASS Keys TM Module 6: Informal Observations Spring 2010 Teacher and Leader Quality Education.
1 DIMENSIONS THAT CHARACTERIZE COMMUNITIES PREPARING FOR THE ANALYSIS OF SETTINGS WITHIN THE INSTITUTION.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Agents of Socialization BR. What might be a difference between an upper and lower class family value?
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
4 Introduction Carrier-sensing Range Network Model Distributed Data Collection Simulation 6 Conclusion 2.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Foundations of American Education: Perspectives on Education in a Changing World, 15e © 2011 Pearson Education, Inc. All rights reserved. Chapter 1 Teaching.
BAHIR DAR UNIVERSITY Institute of technology Faculty of Computing Department of information technology Msc program Distributed Database Article Review.
Maximum Expected Utility
Business Intelligence: A Managerial Approach (2nd Edition)
High Tech Matching Grants
Evolution for Cooperation
Vicki M. Bier, Eli Robert Gratz, Naraphorn J
CASE − Cognitive Agents for Social Environments
Joydeep Chandra, Santosh Shaw and Niloy Ganguly
OPINIONS DYNAMICS WITH RELATIVE AGREEMENT
Korea University of Technology and Education
复杂网络可控性 研究进展 汪秉宏 2014 北京 网络科学论坛.
CLASS KeysTM Module 6: Informal Observations Spring 2010
The Impact of Changes in Network Structure on Diffusion of Warnings
Boost Your Business Understanding the 4 Stages of Negotiation
Presentation transcript:

Acknowledgments This material is based in part upon work supported by the National Science Foundation under grant number Methods  GOAL: determine strategies to improve success in coalition formation network  Only local information without backtracking  Strategic agents select  The coalition with the highest percent of committed agents  The coalition for which peers have the best match with needed skills  Strategic agents can propose a new coalition  If its peers have a high chance of satisfying the criteria  Randomly as a last resort  Hedging environment  Agents commit to multiple coalitions  Multiple coalition s are associated with the same task We study five types of reorganization (Abdallah and Lesser, 2007): performance (Gaston and Jardins, 2005), structural (Thadakamalla et al., 2004), egalitarian, inventory, and intelligent. Results Conclusions  The strategic agents are better than the lower bound (of the random agents) and competitive with an upper bound (of the hedging agent)  Success of local strategies (without hedging) depends heavily on sufficient neighbors  Egalitarian reorganization is the most beneficial topological type reorganization in the hedging environment  A simple reorganization strategy, if applied over time, creates undesirable structural features like isolated agents  A better plan would be to have a mixture of strategies: some which directly pursue goals and others which seek to rebuild and utilize agents which have been abandoned in the simulation Influence of Neighborhood and Reorganization in Networked Agent Simulation Udara C. Weerakoon and Vicki H. Allan Utah State University Fig. 3. Profit Vs. Agent Connections. 1.Initial profit is negative for all agents 2.Communication cost is a burden on the profit of hedging agents Fig. 5. Performance-rate Vs. Time (with reorganization). 1.Reorganization increases performance initially 2.Egalitarian reorganization outperforms intelligent reorganization 3.The higher number of isolated agents in inventory and performance reorganization reduces the performance-rate of the agent society For further information Please contact Fig. 1. Uncommitted agentsTask-executing agents Committed agents Reorg.TriggerHow SelectedCan refuse PerformanceProb 1/|A|performanceno StructuralProb 1/|A|most connectionsno EgalitarianProb 1/|A|fewest connectionsno InventoryProb 1/|A|needed skillno Intelligent Underperforming Neighborhood current skill demandyes Fig. 2. Performance-rate Vs. Agent Connections. 1.The maximum performance-rate of random agents (MPRA) is 30% (30% of introduced tasks can be completed) 2.Strategic agents require ten connections to achieve MPRA 3.Hedging agents require five connections to achieve MPRA and ten connections to outperforms strategic agents  Coalition formation in a network of agents  Nodes - agents  Edges - "can work with" relationships  No centralized control  Agents propose or join a coalition  Agents reorganize their partners - utility  1 st set of experiments  The same No. Neighbors  No reorganization  Hedging, random, and strategic  2 nd set of experiments  The max. No. Neighbors is 15  With reorganization  Hedging only