Worst-case equilibria
From MaRDI portal
Publication:3409969
Recommendations
Cited in
(only showing first 100 items - show all)- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- A coordination mechanism for a scheduling game with uniform-batching machines
- The price of anarchy of affine congestion games with similar strategies
- A multiple access game with incomplete information
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks
- Decentralized subcontractor scheduling with divisible jobs
- Tight inefficiency bounds for perception-parameterized affine congestion games
- Resilience of routing in parallel link networks
- Cost sharing mechanisms for fair pricing of resource usage
- The intermediate price of anarchy (IPoA) in bin packing games
- Scheduling to Maximize Participation
- Facets of the fully mixed Nash equilibrium conjecture
- Capacitated network design games
- Inefficiency of games with social context
- Schelling games on graphs
- Achieving target equilibria in network routing games without knowing the latency functions
- Linear-quadratic mean-field-type games: a direct method
- On cost sharing in the provision of a binary and excludable public good
- Evaluating the effect of sub-optimality
- Toll caps in privatized road networks
- Multistage interval scheduling games
- A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis
- Collusion in atomic splittable routing games
- A new lower bound on the price of anarchy of selfish bin packing
- Online learning of Nash equilibria in congestion games
- Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
- Performance of non-cooperative routing over parallel non-observable queues
- Agent incentives of a proportional sharing mechanism in resource sharing
- Competitive contagion in networks
- How to find Nash equilibria with extreme total latency in network congestion games?
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
- Facets of the Fully Mixed Nash Equilibrium Conjecture
- Distributed Learning of Wardrop Equilibria
- Altruistic Hedonic Games
- The buck-passing game
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- Bounding the inefficiency of compromise in opinion formation
- Scheduling to maximize participation
- Edge pricing of multicommodity networks for selfish users with elastic demands
- Strongly polynomial-time truthful mechanisms in one shot
- Cost sharing in production economies
- The price of stability of weighted congestion games
- The price of stability of weighted congestion games
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- Risk-based models for emergency shelter and exit design in buildings
- The curse of sequentiality in routing games
- Equilibrium computation of the Hart and Mas-Colell bargaining model
- On network formation games with heterogeneous players and basic network creation games
- A network pricing game for selfish traffic
- On network formation games with heterogeneous players and basic network creation games
- Price of anarchy in parallel processing
- Selfish bin packing
- On the performance of approximate equilibria in congestion games
- Designing fast converging cost sharing methods for multicast transmissions
- A survey on networking games in telecommunications
- Network design with weighted players
- Almost budget-balanced VCG mechanisms to assign multiple objects
- Atomic congestion games: fast, myopic and concurrent
- Worst-case analysis of non-cooperative load balancing
- On a generalized Cournot oligopolistic competition game
- Strictly periodic scheduling in IMA-based architectures
- Strong equilibria in games with the lexicographical improvement property
- Optimal coordination mechanisms for unrelated machine scheduling
- The price of anarchy in an exponential multi-server
- Strong stability of Nash equilibria in load balancing games
- The toll effect on price of anarchy when costs are nonlinear and asymmetric
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- Bottleneck congestion games with logarithmic price of anarchy
- Non-cooperative facility location and covering games
- Choice of routes in congested traffic networks: Experimental tests of the Braess paradox
- Selfish routing in public services
- Collusion in atomic splittable routing games
- Stackelberg strategies and collusion in network games with splittable flow
- The uniqueness property for networks with several origin-destination pairs
- On the performance of mildly greedy players in cut games
- Atomic routing games on maximum congestion
- Bounding the inefficiency of equilibria in nonatomic congestion games
- An efficient and almost budget balanced cost sharing method
- Non-cooperative tree creation
- Efficient graph topologies in network routing games
- Some anomalies of farsighted strategic behavior
- Stackelberg strategies for selfish routing in general multicommodity networks
- The price of anarchy of serial, average and incremental cost sharing
- Nonpreemptive coordination mechanisms for identical machines
- Implementing efficient graphs in connection networks
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Optimization for dynamic ride-sharing: a review
- Load balancing via random local search in closed and open systems
- Design of price mechanisms for network resource allocation via price of anarchy
- Selfish unsplittable flows
- Congestion games with failures
- Performance of one-round walks in linear congestion games
- On the inefficiency of equilibria in linear bottleneck congestion games
- How much can taxes help selfish routing?
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- Efficient coordination mechanisms for unrelated machine scheduling
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Strategic network formation through peering and service agreements
- Tight bounds for worst-case equilibria
- Two-group knapsack game
This page was built for publication: Worst-case equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3409969)
