The following pages link to I. Caragiannis (Q235661):
Displaying 50 items.
- Welfare guarantees for proportional allocations (Q506519) (← links)
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Voting almost maximizes social welfare despite limited communication (Q646516) (← links)
- The efficiency of fair division (Q692886) (← links)
- Efficient on-line frequency allocation and call control in cellular networks (Q699816) (← links)
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- Space lower bounds for low-stretch greedy embeddings (Q896692) (← links)
- Optimal social choice functions: a utilitarian view (Q899165) (← links)
- Scheduling to maximize participation (Q935466) (← links)
- A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem (Q1007590) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- An almost ideal coordination mechanism for unrelated machine scheduling (Q1733383) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies. (Q1853082) (← links)
- Randomized path coloring on binary trees. (Q1853533) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- Energy-efficient communication in multi-interface wireless networks (Q1946498) (← links)
- Bounding the inefficiency of compromise in opinion formation (Q2072107) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- The metric distortion of multiwinner voting (Q2093402) (← links)
- Relaxing the independence assumption in sequential posted pricing, prophet inequality, and random bipartite matching (Q2152109) (← links)
- Computing envy-freeable allocations with limited subsidies (Q2152144) (← links)
- On approximate pure Nash equilibria in weighted congestion games with polynomial latencies (Q2221800) (← links)
- Stable fractional matchings (Q2238635) (← links)
- Bounding the inefficiency of outcomes in generalized second price auctions (Q2253843) (← links)
- Optimizing positional scoring rules for rank aggregation (Q2321258) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- An improved 2-agent kidney exchange mechanism (Q2346377) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- Improved lower bounds on the price of stability of undirected network design games (Q2392248) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Efficiency and complexity of price competition among single-product vendors (Q2407455) (← links)
- Energy-efficient wireless network design (Q2509034) (← links)
- Portioning using ordinal preferences: fairness and efficiency (Q2680774) (← links)
- (Q2753727) (← links)
- Limitations of Deterministic Auction Design for Correlated Bidders (Q2849317) (← links)
- Revenue Guarantees in Sponsored Search Auctions (Q2912846) (← links)
- Space Lower Bounds for Low-Stretch Greedy Embeddings (Q2913208) (← links)
- Welfare Guarantees for Proportional Allocations (Q2938659) (← links)
- Near-Optimal Asymmetric Binary Matrix Partitions (Q2946372) (← links)
- Subset Selection Via Implicit Utilitarian Voting (Q2956546) (← links)
- Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship (Q2959833) (← links)
- Tight Approximation Bounds for Greedy Frugal Coverage Algorithms (Q3004668) (← links)
- (Q3152809) (← links)
- Improved Lower Bounds on the Price of Stability of Undirected Network Design Games (Q3162510) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
