The effective classification of urban domestic waste is the key to achieve a “waste-free city” and provides an essential guarantee for resource utilization. This article takes a coalitional game perspective to study...The effective classification of urban domestic waste is the key to achieve a “waste-free city” and provides an essential guarantee for resource utilization. This article takes a coalitional game perspective to study the dilemmas in urban domestic waste separation from the cooperative interaction of residents, government, and enterprises. The study finds that urban domestic waste classification in China is currently facing many problems, focusing on: 1) insufficient consensus among residents, 2) shortage of input funds, 3) corporate profitability difficulties, 4) weak policy constraints, and 5) difficulties in integrating goals. In this regard, each participating body still needs to focus on collective interests, coalitional games, break the dilemma society, and promote the long-term management of urban domestic waste.展开更多
无人异构集群相较于单一类型、单一个体的无人平台,能够完成更为复杂的任务,同时对严苛战场环境有着更高的适应度.在无人异构集群协同执行任务时,任务分配是至关重要的环节,需要考虑异构无人平台和任务的多种约束和目标.传统的任务分配...无人异构集群相较于单一类型、单一个体的无人平台,能够完成更为复杂的任务,同时对严苛战场环境有着更高的适应度.在无人异构集群协同执行任务时,任务分配是至关重要的环节,需要考虑异构无人平台和任务的多种约束和目标.传统的任务分配方法分配效率低且难以处理大规模复杂任务.联盟博弈通过形成由若干参与者组成的联盟,根据个体的属性、偏好对群体进行划分,从而实现个体以及群体利益的最大化.本文以无人异构集群任务分配为背景,研究了基于改进联盟博弈算法的最优分配策略,基于可能的战场环境设计了模拟任务场景并完成实验验证.首先,考虑异构平台在任务中的初始位置、速度、携带资源以及个体声誉等因素,建立了基于空间自适应博弈(Spatial adaptive play algorithm, SAP)的联盟博弈的任务分配算法模型.其次,基于任务场景,搭建了任务所需的软件与硬件平台.最后,针对模拟的战场环境,对所提算法及搭建的异构无人集群平台进行了实验验证.验证结果表明,在异构无人集群平台重分配的任务背景下,本平台能综合考虑战场态势,寻找最优的任务分配方式,协调各作战单位完成任务目标.展开更多
The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one fea...The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one feasible cellular user(FCU)can share its RB with multiple V2V pairs.The problem is first formulated as a nonconvex mixed-integer nonlinear programming(MINLP)problem with constraint of the maximum interference power in the FCU links.Using the game theory,two coalition formation algorithms are proposed to accomplish V2V link partitioning and FCU selection,where the transferable utility functions are introduced to minimize the interference among the V2V links and the FCU links for the optimal RB allocation.The successive convex approximation(SCA)is used to transform the original problem into a convex one and the Lagrangian dual method is further applied to obtain the optimal transmit power of the V2V links.Finally,numerical results demonstrate the efficiency of the proposed resource allocation algorithm in terms of the system sum-rate.展开更多
针对服务功能链(service function chain,SFC)请求动态变化导致的航空信息网络中平台负载不均问题,提出了一种基于联盟博弈的SFC迁移算法。该算法将航空平台作为博弈参与者,将SFC实例作为博弈商品,以网络能耗和迁移开销联合优化为目标...针对服务功能链(service function chain,SFC)请求动态变化导致的航空信息网络中平台负载不均问题,提出了一种基于联盟博弈的SFC迁移算法。该算法将航空平台作为博弈参与者,将SFC实例作为博弈商品,以网络能耗和迁移开销联合优化为目标。在算法执行过程中,各航空平台之间相互协作构建博弈联盟,通过联盟之间的比较与交换行为实现SFC迁移及网络资源整合。研究结果表明,所提算法具有较低的计算复杂度、较好的收敛性且能够形成纳什稳定结构。此外,在不同的网络规模下,所提算法均能有效降低网络能耗及网络迁移开销,同时保持较高的不同规模网络的资源利用率。展开更多
Aiming at the coexistence of cellular network and wireless fidelity(WiFi)network,a coalitional game-based WiFi offloading algorithm in heterogeneous networks is proposed.Firstly,this paper defines the user fairness ut...Aiming at the coexistence of cellular network and wireless fidelity(WiFi)network,a coalitional game-based WiFi offloading algorithm in heterogeneous networks is proposed.Firstly,this paper defines the user fairness utility function that comprehensively considers the user communication rate,cost and delay.Then,the coalitional game model including two types of coalitions is constructed.To control the transfer of users among coalitions,a coalition transfer criterion that simultaneously improves the user's individual utility and the total system utility is proposed.In addition,this paper presents a channel allocation scheme that ensures full utilization of system resources to maximize the total utility of the system.The simulation results show that the proposed offloading algorithm can reasonably utilize the resources of cellular network and WiFi network,and improve the utility of users and system.展开更多
In cooperative game theory, a central problem is to allocate fairly the win of the grand coalition to the players who agreed to cooperate and form the grand coalition. Such allocations are obtained by means of values,...In cooperative game theory, a central problem is to allocate fairly the win of the grand coalition to the players who agreed to cooperate and form the grand coalition. Such allocations are obtained by means of values, having some fairness properties, expressed in most cases by groups of axioms. In an earlier work, we solved what we called the Inverse Problem for Semivalues, in which the main result was offering an explicit formula providing the set of all games with an a priori given Semivalue, associated with a given weight vector. However, in this set there is an infinite set of games for which the Semivalues are not coalitional rational, perhaps not efficient, so that these are not fair practical solutions of the above fundamental problem. Among the Semivalues, coalitional rational solutions for the Shapley Value and the Banzhaf Value have been given in two more recent works. In the present paper, based upon a general potential basis, relative to Semivalues, for a given game and a given Semivalue, we solve the connected problem: in the Inverse Set, find out a game with the same Semivalue, which is also coalitional rational. Several examples will illustrate the corresponding numerical technique.展开更多
In the Inverse Set relative to a Semivalue, we are looking for a new game for which the Semivalue of the original game is coalitional rational. The problem is solved by means of the Power Game of the given game. The p...In the Inverse Set relative to a Semivalue, we are looking for a new game for which the Semivalue of the original game is coalitional rational. The problem is solved by means of the Power Game of the given game. The procedures of building the new game, as well as the case of the Banzhaf Value are illustrated by means of some examples.展开更多
文摘The effective classification of urban domestic waste is the key to achieve a “waste-free city” and provides an essential guarantee for resource utilization. This article takes a coalitional game perspective to study the dilemmas in urban domestic waste separation from the cooperative interaction of residents, government, and enterprises. The study finds that urban domestic waste classification in China is currently facing many problems, focusing on: 1) insufficient consensus among residents, 2) shortage of input funds, 3) corporate profitability difficulties, 4) weak policy constraints, and 5) difficulties in integrating goals. In this regard, each participating body still needs to focus on collective interests, coalitional games, break the dilemma society, and promote the long-term management of urban domestic waste.
文摘无人异构集群相较于单一类型、单一个体的无人平台,能够完成更为复杂的任务,同时对严苛战场环境有着更高的适应度.在无人异构集群协同执行任务时,任务分配是至关重要的环节,需要考虑异构无人平台和任务的多种约束和目标.传统的任务分配方法分配效率低且难以处理大规模复杂任务.联盟博弈通过形成由若干参与者组成的联盟,根据个体的属性、偏好对群体进行划分,从而实现个体以及群体利益的最大化.本文以无人异构集群任务分配为背景,研究了基于改进联盟博弈算法的最优分配策略,基于可能的战场环境设计了模拟任务场景并完成实验验证.首先,考虑异构平台在任务中的初始位置、速度、携带资源以及个体声誉等因素,建立了基于空间自适应博弈(Spatial adaptive play algorithm, SAP)的联盟博弈的任务分配算法模型.其次,基于任务场景,搭建了任务所需的软件与硬件平台.最后,针对模拟的战场环境,对所提算法及搭建的异构无人集群平台进行了实验验证.验证结果表明,在异构无人集群平台重分配的任务背景下,本平台能综合考虑战场态势,寻找最优的任务分配方式,协调各作战单位完成任务目标.
基金the National Natural Scientific Foundation of China(61771291,61571272)the Major Science and Technological Innovation Project of Shandong Province(2020CXGC010109).
文摘The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one feasible cellular user(FCU)can share its RB with multiple V2V pairs.The problem is first formulated as a nonconvex mixed-integer nonlinear programming(MINLP)problem with constraint of the maximum interference power in the FCU links.Using the game theory,two coalition formation algorithms are proposed to accomplish V2V link partitioning and FCU selection,where the transferable utility functions are introduced to minimize the interference among the V2V links and the FCU links for the optimal RB allocation.The successive convex approximation(SCA)is used to transform the original problem into a convex one and the Lagrangian dual method is further applied to obtain the optimal transmit power of the V2V links.Finally,numerical results demonstrate the efficiency of the proposed resource allocation algorithm in terms of the system sum-rate.
文摘针对服务功能链(service function chain,SFC)请求动态变化导致的航空信息网络中平台负载不均问题,提出了一种基于联盟博弈的SFC迁移算法。该算法将航空平台作为博弈参与者,将SFC实例作为博弈商品,以网络能耗和迁移开销联合优化为目标。在算法执行过程中,各航空平台之间相互协作构建博弈联盟,通过联盟之间的比较与交换行为实现SFC迁移及网络资源整合。研究结果表明,所提算法具有较低的计算复杂度、较好的收敛性且能够形成纳什稳定结构。此外,在不同的网络规模下,所提算法均能有效降低网络能耗及网络迁移开销,同时保持较高的不同规模网络的资源利用率。
基金supported by the National Natural Science Foundation of China (61971239,61631020)
文摘Aiming at the coexistence of cellular network and wireless fidelity(WiFi)network,a coalitional game-based WiFi offloading algorithm in heterogeneous networks is proposed.Firstly,this paper defines the user fairness utility function that comprehensively considers the user communication rate,cost and delay.Then,the coalitional game model including two types of coalitions is constructed.To control the transfer of users among coalitions,a coalition transfer criterion that simultaneously improves the user's individual utility and the total system utility is proposed.In addition,this paper presents a channel allocation scheme that ensures full utilization of system resources to maximize the total utility of the system.The simulation results show that the proposed offloading algorithm can reasonably utilize the resources of cellular network and WiFi network,and improve the utility of users and system.
文摘In cooperative game theory, a central problem is to allocate fairly the win of the grand coalition to the players who agreed to cooperate and form the grand coalition. Such allocations are obtained by means of values, having some fairness properties, expressed in most cases by groups of axioms. In an earlier work, we solved what we called the Inverse Problem for Semivalues, in which the main result was offering an explicit formula providing the set of all games with an a priori given Semivalue, associated with a given weight vector. However, in this set there is an infinite set of games for which the Semivalues are not coalitional rational, perhaps not efficient, so that these are not fair practical solutions of the above fundamental problem. Among the Semivalues, coalitional rational solutions for the Shapley Value and the Banzhaf Value have been given in two more recent works. In the present paper, based upon a general potential basis, relative to Semivalues, for a given game and a given Semivalue, we solve the connected problem: in the Inverse Set, find out a game with the same Semivalue, which is also coalitional rational. Several examples will illustrate the corresponding numerical technique.
文摘In the Inverse Set relative to a Semivalue, we are looking for a new game for which the Semivalue of the original game is coalitional rational. The problem is solved by means of the Power Game of the given game. The procedures of building the new game, as well as the case of the Banzhaf Value are illustrated by means of some examples.
