Filters








3,706 Hits in 3.0 sec

Pareto optimality in coalition formation

Haris Aziz, Felix Brandt, Paul Harrenstein
2013 Games and Economic Behavior  
In this paper, we identify a close structural connection between Pareto optimality and perfection that has various algorithmic consequences for coalition formation.  ...  Based on this insight, we formulate the Preference Refinement Algorithm (PRA) which computes an individually rational and Pareto optimal outcome in hedonic coalition formation games or any other discrete  ...  In this paper, we focus on Pareto optimality and individual rationality in this rich class of coalition formation games.  ... 
doi:10.1016/j.geb.2013.08.006 fatcat:eevg6uaeincrfklbcqomlpifo4

Pareto Optimality in Coalition Formation [chapter]

Haris Aziz, Felix Brandt, Paul Harrenstein
2011 Lecture Notes in Computer Science  
In this paper, we identify a close structural connection between Pareto optimality and perfection that has various algorithmic consequences for coalition formation.  ...  Based on this insight, we formulate the Preference Refinement Algorithm (PRA) which computes an individually rational and Pareto optimal outcome in hedonic coalition formation games or any other discrete  ...  In this paper, we focus on Pareto optimality and individual rationality in this rich class of coalition formation games.  ... 
doi:10.1007/978-3-642-24829-0_10 fatcat:g67kjz5wxncmdln7lagywz3mdm

Coalition calculation in a dynamic agent environment

Ted Scully, Michael G. Madden, Gerard Lyons
2004 Twenty-first international conference on Machine learning - ICML '04  
We determine the Pareto optimal set of coalitions and then use an instance-based learning algorithm to select the optimal coalition.  ...  In order to obtain a true valuation of any coalition, we use the concept of Pareto dominance coupled with a distance weighting algorithm.  ...  Coalition formation is currently an active area of research in multiagent systems.  ... 
doi:10.1145/1015330.1015380 dblp:conf/icml/ScullyML04 fatcat:ph5e6tcg6rhk5lfxo57pi3mtxe

PARTICIPATION IN INTERNATIONAL ENVIRONMENTAL AGREEMENTS: THE ROLE OF TIMING AND REGULATION

MICHAEL FINUS, BIANCA RUNDSHAGEN
2008 Natural Resource Modeling  
It is shown that a sequential formation process opens up possibilities for strategic behavior of countries that may lead to inferior outcomes in terms of global abatement and welfare.  ...  conditions a regulator like an international organization, even without enforcement power, can improve upon globally suboptimal outcomes through coordination and moderation, given that recommendations must be Pareto-improving  ...  Pareto-optimal.  ... 
doi:10.1111/j.1939-7445.2006.tb00179.x fatcat:qif7os4tzrdurozoeutm3bqoxm

Participation in International Environmental Agreements: The Role of Timing and Regulation

Michael Finus, Bianca Rundshagen
2005 Social Science Research Network  
It is shown that a sequential formation process opens up possibilities for strategic behavior of countries that may lead to inferior outcomes in terms of global abatement and welfare.  ...  conditions a regulator like an international organization, even without enforcement power, can improve upon globally suboptimal outcomes through coordination and moderation, given that recommendations must be Pareto-improving  ...  Pareto-optimal.  ... 
doi:10.2139/ssrn.692502 fatcat:u4oycgglzvgbdbsro3hgbwb4ca

Pareto optimal coalitions of fixed size [article]

Ágnes Cseh, Tamás Fleiner, Petra Harján
2019 arXiv   pre-print
In all cases, we determine the complexity of deciding the existence, and then finding a Pareto optimal assignment, and the complexity of verifying Pareto optimality for a given assignment.  ...  or worst roommate in the coalition.  ...  Related literature Pareto optimality in coalition formation has an extremely rich literature. We start with an overview on coalition formation viewed as a hedonic game.  ... 
arXiv:1901.06737v2 fatcat:gnyjf6d6mrchblwhhcalk7wvv4

A multi-agent method for forming and dynamic restructuring of pareto optimal coalitions

Philippe Caillou, Samir Aknine, Suzanne Pinson
2002 Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 3 - AAMAS '02  
The first part of this paper presents a coalition formation method for multi-agent systems which finds a Pareto optimal solution without aggregating the preferences of the agents.  ...  The second part proposes an extension of this method enabling dynamic restructuring of coalitions when changes occur in the system.  ...  The protocol provides optimal Pareto-type solutions.  ... 
doi:10.1145/545073.545075 fatcat:qqh7pp4bujhvpavcedeoichinq

A multi-agent method for forming and dynamic restructuring of pareto optimal coalitions

Philippe Caillou, Samir Aknine, Suzanne Pinson
2002 Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 3 - AAMAS '02  
The first part of this paper presents a coalition formation method for multi-agent systems which finds a Pareto optimal solution without aggregating the preferences of the agents.  ...  The second part proposes an extension of this method enabling dynamic restructuring of coalitions when changes occur in the system.  ...  The protocol provides optimal Pareto-type solutions.  ... 
doi:10.1145/545056.545075 dblp:conf/atal/CaillouAP02 fatcat:ojt5llglu5c2hezi22oio6g6hq

