• Aucun résultat trouvé

[PDF] Top 20 Congestion games with player-specific cost functions

Has 10000 "Congestion games with player-specific cost functions" found on our website. Below are the top 20 most common "Congestion games with player-specific cost functions".

Congestion games with player-specific cost functions

Congestion games with player-specific cost functions

... consider congestion games on graphs with nonatomic users and user-specific ...increasing cost functions. He settled the case with two-terminal ...graphs with ... Voir le document complet

157

SENSITIVITY OF EQUILIBRIUM IN ATOMIC CONGESTION GAMES WITH PLAYER-SPECIFIC COST FUNCTIONS

SENSITIVITY OF EQUILIBRIUM IN ATOMIC CONGESTION GAMES WITH PLAYER-SPECIFIC COST FUNCTIONS

... (graph, cost functions and demands) on the ...nonatomic congestion games and formulas have been designed in order to perform the sensitivity analysis, see Tobin and Friesz [1988], Qiu and ... Voir le document complet

15

On the performance of congestion games for optimum satisfiability problems

On the performance of congestion games for optimum satisfiability problems

... a cost/latency function which depends on the number of players who use ...Each player selfishly selects her path in order to minimize her total cost/latency, ...total cost/latency experimented ... Voir le document complet

15

Congestion Games with Capacitated Resources

Congestion Games with Capacitated Resources

... his cost is either equal to +∞ or equal to the cost previously incurred by ...No player from ˆ N placed on resource s has incentive to move, since otherwise the player can do it before the ... Voir le document complet

12

On the performance of congestion games for optimum satisfiability problems

On the performance of congestion games for optimum satisfiability problems

... a cost/latency function which depends on the number of players who use ...Each player selfishly selects her path in order to minimize her total cost/latency, ...total cost/latency experimented ... Voir le document complet

15

The Complexity of Welfare Maximization in Congestion Games

The Complexity of Welfare Maximization in Congestion Games

... associated cost functions. With regards to structure, we consider whether all players have the same set of strategies (symmetric) or not ...of congestion and economies of ...network ... Voir le document complet

15

Congestion Games with Capacitated Resources

Congestion Games with Capacitated Resources

... Singleton congestion games with priorities (without player specific delay functions) are potential games, and a pure NE can be found in polynomial time ...[1]. ... Voir le document complet

14

Influence functions, followers and command games

Influence functions, followers and command games

... Success of every activity in life depends to a high degree on how well one can influence others. The influence ability helps when creating a favorable impression on others about ourselves and our achievements, e.g., when ... Voir le document complet

24

Influence functions, followers and command games

Influence functions, followers and command games

... – The notion of equivalence between a command game and an influence function (see Definition 2) is the key notion permitting to compare the two frameworks, and this notion is naturally dictated by the definitions of ... Voir le document complet

25

Influence functions, followers and command games

Influence functions, followers and command games

... simple games, which was introduced fifty years ago in [19], to qualitatively compare the a priori influence of voters in a simple ...voting games with ... Voir le document complet

25

OWA-Based Search in State Space Graphs with Multiple Cost Functions

OWA-Based Search in State Space Graphs with Multiple Cost Functions

... w m, which leads to give a greater importance to high-cost components. This preoccupation is natural when looking for well-balanced solutions. Note that criterion max also fo- cuses on well-balanced solutions, but ... Voir le document complet

6

Belief propagation analysis in two-player games for peer-influence social networks

Belief propagation analysis in two-player games for peer-influence social networks

... interactions with their neighbors. A dynamic, two player game is formulated whereby each player strategically controls the placement of one stubborn agent over time in order to maximally influence ... Voir le document complet

153

A Formal Study of Boolean Games with Random Formulas as Payoff Functions

A Formal Study of Boolean Games with Random Formulas as Payoff Functions

... Still, a more refined study of the behaviour of the function that describes the growth of g(s) (the probability of a guaranteed win depending on s) requires much more effort and space that we could give to it in this ... Voir le document complet

23

Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information

Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information

... information games were addressed by several researchers ...stochastic games: the reward and the transition probabilities in each state are controlled at most by one ...information games under the ... Voir le document complet

26

Guaranteed Inertia Functions in Dynamical Games

Guaranteed Inertia Functions in Dynamical Games

... inertia functions. Two examples of inertia functions are provided: In section 4, the inertia function of the basic equation of population dynamics and in section 5, an example of management of renewable ... Voir le document complet

41

Dynamic Duopoly with Congestion Effects

Dynamic Duopoly with Congestion Effects

... Mots clés : duopole, jeux différentiels, équilibre markovien parfait. We analyze duopolistic competition between horizontally differentiated firms selling durable goods or services subject to congestion. At each ... Voir le document complet

36

Mean field type control with congestion

Mean field type control with congestion

... system with the Hamiltonian given in ...case with β = 2 and α = 1, see [10]; in the latter case, a very special trick can be ...MFG with congestion cannot be seen as an optimal control problem ... Voir le document complet

20

Optimal density evolution with congestion: L infinity bounds via flow interchange techniques and applications to variational Mean Field Games

Optimal density evolution with congestion: L infinity bounds via flow interchange techniques and applications to variational Mean Field Games

... (1.3) with this choice of ρ t . For a general introduction to mean field games, other than the papers by Lasry-Lions and Huang-Malhamé-Caines, the reader can consult the lecture notes by Cardaliaguet [14], ... Voir le document complet

31

Congestion load balancing game with losses

Congestion load balancing game with losses

... a congestion type load balancing game in which traffic originates from two source nodes and is destined to the center ...given player is assumed to form an independent Poisson process with some ... Voir le document complet

5

Cost–benefit analysis of age‐specific deconfinement strategies

Cost–benefit analysis of age‐specific deconfinement strategies

... curve with a 100% confinement of the seniors and a partial confinement of the other two age ...policies with the set of parameters described in Table ... Voir le document complet

33

Show all 10000 documents...