Results 31 to 40 of about 166,027,039 (183)

The social cost of congestion games by imposing variable delays

open access: yesICT Express, 2017
In this study, we describe a new coordination mechanism for non-atomic congestion games that leads to a (selfish) social cost which is arbitrarily close to the non-selfish optimal.
Josep Díaz   +4 more
doaj   +1 more source

Analysis of Date’s Market Functioning (Phoenix Dactylifera L), in Ouargla, South-Est of Algeria: Challenges and Constraints [PDF]

open access: yesAl-Qadisiyah Journal For Agriculture Sciences, 2022
This study aims to analyse date’s market functioning and constraints that are facing it in Southeast of Algeria, Ouargla region. To analyze potential market pathways (traders, collectors and intermediaries) 100 respondents were randomly selected ...
Ben sayah Faiza
doaj   +1 more source

Mean-Field Type Games between Two Players Driven by Backward Stochastic Differential Equations

open access: yesGames, 2018
In this paper, mean-field type games between two players with backward stochastic dynamics are defined and studied. They make up a class of non-zero-sum, non-cooperating, differential games where the players’ state dynamics solve backward ...
Alexander Aurell
doaj   +1 more source

Fighting for Routes: Resource Allocation among Competing Planners in Transportation Networks

open access: yesGames, 2023
In transportation networks, incomplete information is ubiquitous, and users often delegate their route choice to distributed route planners. To model and study these systems, we introduce network control games, consisting of multiple actors seeking to ...
Charlotte Roman, Paolo Turrini
doaj   +1 more source

The price of anarchy in bertrand games [PDF]

open access: yesProceedings of the 10th ACM conference on Electronic commerce, 2009
The Internet is composed of multiple economically-independent service providers that sell bandwidth in their networks so as to maximize their own revenue. Users, on the other hand, route their traffic selfishly to maximize their own utility. How does this selfishness impact the efficiency of operation of the network? To answer this question we consider
Shuchi Chawla 0001, Feng Niu
openaire   +2 more sources

Distribution Games: A New Class of Games With Application to User Provided Networks

open access: yesIEEE Access, 2022
User Provided Network (UPN) is a promising solution for sharing the limited network resources by utilizing user capabilities as a part of the communication infrastructure.
Sinan Emre Tasci   +2 more
doaj   +1 more source

On the Price of Anarchy for flows over time [PDF]

open access: yesProceedings of the 2019 ACM Conference on Economics and Computation, 2019
Dynamic network flows, or network flows over time, constitute an important model for real-world situations in which steady states are unusual, such as urban traffic and the internet. These applications immediately raise the issue of analyzing dynamic network flows from a game-theoretic perspective.
José Correa 0001   +2 more
openaire   +4 more sources

Selfish traffic allocation for server farms [PDF]

open access: yes, 2010
We study the price of selfish routing in noncooperative networks like the Internet. In particular, we investigate the price of selfish routing using the price of anarchy (a.k.a.
Czumaj, Artur   +2 more
core   +1 more source

The price of anarchy for polynomial social cost [PDF]

open access: yesTheoretical Computer Science, 2004
In this work, we consider an interesting variant of the well-studied KP model [KP99] for selfish routing that reflects some influence from the much older Wardrop [War52]. In the new model, user traffics are still unsplittable, while social cost is now the expectation of the sum, over all links, of a certain polynomial evaluated at the total ...
Gairing, M.   +7 more
openaire   +8 more sources

The Price of Anarchy for Instantaneous Dynamic Equilibria [PDF]

open access: yesMathematics of Operations Research, 2020
We consider flows over time within the deterministic queueing model of Vickrey and study the solution concept of instantaneous dynamic equilibrium (IDE), in which flow particles select at every decision point a currently shortest path. The length of such a path is measured by the physical travel time plus the time spent in queues.
Lukas Graf, Tobias Harks
openaire   +3 more sources

Home - About - Disclaimer - Privacy