Filters








5,520 Hits in 6.5 sec

Coalition Formation: Concessions, Task Relationships and Complexity Reduction [article]

Samir Aknine, Onn Shehory
2005 arXiv   pre-print
Further, it works well with both cardinal and ordinal task values.  ...  As shown in recent studies, compromise may facilitate coalition formation and increase agent utilities. In this study we leverage on those new results.  ...  Agent C 1 initiates the negotiation and it builds its tree of combinations of tasks. Then C 1 generates a set of coalition structures it considers acceptable.  ... 
arXiv:cs/0502094v1 fatcat:pxy6sxip2ja5fnbmm6m6nv4tba

Towards optimal service composition upon QoS in agent cooperation

Chattrakul Sombattheera, Jun Shen
2013 International Journal of Computational Science and Engineering (IJCSE)  
It is quite common in tourism industry that a tourist would love to gain the most wonderful experience from visiting multiple places in one trip.  ...  Abstract: It is quite common in tourism industry that a tourist would love to gain the most wonderful experience from visiting multiple places in one trip.  ...  We consider composing a service in our context is similar to generating a coalition structure.  ... 
doi:10.1504/ijcse.2013.053063 fatcat:xghk6isp6rfajgaf47jetniboi

Active Exploitation of Redundancies in Reconfigurable Multi-Robot Systems [article]

Thomas M. Roehr
2021 arXiv   pre-print
Multi-robot operations can benefit from this flexibility by actively managing system redundancies depending on current tasks and having more options to respond to failure events.  ...  While traditional robotic systems come with a monolithic system design, reconfigurable multi-robot systems can share and shift physical resources in an on-demand fashion.  ...  We use the following definitions to separate the current (realized and physically assembled) set of general agents in a coalition structure from the (virtual) set of agents, which can be formed from the  ... 
arXiv:2106.12079v1 fatcat:e5mlj5uwozfk3i2j4pzrcj6vti

Active Exploitation of Redundancies in Reconfigurable Multirobot Systems

Thomas M. Roehr
2022 IEEE Transactions on robotics  
Multirobot operations can benefit from this flexibility by actively managing system redundancies depending on current tasks and having more options to respond to failure events.  ...  While traditional robotic systems come with a monolithic system design, reconfigurable multirobot systems can share and shift physical resources in an on-demand fashion.  ...  ACKNOWLEDGMENT The author would like to thank all contributors who helped to realize the multirobot team in the project TransTerrA.  ... 
doi:10.1109/tro.2021.3118284 fatcat:5mdccmuf2bc3lpjr6p2lq23iqu

Coalition formation for task allocation: theory and algorithms

Travis C. Service, Julie A. Adams
2010 Autonomous Agents and Multi-Agent Systems  
This paper focuses on coalition formation for task allocation in both multiagent and multi-robot domains.  ...  For this situation a dynamic programming based approach is presented, which, for fixed j finds the optimal coalition structure in polynomial time and is applicable in both multi-agent and multi-robot domains  ...  Thus, there is a one-to-one mapping between the independent sets of G and coalition structures, such that if an independent set in G has l vertices, the utility of the corresponding coalition structure  ... 
doi:10.1007/s10458-010-9123-8 fatcat:2xl7lhgzj5g55epmuia3k7lkcy

Optimising Social Welfare in Multi-Resource Threshold Task Games [chapter]

Fatma R. Habib, Maria Polukarov, Enrico H. Gerding
2017 Lecture Notes in Computer Science  
Furthermore, we define the coalition structure generation (CSG) Problem for MR-TTGs.  ...  In this paper, we introduce a discrete model for overlapping coalition formation called the multi-resource threshold task game (MR-TTG), which generalises the model introduced in [6].  ...  One of the early models of coalitional games in a task-based environment was introduced by [8] .  ... 
doi:10.1007/978-3-319-69131-2_7 fatcat:2e7edoinkzharn6r6z4z5addhu

Complexity of coalition structure generation [article]

Haris Aziz, Bart de Keijzer
2011 arXiv   pre-print
We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare.  ...  One of our key results is a general polynomial-time algorithm to solve the problem for all coalitional games provided that player types are known and the number of player types is bounded by a constant  ...  is in general a difficult task.  ... 
arXiv:1101.1007v6 fatcat:fvnkd3s5hjfffaywumixrlbpw4

Formation of virtual organizations in grids: a game-theoretic approach

Thomas E. Carroll, Daniel Grosu
2008 Concurrency and Computation  
Using game theory, we formulate the resource composition among GSPs as a coalition formation problem and propose a framework based on cooperation structures to model it.  ...  Applications require the composition of resources to execute in a grid computing environment.  ...  In Section IV we propose a framework and a model of coalition formation based on cooperation structures.  ... 
doi:10.1002/cpe.1369 fatcat:57qwsmctojf3pa4dlcbjfnvusi

