Pages that link to "Item:Q5176034"

The following pages link to Algorithms, games, and the internet (Q5176034):

Displaying 50 items.

• Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
• Cost-sharing scheduling games on restricted unrelated machines (Q306273) (← links)
• Strategic decentralization in binary choice composite congestion games (Q322512) (← links)
• Network-formation games with regular objectives (Q342715) (← links)
• Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
• Fall back equilibrium for \(2 \times n\) bimatrix games (Q376720) (← links)
• The price of anarchy on uniformly related machines revisited (Q418148) (← links)
• Learning efficient Nash equilibria in distributed systems (Q423765) (← links)
• Convergence and approximation in potential games (Q441854) (← links)
• Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709) (← links)
• Repeated congestion games with bounded rationality (Q444148) (← links)
• Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
• Worst-case equilibria (Q458478) (← links)
• Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
• Selfish splittable flows and NP-completeness (Q465681) (← links)
• Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
• Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
• Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
• Strategic sharing of a costly network (Q504401) (← links)
• The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
• The price of anarchy in bilateral network formation in an adversary model (Q521821) (← links)
• Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
• Selfish bin packing (Q534779) (← links)
• Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS (Q542097) (← links)
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
• A two-player competitive discrete location model with simultaneous decisions (Q613464) (← links)
• Buyer-supplier games: optimization over the core (Q627118) (← links)
• Convergence to approximate Nash equilibria in congestion games (Q632952) (← links)
• On the performance of approximate equilibria in congestion games (Q634681) (← links)
• Topological implications of selfish neighbor selection in unstructured peer-to-peer networks (Q639277) (← links)
• Congestion games with failures (Q642974) (← links)
• Tight bounds for selfish and greedy load balancing (Q644806) (← links)
• The complexity of game isomorphism (Q650900) (← links)
• Bounded budget betweenness centrality game for strategic network formations (Q655424) (← links)
• Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
• Bayesian ignorance (Q714780) (← links)
• Computing optimal contracts in combinatorial agencies (Q714788) (← links)
• Network design with weighted players (Q733733) (← links)
• Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
• Strong equilibrium in cost sharing connection games (Q834855) (← links)
• Coordination mechanisms (Q838145) (← links)
• Atomic routing games on maximum congestion (Q838146) (← links)
• Games of fixed rank: a hierarchy of bimatrix games (Q847799) (← links)
• The price of anarchy for polynomial social cost (Q861255) (← links)
• Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
• A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property (Q883995) (← links)
• Capacitated network design games (Q904684) (← links)
• The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
• New complexity results about Nash equilibria (Q932810) (← links)
• Simple search methods for finding a Nash equilibrium (Q932813) (← links)