The following pages link to Aranyak Mehta (Q627115):
Displaying 30 items.
- Pricing commodities (Q627117) (← links)
- Autobidding with constraints (Q776226) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- An auction-based market equilibrium algorithm for a production model (Q883996) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- A note on approximate Nash equilibria (Q1014628) (← links)
- Is Shapley cost sharing optimal? (Q1651261) (← links)
- Bayesian Mechanism Design (Q2872499) (← links)
- On earthmover distance, metric labeling, and 0-extension (Q2931417) (← links)
- Biobjective Online Bipartite Matching (Q2936987) (← links)
- Designing Markets for Daily Deals (Q2937748) (← links)
- Design is as Easy as Optimization (Q3084225) (← links)
- (Q3191564) (← links)
- AdWords and generalized online matching (Q3546342) (← links)
- On Earthmover Distance, Metric Labeling, and 0-Extension (Q3558006) (← links)
- (Q3579420) (← links)
- Design Is as Easy as Optimization (Q3613783) (← links)
- (Q4828981) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191518) (← links)
- Caching with Expiration Times for Internet Applications (Q5291244) (← links)
- Online Stochastic Matching with Unequal Probabilities (Q5363007) (← links)
- (Q5365114) (← links)
- (Q5417603) (← links)
- Online bipartite matching with unknown distributions (Q5419129) (← links)
- Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations (Q5443368) (← links)
- Adwords Auctions with Decreasing Valuation Bids (Q5458614) (← links)
- Is Shapley Cost Sharing Optimal? (Q5459997) (← links)
- Posted price profit maximization for multicast by approximating fixed points (Q5468867) (← links)
- Prior-independent auctions for heterogeneous bidders (Q6645341) (← links)
