2010
DOI: 10.1051/mmnp/20105720
|View full text |Cite
|
Sign up to set email alerts
|

Split of an Optimization Variable in Game Theory

Abstract: Abstract. In the present paper, a general multiobjective optimization problem is stated as a Nash game. In the nonrestrictive case of two objectives, we address the problem of the splitting of the design variable between the two players. The so-called territory splitting problem is solved by means of an allocative approach. We propose two algorithms in order to find fair allocation tables.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0
1

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 2 publications
0
7
0
1
Order By: Relevance
“…Proof. As u is a solution of problem (1), then u is the unique solution of the following minimization problem:…”
Section: Setting Of the Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…Proof. As u is a solution of problem (1), then u is the unique solution of the following minimization problem:…”
Section: Setting Of the Problemmentioning
confidence: 99%
“…The procedure described above does not require any great programming efforts in order to solve the compliance topology design problem. In the case of compliance optimization, the state or displacements u is the solution of the linear elasticity equation (1). We use P 2 × P 2 Lagrange finite elements to .…”
Section: Setting Of the Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…Notre but à présent est de montrer que le meilleur partage qu'on obtient par les deux algorithmes (AG1) et (AG2), donne un équilibre de Nash qui appartient au front de Pareto ou bien proche du front. Le front de Pareto est l'ensemble des solutions non dominées [1]. Lorsque le front de Pareto est convexe, on peut trouver tous ses points en minimisant…”
Section: Construction Deunclassified
“…CVaR has attractive theoretical properties: it controls the magnitude of losses beyond Valueat-Risk (VaR) and it is coherent (see for example Artzner 1999, Acerbi and Tasche 2002, Tasche 2002, Pflug 2000, Rockafellar and Uryasev 2002). In this paper we propose to solve the problem of portfolio selection, which is a multi-objective problem, first by using the NBI approach [8] based on SASP method [7], implemented in Matlab to find the efficient boundary, after we use the game theory [3,4] …”
Section: Introductionmentioning
confidence: 99%