Cloud Compute-and-Forward With Relay Cooperation

Koralia N. Pappi, Panagiotis D. Diamantoulakis, Hadi Otrok, George K. Karagiannidis
2015 IEEE Transactions on Wireless Communications  
Efficient coalition formation algorithms are proposed, which perform joint relay selection and PNC optimization.  ...  The problem of relay selection is matched to a coalition formation game, where the relays and the CD cooperate in order to maximize their profit.  ...  An efficient algorithm for the coalition formation was proposed, which leads to the optimal solution in terms of sum rate and players' profit.  ... 
doi:10.1109/twc.2015.2405547 fatcat:omwbbfh5enh5pomykujemlvgbq

Coalition formation processes with belief revision among bounded-rational self-interested agents

F Tohme
1999 Journal of Logic and Computation  
Conversely, any Pareto-optimal outcome can be supported by a communication-deliberation process that leads to a stable coalition structure.  ...  Finally, we show that the outcome of any communication-deliberation process that leads to a stable coalition structure is Pareto-optimal for the original game that does not incorporate communication or  ...  Pareto-optimal strong Nash or Pareto-optimal coalitionproof Nash equilibria. Bounded Rationality in Coalition Formation In the previous section it was assumed that deliberation is costless.  ... 
doi:10.1093/logcom/9.6.793 fatcat:dn7rbtq3ord6rkl42pckvbrkdy

Feasible Formation of Coalitions Among Autonomous Agents in Nonsuperadditive Environments

Onn Shehory, Sarit Kraus
1999 Computational intelligence  
In this paper we present algorithms for coalition formation and payo distribution in non-super-additive e n vironments. We focus o n a l o w-complexity k ernel-oriented coalition formation algorithm.  ...  These have shown that the model increases the bene ts of the agents within a reasonable time period, and more coalition formations provide more bene ts to the agents.  ...  In section 4 we i n troduce a computation-extensive coalition formation mechanism which supports Pareto-optimality 2 .  ... 
doi:10.1111/0824-7935.00092 fatcat:rl5ukmtmmrhqrcmdfn4hqtxvq4

Hedonic coalition formation games with variable populations: core characterizations and (im)possibilities

Mehmet Karakaya, Bettina Klaus
2016 International Journal of Game Theory  
Finally, and in contrast to roommate markets, we show that on the domain of solvable hedonic coalition formation games, there exists a solution not equal to the Core that satisfies coalitional unanimity  ...  hedonic coalition formation games.  ...  In particular, Lemma 3 (a) implies that on the domain of solvable hedonic games, if a solution ϕ is coalitionally unanimous and Maskin monotonic, then it is individually rational and Pareto optimal.  ... 
doi:10.1007/s00182-016-0533-y fatcat:oepjzljlujfixmrqurfzb45f2i

Price of Pareto optimality in hedonic games

Edith Elkind, Angelo Fanelli, Michele Flammini
2020 Artificial Intelligence  
In this paper, we argue that Pareto optimality can be seen as a notion of stability, and introduce the concept of Price of Pareto Optimality: this is an analogue of the Price of Anarchy, where the maximum  ...  is computed over the class of Pareto optimal outcomes, i.e., outcomes that do not permit a deviation by the grand coalition that makes all players weakly better off and some players strictly better off  ...  Thus, in this case any Pareto optimal outcome maximizes the social welfare and the Price of Pareto Optimality is 1.  ... 
doi:10.1016/j.artint.2020.103357 fatcat:qyx4ny6isbgidbft4ad3rrxl5e

Cooperative power consumption in the smart grid based on coalition formation game

Xi Luan, Jianjun Wu, Shubo Ren, Haige Xiang
2014 16th International Conference on Advanced Communication Technology  
It is realized according to the pricing model used by power provider, the welfare function of the consumer coalitions, as well as the coalition formation algorithm based on the modified Pareto order which  ...  In this paper, we propose a cooperative power consumption scheme for consumers based on coalition formation game, which is suitable for the general electricity markets in smart grid.  ...  The comparison between the coalition formation scheme and noncooperative scheme. TABLE I I . THE COALITION FORMATION ALGORITHM BASED ON THE MODIFIED PARETO ORDER Initialization  ... 
doi:10.1109/icact.2014.6779040 fatcat:7ks3iwmfhrhntlpsxaj5h72tl4

A coalition formation algorithm for Multi-Robot Task Allocation in large-scale natural disasters

Carla Mouradian, Jagruti Sahoo, Roch H. Glitho, Monique J. Morrow, Paul A. Polakos
2017 2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC)  
The dynamic formation of optimal coalition of these heterogeneous robots for cost efficiency is very challenging and research in the area is gaining more and more attention.  ...  In this paper, we propose a novel heuristic. Since the population of robots in large-scale disaster settings is very large, we rely on Quantum Multi-Objective Particle Swarm Optimization (QMOPSO).  ...  In this paper, we propose a coalition formation algorithm to solve it.  ... 
doi:10.1109/iwcmc.2017.7986575 dblp:conf/iwcmc/MouradianSGMP17 fatcat:or7heiog3jakbddngb6g2peua4
« Previous Showing results 1 — 15 out of 3,706 results