The following pages link to Piotr Krysta (Q203724):
Displaying 42 items.
- Combinatorial auctions without money (Q521808) (← links)
- The STO problem is NP-complete (Q1284283) (← links)
- Network pollution games (Q1755784) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- Ranking games that have competitiveness-based strategies (Q1945930) (← links)
- Size versus truthfulness in the house allocation problem (Q2319628) (← links)
- Stackelberg network pricing games (Q2429327) (← links)
- Efficient approximation algorithms for the achromatic number (Q2503345) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- (Q2762522) (← links)
- New Results for Network Pollution Games (Q2817847) (← links)
- Utilitarian mechanism design for multiobjective optimization (Q2929697) (← links)
- (Q2934658) (← links)
- Computing equilibria for a service provider game with (Im)perfect information (Q2944536) (← links)
- Selfish Traffic Allocation for Server Farms (Q3053156) (← links)
- Externalities among Advertisers in Sponsored Search (Q3095263) (← links)
- Online Mechanism Design (Randomized Rounding on the Fly) (Q3167050) (← links)
- Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods (Q3196307) (← links)
- Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems (Q3225164) (← links)
- Approximation Techniques for Utilitarian Mechanism Design (Q3225165) (← links)
- Selfish traffic allocation for server farms (Q3579231) (← links)
- Approximation techniques for utilitarian mechanism design (Q3581383) (← links)
- Single-minded unlimited supply pricing on sparse instances (Q3583426) (← links)
- Combinatorial Auctions with Verification Are Tractable (Q3586382) (← links)
- (Q4471294) (← links)
- The Power of Verification for Greedy Mechanism Design (Q4580271) (← links)
- House Markets with Matroid and Knapsack Constraints (Q4598284) (← links)
- (Q4828917) (← links)
- Stackelberg Network Pricing Games (Q4910714) (← links)
- (Q4938783) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q5146864) (← links)
- (Q5417649) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431337) (← links)
- An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions (Q5443526) (← links)
- On the Approximability of Combinatorial Exchange Problems (Q5459974) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492894) (← links)
- (Q5501334) (← links)
- Computing and Combinatorics (Q5716934) (← links)
- Computing and Combinatorics (Q5716935) (← links)
- Approximation algorithms for bounded facility location problems (Q5943822) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)
- Power of posted-price mechanisms for prophet inequalities (Q6645533) (← links)
