Piotr Krysta

According to our database1, Piotr Krysta authored at least 44 papers between 1997 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Mechanism Design for Ontology Alignment.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Utilitarian Mechanism Design for Single-Minded Agents.
Encyclopedia of Algorithms, 2016

House Markets with Matroid and Knapsack Constraints.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

New Results for Network Pollution Games.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Network Pollution Games.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

The Power of Verification for Greedy Mechanism Design.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Utilitarian Mechanism Design for Multiobjective Optimization.
SIAM J. Comput., 2014

Size versus truthfulness in the house allocation problem.
Proceedings of the ACM Conference on Economics and Computation, 2014

Combinatorial auctions without money.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Mechanisms for multi-unit combinatorial auctions with a few distinct goods.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Limited Supply Online Auctions for Revenue Maximization.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Online Mechanism Design (Randomized Rounding on the Fly).
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.
SIAM J. Comput., 2011

Externalities among Advertisers in Sponsored Search.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010
Utilitarian Mechanism Design for Multi-Objective Optimization.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Ranking games that have competitiveness-based strategies.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Combinatorial Auctions with Verification Are Tractable.
Proceedings of the Algorithms, 2010

Combinatorial auctions with externalities.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2008
Utilitarian Mechanism Design for Single-Minded Agents.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Social Context Games.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Stackelberg Network Pricing Games.
Proceedings of the STACS 2008, 2008

On the Approximability of Combinatorial Exchange Problems.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007
Buying cheap is expensive: hardness of non-parametric multi-product pricing.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
Computing equilibria for a service provider game with (Im)perfect information.
ACM Trans. Algorithms, 2006

An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Single-minded unlimited supply pricing on sparse instances.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Approximation techniques for utilitarian mechanism design.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Bicriteria Network Design via Iterative Rounding.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Geometric Network Design with Selfish Agents.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Computing equilibria for congestion games with (im)perfect information.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Approximating minimum size {1, 2}-connected network.
Discrete Applied Mathematics, 2003

Optimizing misdirection.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Scheduling and Traffic Allocation for Tasks with Bounded Splittability.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002
Selfish traffic allocation for server farms.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Approximation Algorithms for Bounded Facility Location Problems.
J. Comb. Optim., 2001

Approximation Algorithms for Minimum Size 2-Connectivity Problems.
Proceedings of the STACS 2001, 2001

1999
The STO problem is NP-complete.
J. Symb. Comput., 1999

Efficient Approximation Algorithms for the Achromatic Number.
Proceedings of the Algorithms, 1999

Approximation Algorithms for Bounded Facility Location.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1997
External Inverse Pattern Matching.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997


  Loading...