The following pages link to Algorithmic Game Theory (Q5432685):
Displayed 50 items.
- Generalized Nash Equilibrium Problems with Partial Differential Operators: Theory, Algorithms, and Risk Aversion (Q5051774) (← links)
- Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses (Q5076717) (← links)
- (Q5088947) (← links)
- (Q5092351) (← links)
- (Q5092369) (← links)
- Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
- The Value of Information in Selfish Routing (Q5100972) (← links)
- Technical Change and the Decentralization Penalty (Q5111101) (← links)
- (Q5111230) (← links)
- (Q5111298) (← links)
- Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing (Q5111740) (← links)
- Методы решения теоретико-игровых моделей согласования интересов при управлении рыболовством (Q5112088) (← links)
- Mean Field Equilibria for Resource Competition in Spatial Settings (Q5113888) (← links)
- When Fixed Price Meets Priority Auctions: Competing Firms with Different Pricing and Service Rules (Q5113891) (← links)
- Multiscale Flux-Based Modeling of Biofilm Communities (Q5117152) (← links)
- Multiagent Mechanism Design Without Money (Q5129203) (← links)
- Deterministic and Stochastic Wireless Network Games: Equilibrium, Dynamics, and Price of Anarchy (Q5131533) (← links)
- (Q5136330) (← links)
- Stochastic Games (Q5149735) (← links)
- Mechanism Design (Q5149740) (← links)
- A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints (Q5152476) (← links)
- Risk-Averse Selfish Routing (Q5219707) (← links)
- Rare Nash Equilibria and the Price of Anarchy in Large Static Games (Q5219723) (← links)
- Hessian Barrier Algorithms for Linearly Constrained Optimization Problems (Q5233100) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Some Results about the Contractions and the Pendant Pairs of a Submodular System (Q5241673) (← links)
- The Price of Stability of Weighted Congestion Games (Q5242923) (← links)
- Hats, auctions and derandomization (Q5252259) (← links)
- Łukasiewicz Games (Q5277898) (← links)
- PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES (Q5358089) (← links)
- The Price of Stochastic Anarchy (Q5459995) (← links)
- (Q5856414) (← links)
- Coordination problems on networks revisited: statics and dynamics (Q5860332) (← links)
- (Q5874477) (← links)
- (Q5875381) (← links)
- (Q5875520) (← links)
- “Beat-Your-Rival” Routing Games (Q5899478) (← links)
- Bounds on the welfare loss from moral hazard with limited liability (Q5964694) (← links)
- A convergence analysis of the price of anarchy in atomic congestion games (Q6038662) (← links)
- The interaction of economic agents in Cournot duopoly models under ecological conditions: a comparison of organizational modes (Q6047980) (← links)
- Congestion games with priority-based scheduling (Q6049927) (← links)
- (Q6054229) (← links)
- Approximate variational inequalities and equilibria (Q6060552) (← links)
- Successive minimum spanning trees (Q6074707) (← links)
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings (Q6075859) (← links)
- The polyhedral geometry of truthful auctions (Q6086004) (← links)
- Characterization of Vickrey auction with reserve price for multiple objects (Q6086124) (← links)
- Well-behaved online load balancing against strategic jobs (Q6090218) (← links)
- A stochastic variant of replicator dynamics in zero-sum games and its invariant measures (Q6090682) (← links)
- \textsc{PeerNomination}: a novel peer selection algorithm to handle strategic and noisy assessments (Q6098845) (← links)