Formation of Virtual Organizations in Grids: A Game-Theoretic Approach [chapter]

Thomas E. Carroll, Daniel Grosu
2009 Economic Models and Algorithms for Distributed Systems  
Using game theory, we formulate the resource composition among GSPs as a coalition formation problem and propose a framework based on cooperation structures to model it.  ...  Applications require the composition of resources to execute in a grid computing environment.  ...  In Section IV we propose a framework and a model of coalition formation based on cooperation structures.  ... 
doi:10.1007/978-3-7643-8899-7_5 fatcat:rgwvvd3oe5fedfclnzjskucsiu

Cohesion and Balance in a Human Resource Allocation Problem

László Illyés
2009 Acta Cybernetica  
One has to prospect also the level of knowledge overlap between the trade groups of agents.  ...  The problem discussed occurred when many construction workers were taken to Germany from Romania to work in construction projects.  ...  Nobody can perform good tasks alone on a long term. Nitchi in [1] considers the collaboration as an intelligent activity based on 3C (Communication, Coordination and Cooperation).  ... 
doi:10.14232/actacyb.19.1.2009.6 fatcat:3tzg26y7kveidldasnj5ddmuqe

A new differential privacy preserving crowdsensing scheme based on the Owen value

Sungwook Kim
2019 EURASIP Journal on Wireless Communications and Networking  
The major goal of our approach is to incentivize the participating devices for effective data acquisitions while protecting each individual privacy based on each device's preference.  ...  Performance evaluation reveals the superiority of our proposed scheme in terms of task success ratio, MC participating ratio, and payoff fairness.  ...  A coalition structure for ℕ is a partition ℂ= { C 1 ,..., C h }, i.e., C 1 ≤ k ≤ h ∩C 1 ≤ l ≤ h ¼ ∅ if k ≠ l and ∪ h k¼1 C k ¼ ℕ. Let Ω(ℕ) be the set of all permutations on ℕ.  ... 
doi:10.1186/s13638-019-1479-0 fatcat:tcfur6aj4belbcmejggkoeyvz4

A Constraint-based Mission Planning Approach for Reconfigurable Multi-Robot Systems

Thomas M Roehr
2018 Inteligencia Artificial  
This paper suggests a constraint-based mission planning approach, and presents a set of revised definitions for reconfigurable multi-robot systems including the representation of the planning problem using  ...  While the problem originates from the domain of robotics it is of general nature and significantly intersects with operations research.  ...  Any reconfiguration changes this coalition structure, but requires a transition time, so that ρ(CS A i , CS A j ) defines the time to transition from one coalition structure CS A i to another CS A j .  ... 
doi:10.4114/intartif.vol21iss62pp25-39 fatcat:bnhwrph73ba6fbp4nub6us73gm

A Merge-and-Split Mechanism for Dynamic Virtual Organization Formation in Grids

Lena Mashayekhy, Daniel Grosu
2014 IEEE Transactions on Parallel and Distributed Systems  
We model the VO formation in grids using concepts from coalitional game theory and design a mechanism for VO formation.  ...  Executing large scale application programs in grids requires resources from several Grid Service Providers (GSPs).  ...  For example for 75 tasks, 11 merge and 3 split operations are performed in order to form a stable coalition structure, but a VO with size one is selected among all coalitions in the coalition structure  ... 
doi:10.1109/tpds.2013.93 fatcat:gow66cfwgbbe7oubfzcgr4oevq

A merge-and-split mechanism for dynamic virtual organization formation in grids

Lena Mashayekhy, Daniel Grosu
2011 30th IEEE International Performance Computing and Communications Conference  
We model the VO formation in grids using concepts from coalitional game theory and design a mechanism for VO formation.  ...  Executing large scale application programs in grids requires resources from several Grid Service Providers (GSPs).  ...  For example for 75 tasks, 11 merge and 3 split operations are performed in order to form a stable coalition structure, but a VO with size one is selected among all coalitions in the coalition structure  ... 
doi:10.1109/pccc.2011.6108108 dblp:conf/ipccc/MashayekhyG11 fatcat:5whsbtnp2fckvpojsuqbcd5nim

Selection of Information Streams in Social Sensing

Gabriele Gianini, Corrado Mio, Francesco Viola, Jianyi Lin, Nawaf Almoosa
2020 Proceedings of the 12th International Conference on Management of Digital EcoSystems  
The method is based on the use of the Coalitional Game Theory concept of Power Index, and relies on the polynomial-time estimate of the stream sets characteristics.  ...  In this work we address the problem of critical source selection in social sensing.  ...  ACKNOWLEDGEMENTS The authors would like to thank the anonymous reviewers for their advise, which has signi cantly helped in improving the paper.  ... 
doi:10.1145/3415958.3433099 fatcat:yiombzzs4jgqhlhqp5bxmxdje4
« Previous Showing results 1 — 15 out of 5,520 results