The following pages link to Martin Hoefer (Q287989):
Displaying 50 items.
- Concurrent imitation dynamics in congestion games (Q287990) (← links)
- On the complexity of Pareto-optimal Nash and strong equilibria (Q372955) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- Online capacity maximization in wireless networks (Q398842) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Competitive cost sharing with economies of scale (Q547291) (← links)
- Distributed algorithms for QoS load balancing (Q658665) (← links)
- Earning limits in Fisher markets with spending-constraint utilities (Q681846) (← links)
- On proportional allocation in hedonic games (Q681889) (← links)
- Competitive routing over time (Q719282) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Non-cooperative tree creation (Q1017908) (← links)
- Dynamics in matching and coalition formation games with structural constraints (Q1711887) (← links)
- Dynamics in network interaction games (Q1938382) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- Local matching dynamics in social networks (Q1951568) (← links)
- Secretary markets with local information (Q2010597) (← links)
- The secretary recommendation problem (Q2155898) (← links)
- Stable matching with network externalities (Q2408103) (← links)
- Stackelberg network pricing games (Q2429327) (← links)
- Contribution games in networks (Q2429340) (← links)
- When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores (Q2670938) (← links)
- Friendship and Stable Matching (Q2849295) (← links)
- Matching Dynamics with Constraints (Q2936983) (← links)
- Designing Profit Shares in Matching and Coalition Formation Games (Q2937762) (← links)
- Smoothness for Simultaneous Composition of Mechanisms with Admission (Q2959837) (← links)
- Locally Stable Marriage with Strict Preferences (Q2968513) (← links)
- Local Matching Dynamics in Social Networks (Q3012913) (← links)
- Convergence Time of Power-Control Dynamics (Q3012955) (← links)
- On the Complexity of Pareto-optimal Nash and Strong Equilibria (Q3162529) (← links)
- Maintaining Near-Popular Matchings (Q3449500) (← links)
- Ultra-Fast Load Balancing on Scale-Free Networks (Q3449501) (← links)
- Secretary Markets with Local Information (Q3449504) (← links)
- Combinatorial Auctions with Conflict-Based Externalities (Q3460791) (← links)
- On Finding Graph Clusterings with Maximum Modularity (Q3508560) (← links)
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games (Q3586381) (← links)
- Contribution Games in Social Networks (Q3586459) (← links)
- Altruism in Atomic Congestion Games (Q3639245) (← links)
- Dynamics in Network Interaction Games (Q3646232) (← links)
- Doing Good with Spam Is Hard (Q3648862) (← links)
- (Q4426353) (← links)
- (Q4606277) (← links)
- (Q4608045) (← links)
- On stackelberg pricing with computationally bounded customers (Q4648689) (← links)
- Stackelberg Network Pricing Games (Q4910714) (← links)
- Distributed Selfish Load Balancing on Networks (Q4962160) (← links)
- Ascending-Price Algorithms for Unknown Markets (Q4972683) (← links)
- Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
- (Q5002844) (← links)
- On fair division for indivisible items (Q5090961) (← links)
