The following pages link to Web and Internet Economics (Q2936970):
Displaying 50 items.
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling (Q2402672) (← links)
- The computational complexity of random serial dictatorship (Q2453028) (← links)
- General truthfulness characterizations via convex analysis (Q2667284) (← links)
- Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations (Q2936971) (← links)
- Network Cournot Competition (Q2936973) (← links)
- Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria (Q2936974) (← links)
- Limiting Price Discrimination when Selling Products with Positive Network Externalities (Q2936975) (← links)
- Computing Approximate Nash Equilibria in Polymatrix Games (Q2936976) (← links)
- Optimal Cost-Sharing in Weighted Congestion Games (Q2936977) (← links)
- Truthful Multi-unit Procurements with Budgets (Q2936978) (← links)
- The Shapley Value in Knapsack Budgeted Games (Q2936979) (← links)
- Fast Convex Decomposition for Truthful Social Welfare Approximation (Q2936980) (← links)
- A Near-Optimal Mechanism for Impartial Selection (Q2936981) (← links)
- Value-Based Network Externalities and Optimal Auction Design (Q2936982) (← links)
- Matching Dynamics with Constraints (Q2936983) (← links)
- Truthful Approximations to Range Voting (Q2936984) (← links)
- Resource Competition on Integral Polymatroids (Q2936985) (← links)
- PTAS for Minimax Approval Voting (Q2936986) (← links)
- Biobjective Online Bipartite Matching (Q2936987) (← links)
- Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets (Q2936988) (← links)
- Not Just an Empty Threat: Subgame-Perfect Equilibrium in Repeated Games Played by Computationally Bounded Players (Q2936989) (← links)
- Concise Bid Optimization Strategies with Multiple Budget Constraints (Q2936992) (← links)
- Sampling and Representation Complexity of Revenue Maximization (Q2936993) (← links)
- To Save Or Not To Save: The Fisher Game (Q2936994) (← links)
- Coalitional Games on Sparse Social Networks (Q2936995) (← links)
- Randomized Revenue Monotone Mechanisms for Online Advertising (Q2936996) (← links)
- Learning Economic Parameters from Revealed Preferences (Q2936997) (← links)
- Privacy Games (Q2936999) (← links)
- Simple and Near-Optimal Mechanisms for Market Intermediation (Q2937000) (← links)
- GSP with General Independent Click-through-Rates (Q2937002) (← links)
- Position Auctions with Externalities (Q2937003) (← links)
- Quality of Service in Network Creation Games (Q2937004) (← links)
- The Sequential Price of Anarchy for Atomic Congestion Games (Q2937005) (← links)
- Multilevel Network Games (Q2937006) (← links)
- Coordination Games on Graphs (Extended Abstract) (Q2937007) (← links)
- On the Existence of Low-Rank Explanations for Mixed Strategy Behavior (Q2937008) (← links)
- Congestion Games with Higher Demand Dimensions (Q2937009) (← links)
- Time-Decaying Bandits for Non-stationary Systems (Q2937011) (← links)
- Market Equilibrium under Piecewise Leontief Concave Utilities (Q2937012) (← links)
- Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games (Q2937013) (← links)
- Approximate Pure Nash Equilibria in Social Context Congestion Games (Q2937015) (← links)
- Nash Stability in Fractional Hedonic Games (Q2937016) (← links)
- The Role of Common and Private Signals in Two-Sided Matching with Interviews (Q2937018) (← links)
- The Asymmetric Matrix Partition Problem (Q2937740) (← links)
- Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3 (Q2937742) (← links)
- Incentives and Efficiency in Uncertain Collaborative Environments (Q2937744) (← links)
- Revenue Maximization with Nonexcludable Goods (Q2937745) (← links)
- On Lookahead Equilibria in Congestion Games (Q2937746) (← links)
- Trading Agent Kills Market Information (Q2937747) (← links)
