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
- Stackelberg strategies for atomic congestion games
- Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
- Robust and scalable middleware for selfish-computer systems
- On spectrum sharing games
- Walrasian pricing in multi-unit auctions
- The price of anarchy on uniformly related machines revisited
- LP-based covering games with low price of anarchy
- Utilitarian resource assignment
- Nash equilibria with minimum potential in undirected broadcast games
- Approximation algorithms for a bi-level knapsack problem
- Reducing price of anarchy of selfish task allocation with more selfishness
- Worst-case Nash equilibria in restricted routing
- Equilibria in routing games with edge priorities
- The price of atomic selfish ring routing
- Coordination mechanisms
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- Selfish square packing
- On the efficiency of local electricity markets under decentralized and centralized designs: a multi-leader Stackelberg game analysis
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- On the efficiency of price competition
- The Price of Anarchy of a Network Creation Game with Exponential Payoff
- Equilibrium and inefficiency in multi-product Cournot games
- Auctioning or assigning an object: some remarkable VCG mechanisms
- Selfish bin coloring
- Competitive profit maximization in social networks
- Profit loss in differentiated oligopolies
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
- Pricing with markups in industries with increasing marginal costs
- Tradeoffs in worst-case equilibria
- Selfish routing with incomplete information
- Improved lower bounds on the price of stability of undirected network design games
- Service rate control of closed Jackson networks from game theoretic perspective
- Selfishness need not be bad
- Social context congestion games
- On truthfulness and approximation for scheduling selfish tasks
- Price and capacity competition
- Game authority for robust and scalable distributed selfish-computer systems
- Selfish splittable flows and NP-completeness
- Congestion games with capacitated resources
- Capacity allocation to sales agents in a decentralized logistics network
- Selfish Bin Packing
- An improved mechanism for selfish bin packing
- Local smoothness and the price of anarchy in splittable congestion games
- Approximate Strong Equilibrium in Job Scheduling Games
- On the structure and complexity of worst-case equilibria
- The price of anarchy in bilateral network formation in an adversary model
- On the efficiency of the proportional allocation mechanism for divisible resources
- When ignorance helps: graphical multicast cost sharing games
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)
