Results 231 to 240 of about 4,555 (277)
Some of the next articles are maybe not open access.
Games and Economic Behavior, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nir Andelman +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nir Andelman +2 more
openaire +3 more sources
Journal of Intelligent Transportation Systems / Taylor & Francis, 2021
In the scientific literature, the ratio between the total travel cost under a user equilibrium assignment and the total travel cost under a system optimum assignment is typically referred to as the Price of Anarchy (PoA), i.e., the level of inefficiency ...
A. Belov +4 more
semanticscholar +1 more source
In the scientific literature, the ratio between the total travel cost under a user equilibrium assignment and the total travel cost under a system optimum assignment is typically referred to as the Price of Anarchy (PoA), i.e., the level of inefficiency ...
A. Belov +4 more
semanticscholar +1 more source
The price of anarchy in loss systems
Naval Research Logistics, 2021Assume a multi‐server memoryless loss system. Each server is associated with a service rate and a value of service. Customers from a common Poisson arrival process are routed to the servers in an unobservable way, where the goal is to maximize the long ...
Shoshana Anily, M. Haviv
semanticscholar +1 more source
Price of Anarchy for Green Digital Twin Enabled Logistics
International Symposium on Computers and CommunicationsIn the era of smart cities and Industry 4.0, Digital Twin (DT) technologies have emerged as transformative tools for optimizing urban and industrial systems.
Manuele Favero +3 more
semanticscholar +1 more source
Journal of the Operational Research Society
Most research on scheduling games assumes a single-job model, where each job can be seen as a distinct player. Every player decides to assign her job to a machine to minimize her own completion time according to a local policy for ordering jobs on a ...
Po-An Chen +4 more
semanticscholar +1 more source
Most research on scheduling games assumes a single-job model, where each job can be seen as a distinct player. Every player decides to assign her job to a machine to minimize her own completion time according to a local policy for ordering jobs on a ...
Po-An Chen +4 more
semanticscholar +1 more source
Improving the Price of Anarchy via Predictions in Parallel-Link Networks
Proceedings of the ACM Web Conference 2026We study non-atomic congestion games on parallel-link networks with polynomial latencies. We investigate the power of machine-learned predictions in the design of coordination mechanisms aimed at minimizing the impact of selfishness.
George Christodoulou +3 more
semanticscholar +1 more source
Price of anarchy in parallel processing
Information Processing Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lingfei Yu +3 more
openaire +2 more sources
D3C: Reducing the Price of Anarchy in Multi-Agent Learning
Adaptive Agents and Multi-Agent Systems, 2020In multiagent systems, the complex interaction of fixed incentives can lead agents to outcomes that are poor (inefficient) not only for the group, but also for each individual.
I. Gemp +6 more
semanticscholar +1 more source
Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology
Workshop on Internet and Network Economics, 2020We investigate traffic routing both from the perspective of real world data as well as theory. First, we reveal through data analytics a natural but previously uncaptured regularity of real world routing behavior.
F. Benita +4 more
semanticscholar +1 more source
On the Sequential Price of Anarchy of Isolation Games
Journal of Combinatorial Optimization, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anna Angelucci +3 more
openaire +6 more sources