Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #51 to #100.

Frugal Routing on Wireless Ad-Hoc Networks: Label: en
Atomic Congestion Games: Fast, Myopic and Concurrent: Label: en
Price Variation in a Bipartite Exchange Network: Label: en
Window-Games between TCP Flows: Label: en
On the Approximability of Combinatorial Exchange Problems: Label: en
Bertrand Competition in Networks: Label: en
Approximate Strong Equilibrium in Job Scheduling Games: Label: en
The Price of Anarchy on Uniformly Related Machines Revisited: Label: en
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy: Label: en
The Influence of Link Restrictions on (Random) Selfish Routing: Label: en
Approximate Equilibria for Strategic Two Person Games: Label: en
Experimental Results on the Process of Goal Formation and Aspiration Adaptation: Label: en
The Search for Equilibrium Concepts: Label: en
A Theoretical Examination of Practical Game Playing: Lookahead Search: Label: en
Minimizing Expectation Plus Variance: Label: en
Uniform Price Auctions: Equilibria and Efficiency: Label: en
Congestion Games with Capacitated Resources: Label: en
Commodity Auctions and Frugality Ratios: Label: en
Ad Auctions with Data: Label: en
On the Hardness of Network Design for Bottleneck Routing Games: Label: en
Decentralized Dynamics for Finite Opinion Games: Label: en
Capacitated Network Design Games: Label: en
Mechanisms and Impossibilities for Truthful, Envy-Free Allocations: Label: en
Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques: Label: en
Common Knowledge and State-Dependent Equilibria: Label: en
Basic Network Creation Games with Communication Interests: Label: en
Convergence of Ordered Improvement Paths in Generalized Congestion Games: Label: en
An Optimal Bound to Access the Core in TU-Games: Label: en
The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games: Label: en
Mechanisms for Scheduling with Single-Bit Private Values: Label: en
Selfishness Level of Strategic Games: Label: en
A Classification of Weakly Acyclic Games: Label: en
On Equilibria for ADM Minimization Games: Label: en
Bayesian Auctions with Friends and Foes: Label: en
Nash Equilibria and the Price of Anarchy for Flows over Time: Label: en
Performances of One-Round Walks in Linear Congestion Games: Label: en
Swap Bribery: Label: en
On the Complexity of Iterated Weak Dominance in Constant-Sum Games: Label: en
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems: Label: en
Doing Good with Spam Is Hard: Label: en
Learning and Approximating the Optimal Strategy to Commit To: Label: en
The Computational Complexity of Weak Saddles: Label: en
A New Derandomization of Auctions: Label: en
Games with Congestion-Averse Utilities: Label: en
Price of Stability in Survivable Network Design: Label: en
Nash Dynamics in Constant Player and Bounded Jump Congestion Games: Label: en
Stochastic Stability in Internet Router Congestion Games: Label: en
Equilibria in Dynamic Selfish Routing: Label: en
Anarchy, Stability, and Utopia: Creating Better Matchings: Label: en
The Balloon Popping Problem Revisited: Lower and Upper Bounds: Label: en