The following pages link to Michal Feldman (Q417615):
Displayed 50 items.
- Combinatorial agency (Q417616) (← links)
- Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
- Liquid price of anarchy (Q681835) (← links)
- The efficiency of best-response dynamics (Q681867) (← links)
- Walking in circles (Q712279) (← links)
- Bayesian ignorance (Q714780) (← links)
- Computing optimal contracts in combinatorial agencies (Q714788) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- Capacitated network design games (Q904684) (← links)
- A note on competitive diffusion through social networks (Q991758) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Efficient graph topologies in network routing games (Q1021587) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- Stable secretaries (Q1999964) (← links)
- Pricing multi-unit markets (Q2190388) (← links)
- Simultaneous auctions without complements are (almost) efficient (Q2206818) (← links)
- Mechanism design with a restricted action space (Q2437830) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- Prophet inequality with competing agents (Q2670915) (← links)
- On the power and limits of dynamic pricing in combinatorial markets (Q2692280) (← links)
- Envy-Free Makespan Approximation (Q2884571) (← links)
- (Q2934597) (← links)
- The Asymmetric Matrix Partition Problem (Q2937740) (← links)
- Limits of Efficiency in Sequential Auctions (Q2937755) (← links)
- Clearing Markets via Bundles (Q2938655) (← links)
- Economical Graph Discovery (Q2941419) (← links)
- Correlated and Coarse Equilibria of Single-Item Auctions (Q2959824) (← links)
- (Q2969618) (← links)
- Sequential decision making with vector outcomes (Q2988880) (← links)
- Dynamic Inefficiency: Anarchy without Stability (Q3095259) (← links)
- Strategyproof Approximation of the Minimax on Networks (Q3169105) (← links)
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs (Q3304731) (← links)
- A Unified Framework for Strong Price of Anarchy in Clustering Games (Q3449509) (← links)
- Combinatorial Walrasian Equilibrium (Q3460334) (← links)
- Welfare and Revenue Guarantees for Competitive Bundling Equilibrium (Q3460797) (← links)
- (Q3524732) (← links)
- Mixed Strategies in Combinatorial Agency (Q3579358) (← links)
- Partition Equilibrium (Q3648842) (← links)
- Free-Riding and Free-Labor in Combinatorial Agency (Q3648847) (← links)
- Approximate Strong Equilibrium in Job Scheduling Games (Q3651490) (← links)
- (Q4633920) (← links)
- (Q4636438) (← links)
- Conflicting Congestion Effects in Resource Allocation Games (Q4648251) (← links)
- Capacitated Network Design Games (Q4910940) (← links)
- Approximate modularity revisited (Q4978043) (← links)
- A Simple and Approximately Optimal Mechanism for a Buyer with Complements (Q4994150) (← links)
- (Q5009585) (← links)
- (Q5077148) (← links)
- Prophet Matching with General Arrivals (Q5085120) (← links)
- (Q5091149) (← links)