Patrick Briest

Affiliations:
  • University of Paderborn, Department of Computer Science, Germany
  • University of Liverpool, Department of Computer Science, UK
  • TU Dortmund, Department of Computer Science, Germany


According to our database1, Patrick Briest authored at least 25 papers between 2004 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
Pricing lotteries.
J. Econ. Theory, 2015

2012
On stackelberg pricing with computationally bounded customers.
Networks, 2012

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

A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model
CoRR, 2011

The car sharing problem.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Pricing Randomized Allocations.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).
it Inf. Technol., 2009

Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
CoRR, 2009

On Stackelberg Pricing with Computationally Bounded Consumers.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

2008
Approximate Equilibria in Games with Few Players
CoRR, 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

Uniform Budgets and the Envy-Free Pricing Problem.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Computational aspects of combinatorial pricing problems
PhD thesis, 2007

Who Should Pay for Forwarding Packets?
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

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

Algorithmische und Komplexitätstheoretische Aspekte Kombinatorischer Preisoptimierung [Computational Aspects of Combinatorial Pricing Problems].
Proceedings of the Ausgezeichnete Informatikdissertationen 2007, 2007

2006
Towards Hardness of Envy-Free Pricing.
Electron. Colloquium Comput. Complex., 2006

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

Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

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

2004
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.
Proceedings of the Parallel Problem Solving from Nature, 2004

Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.
Proceedings of the Parallel Problem Solving from Nature, 2004


  Loading...