CN108768980A - A kind of multicast mechanism design method generated based on core constraint - Google Patents
A kind of multicast mechanism design method generated based on core constraint Download PDFInfo
- Publication number
- CN108768980A CN108768980A CN201810472825.1A CN201810472825A CN108768980A CN 108768980 A CN108768980 A CN 108768980A CN 201810472825 A CN201810472825 A CN 201810472825A CN 108768980 A CN108768980 A CN 108768980A
- Authority
- CN
- China
- Prior art keywords
- original graph
- vector
- simplification
- tree
- payoff
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000007246 mechanism Effects 0.000 title claims abstract description 57
- 238000000034 method Methods 0.000 title claims abstract description 13
- 239000013598 vector Substances 0.000 claims abstract description 44
- 239000011159 matrix material Substances 0.000 claims abstract description 6
- 230000008901 benefit Effects 0.000 description 2
- 238000005553 drilling Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 241001510071 Pyrrhocoridae Species 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/60—Network streaming of media packets
- H04L65/61—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio
- H04L65/611—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio for multicast or broadcast
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/16—Multipoint routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
- H04L63/1491—Countermeasures against malicious traffic using deception as countermeasure, e.g. honeypots, honeynets, decoys or entrapment
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention proposes a kind of multicast mechanism design method generated based on core constraint, includes the following steps：1) simplification figure is generated；2) minimum spanning tree is built in simplification figure, and calculates to obtain corresponding Steiner minimal tree in original graph；3) initialization payoff vector is VCG mechanism payoff vectors, and constraint matrix and constrained vector are empty set；4) side right of Steiner minimal tree is set to the value of each dimension of current payoff vector, and recalculates Steiner minimal tree；If 5) Steiner minimal tree recalculated remains unchanged, current payoff vector is exported, terminates iteration；Otherwise the new constraint corresponding to new, old Steiner minimal tree difference set is generated, and will newly constrain and be added in constraint matrix and constrained vector, then new payoff vector, return to step 4 are obtained by newly-generated constraint matrix and constrained vector).The present invention is the multicast mechanism of defensive assumed name attack, and solves excessive payment problem of the VCG mechanism in multicast mechanism design.
Description
Technical field
The present invention relates to multicast auction mechanism design field, especially a kind of multicast mechanism design based on core selection constraint
Method.
Background technology
Multicast is one-to-many communication means.Single data packet is sent to multiple destination nodes by multicast.It is every in network
Side hold by rationality, from the intelligent body of profit.Multicast host needs " to buy " in network to send the data to destination node
Side go structure multicast tree.Hold while intelligent body in order to improve cost when self benefits may be lied about, and assumed name can be carried out
The frauds such as attack.Multicast mechanism design problem is to design the mechanism that intelligent body honesty can be encouraged to bid, and as far as possible
Reduce the cost of multicast tree.In multicast mechanism design, mechanism output result includes multicast tree and pays and hold multicast tree
The price of the intelligent body on middle side, i.e. payoff vector.
In multicast mechanism design, steiner tree can be seen as by being connected to the multicast tree of all destination nodes.Effective multicast mechanism
Refer to selecting Steiner minimal tree as the multicast mechanism of output result.Steiner minimal tree computational problem is NP-hard problems.
In the multicast mechanism design selected based on core, it is assumed that there was only destination node and bridging nodes in network.The bridging nodes number of degrees are
2.It is connected directly between destination node, or is connected by several bridging nodes.Effective multicast mechanism is social welfare maximization
Mechanism.In effective mechanism, the sum of effectiveness of all mechanism participants and auctioneer is maximum.VCG mechanism is uniquely to encourage
Compatible effective mechanism.But in multicast scene, VCG mechanism can not defend assumed name to attack, and there are serious excessive payment problems.
Therefore, design can defend the effective multicast mechanism that assumed name is attacked, " excessively payment " problem of settlement mechanism to seem particularly significant.
Invention content
Goal of the invention：In order to solve the above technical problems, the present invention proposes that a kind of multicast mechanism based on core selection constraint is set
Meter method effectively can defend assumed name to attack.
Technical solution：Technical solution proposed by the present invention is：
A kind of multicast mechanism design method based on core selection constraint, including step：
(1) multicast network topology figure is obtained as original graph G, calculates original graph G the payoff vector of VCG mechanismAccording to
Original graph generates simplification figure G ', and simplification figure G ' includes all destination nodes in original graph G, two destination nodes in simplification figure G '
Between side right cost be to be connected directly between corresponding two destination node in original graph G or only by several bridging nodes phases
The length of shortest path even；
(2) minimum spanning tree is calculated in simplification figure G '；It is calculated and simplification figure G ' minimum spanning trees in original graph G
Corresponding Steiner minimal tree t；
(3) structure core constrains generating algorithm model：
Set payoff vectorConstraint matrix B and constrained vectorInitialization
(4) generating algorithm model is constrained by iteratively solving core, obtains optimal payoff vector, the step of solution includes (4-
1) to (4-4)：
(4-1) sets the weights on each side in Steiner minimal tree t to payoff vectorThe value of middle corresponding dimension, then
Recalculate Steiner minimal tree t '；
(4-2) judges whether to meet t '=t；If satisfied, then exporting payoff vectorAs optimal payoff vector, terminate to change
Generation；If not satisfied, thening follow the steps (4-3)；
(4-3) calculates z=t-t '；Defined variable biAnd intermediate vectorN be stainer most
The number on side in little tree t,Calculating z's is unsatisfactory for constraining：
γz=d (G-z)-d (G)+∑i∈zxi
Wherein,For the constrained vector of z, d (G) is the Steiner minimal tree that all destination nodes are connected in original graph G
Cost；D (G-z) is the cost for the Steiner minimal tree that all destination nodes are connected to after removing line set z in original graph G, if
There is no such Steiner minimal trees to be connected to all destination nodes, then d (G-z) is just infinite；xiFor in Steiner minimal tree
The cost on i-th side；
Update
(4-4) according to updated B andIt solves and meetsAndCore constraint generating algorithm model maximum
Payment and α；Wherein,For the cost vector in original graph G, it is made of the cost on all sides in original graph G；
It selects the maximum of multicast mechanism to regret value k as target problem to minimize core, solves and meet sorry value constraints
Payoff vectorSorry value constraints is：
Return to step (4-1).
Further, the VGG mechanism payoffs of each edge are in the original graph G：pi=d (G)-d (G-i)+xi；Wherein,
piFor the VGG mechanism payoffs of side i in original graph G, the VGG mechanism payoffs on all sides constitute payoff vector in original graph Gd
(G-i) it is the cost for removing the Steiner minimal tree that all destination nodes are connected to after the i of side in original graph G.
Further, the step of generation simplification figure G ' is：
1) all destination nodes in original graph G are added in simplification figure G ', the side collection of simplification figure G ' is initialized as sky
Collection；
2) each side e, the destination node A and destination node that e is encountered for the first time from side in traversal original graph G
B；If from destination node A can be reached by bridging nodes target node b or destination node A directly with target node b phase
Even, then it will be concentrated when AB is added to simplification figure G ', side on the middle sides existed from destination node A to target node b figure G '
The cost of AB be original graph in destination node A to the shortest path between target node b value at cost.
Advantageous effect：Compared with prior art, the present invention has the advantage that：
The present invention is based on the cores in cooperative game to select constrained procedure, designs the multicast machine that assumed name can be defendd to attack
System, solves excessive payment problem existing for VCG mechanism, and mechanism execution efficiency is improved using core constraint generating algorithm.
Description of the drawings
Fig. 1 is that the present invention is based on the multicast mechanism design method flow charts of core selection constraint；
Fig. 2 is the schematic diagram about destination node and bridging nodes in embodiment；
Fig. 3 is the flow chart that the payment of VCG mechanism calculates in the present invention；
Fig. 4 is simplification figure product process figure in the present invention.
Specific implementation mode
The present invention is further described below in conjunction with the accompanying drawings.
Fig. 2 is multicast concept explanation figure.It is divided into two types node, destination node and bridging nodes in multicast network.Such as
Shown in Fig. 2, destination node A is connected with target node b by two paths, respectively：The path of bridging nodes 1, bridging nodes 2
Only pass through the path of bridging nodes 3.It is 6 by bridging nodes 1 and the path totle drilling cost of bridging nodes 2 being connected.Only pass through
The connected path totle drilling cost of bridging nodes 3 is 10.
Fig. 3 is the computational methods of the payment of each edge in VCG mechanism.As shown in figure 3, in VCG mechanism each edge payment
It can be by formula pi=d (G)-d (G-i)+xiIt is calculated, wherein piFor the VGG mechanism payoffs of side i in original graph G, original graph
The VGG mechanism payoffs on all sides constitute payoff vector in GD (G-i) is to be connected to all targets after removing side i in original graph G
The cost of the Steiner minimal tree of node.Cycle, which executes the formula, can obtain the valence on all sides that VCG mechanism is paid in multicast tree
Lattice.
Fig. 1 is that the present invention is based on the multicast mechanism design method flow charts of core selection constraint, including four-stage：
One, simplification figure generation phase, the stage is as shown in figure 3, be implemented as follows：
(1) obtain multicast network topology figure as original graph G, to original graph G application VCG mechanism to calculate VCG machines
The payoff vector of systemAll destination nodes in original graph G are added in simplification figure G ', the side collection of simplification figure G ' is left
It is empty.
(2) each side e in traversal original graph G.The destination node A and target section that e is encountered for the first time from side
Point B.If only target node b can be reached bridging nodes or by way of being connected directly from destination node A, that
Then there is the side from destination node A to target node b in scheming G '.This side right value is that destination node A exists to target node b
It is connected directly in original graph or only by the length of the connected shortest path of bridging nodes.The side of computational short cut figure and side right cost
When, need record simplification figure in corresponding original graph while.Side right in primitive network is the bid of mechanism participant
VectorIt is given.
The simplification figure G ' obtained by above-mentioned steps includes all destination nodes in original graph G, arbitrary in original graph G
At most there is a line between two destination nodes, and the side is the shortest path in original graph G between corresponding two destination node.
2) Steiner minimal tree calculation stages：
Minimum spanning tree is calculated in simplification figure G '；It is calculated and simplification figure G ' minimum spanning tree phases in original graph G
Corresponding Steiner minimal tree t.
3) core of initialization core selection mechanism constrains generation phase：
Set payoff vectorConstraint matrix B and constrained vectorInitialization
4) the payoff vector stage is iteratively solved：
A, the weights on each side in Steiner minimal tree t are set to payoff vectorThe value of middle corresponding dimension, then weighs
It is new to calculate Steiner minimal tree t '；
B, judge whether to meet t '=t；If satisfied, then exporting payoff vectorAs optimal payoff vector, terminate iteration；
If not satisfied, thening follow the steps c；
C, z=t-t ' is calculated；Defined variable biAnd intermediate vectorN is Steiner minimal tree
The sum on side in t, for all i ∈ { 1 .., n }, if i ∈ z, enable bi=1, otherwise enable bi=0, i.e.,
Calculating z's is unsatisfactory for constraining：
γz=d (G-z)-d (G)+∑i∈zxi
Wherein, γzFor the binding occurrence of z, d (G) be connected in original graph G all destination nodes Steiner minimal tree at
This；D (G-z) is the cost for the Steiner minimal tree that all destination nodes are connected to after removing line set z in original graph G, if not
There are such Steiner minimal trees to be connected to all destination nodes, then d (G-z) is just infinite；xiIt is in Steiner minimal tree i-th
The cost on side；
Update
D, by B andIt substitutes into following linear programming and solves α：
Solve target：
It submits to restraint：
α be core constrain generating algorithm model maximum payment and；For the cost vector in original graph G, by original graph G
The cost on all sides forms.
By B,It is substituted into following linear programming with α and solves payoff vector
It minimizes：k
It submits to restraint：
K is the sorry value of maximum for minimizing core selection multicast mechanism；Return to step a.
The present invention is based on the designs of cooperative game center selection method effectively, the multicast mechanism that assumed name can be defendd to attack.
Core selects multicast mechanism on the basis of the maximum for minimizing the quotation of mechanism participant's honesty sorry value, solves the mistake of VCG mechanism
Spend payment problem.
The above is only a preferred embodiment of the present invention, it should be pointed out that：For the ordinary skill people of the art
For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also answered
It is considered as protection scope of the present invention.
Claims (3)
1. a kind of multicast mechanism design method based on core selection constraint, which is characterized in that including step：
(1) multicast network topology figure is obtained as original graph G, calculates original graph G the payoff vector of VCG mechanismAccording to original
Figure generates simplification figure G ', and simplification figure G ' includes all destination nodes in original graph G, in simplification figure G ' between two destination nodes
Side right cost is to be connected directly or be only connected by several bridging nodes between corresponding two destination node in original graph G
The length of shortest path；
(2) minimum spanning tree is calculated in simplification figure G '；It is calculated in original graph G opposite with simplification figure G ' minimum spanning trees
The Steiner minimal tree t answered；
(3) structure core constrains generating algorithm model：
Set payoff vectorConstraint matrix B and constrained vectorInitialization
(4) constrain generating algorithm model by iteratively solving core, obtain optimal payoff vector, the step of solution include (4-1) extremely
(4-4)：
(4-1) sets the weights on each side in Steiner minimal tree t to payoff vectorThe value of middle corresponding dimension, then again
Calculate Steiner minimal tree t '；
(4-2) judges whether to meet t '=t；If satisfied, then exporting payoff vectorAs optimal payoff vector, terminate iteration；If
It is unsatisfactory for, thens follow the steps (4-3)；
(4-3) calculates z=t-t '；Defined variable biAnd intermediate vectorN is Steiner minimal tree t
The number on middle side,Calculating z's is unsatisfactory for constraining：
γz=d (G-z)-d (G)+∑i∈zxi
Wherein, γzFor the binding occurrence of z, d (G) is the cost for the Steiner minimal tree that all destination nodes are connected in original graph G；d
(G-z) it is the cost for removing the Steiner minimal tree that all destination nodes are connected to after line set z in original graph G, if there is no
Such Steiner minimal tree is connected to all destination nodes, then d (G-z) is just infinite；xiIt is i-th in Steiner minimal tree t
The cost on side；
Update
(4-4) according to updated B andIt solves and meetsAndCore constraint generating algorithm model maximum payment
And α；Wherein,For the side right cost vector of Steiner minimal tree t in original graph G, by Steiner minimal tree t in original graph G
The cost on all sides forms；
It selects the maximum of multicast mechanism to regret value k as target problem to minimize core, solves the branch for meeting sorry value constraints
Pay vectorSorry value constraints is：
Return to step (4-1).
2. a kind of multicast mechanism design method generated based on core constraint according to claim 1, which is characterized in that described
The VGG mechanism payoffs of each edge are in original graph G：pi=d (G)-d (G-i)+xi；Wherein, piFor the VGG of side i in original graph G
Mechanism payoff, the VGG mechanism payoffs on all sides constitute payoff vector in original graph GD (G-i) is to remove in original graph G
The cost of the Steiner minimal tree of all destination nodes is connected to after the i of side.
3. a kind of multicast mechanism design method generated based on core constraint according to claim 2, which is characterized in that described
Generate simplification figure G ' the step of be：
1) all destination nodes in original graph G are added in simplification figure G ', the side collection of simplification figure G ' is initialized as empty set；
2) each side e, the destination node A and target node b that e is encountered for the first time from side in traversal original graph G；If
Target node b can be reached from destination node A by bridging nodes or destination node A is directly connected with target node b, then
There is side from destination node A to target node b figure G ' is middle, will be concentrated when AB is added to simplification figure G ', side AB at
Originally it is the value at cost of destination node A in original graph to the shortest path between target node b.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810472825.1A CN108768980B (en) | 2018-05-17 | 2018-05-17 | Multicast mechanism design method based on kernel constraint generation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810472825.1A CN108768980B (en) | 2018-05-17 | 2018-05-17 | Multicast mechanism design method based on kernel constraint generation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108768980A true CN108768980A (en) | 2018-11-06 |
| CN108768980B CN108768980B (en) | 2021-08-17 |
Family
ID=64008318
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810472825.1A Active CN108768980B (en) | 2018-05-17 | 2018-05-17 | Multicast mechanism design method based on kernel constraint generation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108768980B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101175042A (en) * | 2007-11-14 | 2008-05-07 | 北京科技大学 | Multicast randomizing routing method based on virtual Stener tree |
| CN101527680A (en) * | 2009-02-20 | 2009-09-09 | 西部矿业股份有限公司 | DDMC-based delay-constrained multicast routing method |
| CN101815336A (en) * | 2010-01-14 | 2010-08-25 | 北京科技大学 | Multicast routing method based on cooperative sensing in wireless self-organizing network |
| US20140307614A1 (en) * | 2005-11-30 | 2014-10-16 | Pcms Holdings, Inc. | Mobility-aware mesh construction algorithm for low data-overhead multicast ad hoc routing |
| CN104618130A (en) * | 2014-12-09 | 2015-05-13 | 中国人民解放军国防科学技术大学 | Minimum cost synchronization method of data center network controller by using software |
| US20170201451A1 (en) * | 2016-01-08 | 2017-07-13 | Telefonaktiebolaget Lm Ericsson (Publ) | Graph construction for computed spring multicast |
-
2018
- 2018-05-17 CN CN201810472825.1A patent/CN108768980B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140307614A1 (en) * | 2005-11-30 | 2014-10-16 | Pcms Holdings, Inc. | Mobility-aware mesh construction algorithm for low data-overhead multicast ad hoc routing |
| CN101175042A (en) * | 2007-11-14 | 2008-05-07 | 北京科技大学 | Multicast randomizing routing method based on virtual Stener tree |
| CN101527680A (en) * | 2009-02-20 | 2009-09-09 | 西部矿业股份有限公司 | DDMC-based delay-constrained multicast routing method |
| CN101815336A (en) * | 2010-01-14 | 2010-08-25 | 北京科技大学 | Multicast routing method based on cooperative sensing in wireless self-organizing network |
| CN104618130A (en) * | 2014-12-09 | 2015-05-13 | 中国人民解放军国防科学技术大学 | Minimum cost synchronization method of data center network controller by using software |
| US20170201451A1 (en) * | 2016-01-08 | 2017-07-13 | Telefonaktiebolaget Lm Ericsson (Publ) | Graph construction for computed spring multicast |
Non-Patent Citations (5)
| Title |
|---|
| LEI ZHANG: "False-Name-Proof Mechanisms for Path Auctions in Social Networks", 《22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI)》 * |
| PEDRO M RUIZ: "Approximating optimal multicast trees in wireless multihop networks", 《INTERNATIONAL SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS》 * |
| UYEN TRANG NGUYEN: "Multicast Routing in Wireless Mesh Networks: Minimum Cost Trees or Shortest Path Trees?", 《IEEE COMMUNICATIONS MAGAZINE》 * |
| WANG N: "Approximation for strategic single point weighted steiner tree problem", 《IEEE INTERNATIONAL CONFERENCE ON AGENTS》 * |
| 李宪越: "关于一些网络最优化问题的近似算法的研究", 《中国博士学位论文全文数据库 基础科学辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108768980B (en) | 2021-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20190325519A1 (en) | Determination of implied orders in a trade matching system | |
| Sandholm et al. | CABOB: A fast optimal algorithm for combinatorial auctions | |
| US7305363B1 (en) | Method for optimal winner determination in combinatorial auctions | |
| US20180018700A1 (en) | Method and Device and System for Processing Promotion Information | |
| US8744924B2 (en) | System and method for the efficient clearing of spectrum encumbrances | |
| CN103299269B (en) | The network optimization | |
| CN107067281A (en) | The double-deck price competing method of micro-capacitance sensor electricity market based on multiple agent and game method | |
| US20030225677A1 (en) | Combinatorial auction branch on bid searching method and apparatus | |
| Puspita et al. | Improved models of internet charging scheme of single bottleneck link in multi QoS networks | |
| AU9090398A (en) | Order processing apparatus and method | |
| CN113671987A (en) | Multi-machine distributed time sequence task allocation method based on non-deadlock contract network algorithm | |
| US7716110B2 (en) | Branch on bid searching method and apparatus | |
| Hershberger et al. | Vickrey pricing in network routing: Fast payment computation | |
| CN111189455B (en) | Unmanned aerial vehicle route planning method, system and storage medium | |
| CN108768980A (en) | A kind of multicast mechanism design method generated based on core constraint | |
| CN108833993A (en) | A kind of network video distribution method of cost sensitivity | |
| CN107016048A (en) | The tree-type pipe network intelligent search method of Saint-venant Equations is solved based on chasing method | |
| CN109255673A (en) | A kind of electric power stock emulation contest transaction settlement method | |
| CN115879725A (en) | Electric power spot market clearing method and system | |
| CN110766553B (en) | Resource transfer method, device, system, electronic equipment and medium | |
| Avarikioti et al. | Musketeer: Incentive-Compatible Rebalancing for Payment Channel Networks | |
| Singh et al. | A novel application of ACO to price transmission rights in electricity markets | |
| Kishimoto et al. | Evaluation of auction-based multi-robot routing by parallel simulation | |
| Jain | Efficient market mechanisms and simulation-based learning for multi-agent systems | |
| Meertens et al. | The nucleolus of trees with revenues |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |