The following pages link to Orestis A. Telelis (Q963379):
Displaying 23 items.
- (Q526902) (redirect page) (← links)
- Item bidding for combinatorial public projects (Q526903) (← links)
- Uniform price auctions: equilibria and efficiency (Q904682) (← links)
- The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
- Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity (Q963381) (← links)
- Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis (Q1041744) (← links)
- Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
- On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
- Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets (Q2819463) (← links)
- Item Pricing for Combinatorial Public Projects (Q2830053) (← links)
- Inefficiency of Standard Multi-unit Auctions (Q2849330) (← links)
- Strategic Scheduling Games: Equilibria and Efficiency (Q2958675) (← links)
- Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
- Externalities among Advertisers in Sponsored Search (Q3095263) (← links)
- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games (Q3162531) (← links)
- Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods (Q3196307) (← links)
- On Labeled Traveling Salesman Problems (Q3597879) (← links)
- Steiner Forests on Stochastic Metric Graphs (Q3611962) (← links)
- Improved Bounds for Facility Location Games with Fair Cost Allocation (Q3637064) (← links)
- Uniform Price Auctions: Equilibria and Efficiency (Q4910949) (← links)
- Updating Directed Minimum Cost Spanning Trees (Q5307551) (← links)
- Tight welfare guarantees for pure Nash equilibria of the uniform price auction (Q5894691) (← links)
- Tight welfare guarantees for pure Nash equilibria of the uniform price auction (Q5919605) (← links)
