Piotr Krysta

Mathieu Mari

Nan Zhi

Algorithmica, November, 2024

On the Redistribution of Maximal Extractable Value: A Dynamic Mechanism.

[BibT_eX]

[DOI]

CoRR, 2024

Power of Posted-price Mechanisms for Prophet Inequalities.

[BibT_eX]

[DOI]

Kiarash Banihashem

MohammadTaghi Hajiaghayi

Mohammad Taghi Hajiaghayi

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Online Sampling and Decision Making with Low Entropy.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

MEV Sharing with Dynamic Extraction Rates.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Decentralized Finance and Security, 2024

Who gets the Maximal Extractable Value? A Dynamic Sharing Blockchain Mechanism.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Optimality guarantees for crystal structure prediction.

[BibT_eX]

[DOI]

Christopher M. Collins

Matthew J. Rosseinsky

Nat., 2023

First Order Methods for Geometric Optimization of Crystal Structures.

[BibT_eX]

[DOI]

CoRR, 2023

Combinatorial Group Testing with Selfish Agents.

[BibT_eX]

[DOI]

Georgios Chionas

Mohammad Taghi Hajiaghayi

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Adversarial Contention Resolution Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Optimal Algorithms for Free Order Multiple-Choice Secretary.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Entropy-Based Approximation of the Secretary Problem.

[BibT_eX]

[DOI]

CoRR, 2021

Efficient Truthful Scheduling and Resource Allocation through Monitoring.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2019

Deterministic coloring algorithms in the LOCAL model.

[BibT_eX]

[DOI]

CoRR, 2019

Size Versus Truthfulness in the House Allocation Problem.

[BibT_eX]

[DOI]

Algorithmica, 2019

Network Pollution Games.

[BibT_eX]

[DOI]

Eleftherios Anastasiadis

Algorithmica, 2019

Truthful Mechanisms for Multi Agent Self-interested Correspondence Selection.

[BibT_eX]

[DOI]

Proceedings of the Semantic Web - ISWC 2019, 2019

2018

The Power of Verification for Greedy Mechanism Design.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

2017

Learning Powers of Poisson Binomial Distributions.

[BibT_eX]

[DOI]

CoRR, 2017

Combinatorial Auctions Without Money.

[BibT_eX]

[DOI]

Algorithmica, 2017

Mechanism Design for Ontology Alignment.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Utilitarian Mechanism Design for Single-Minded Agents.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

House Markets with Matroid and Knapsack Constraints.

[BibT_eX]

[DOI]

Jinshan Zhang

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

New Results for Network Pollution Games.

[BibT_eX]

[DOI]

Eleftherios Anastasiadis

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Combinatorial auctions with verification are tractable.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Utilitarian Mechanism Design for Multiobjective Optimization.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

2013

Ranking games that have competitiveness-based strategies.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

2012

Limited Supply Online Auctions for Revenue Maximization.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Online Mechanism Design (Randomized Rounding on the Fly).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Approximation Techniques for Utilitarian Mechanism Design.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Externalities among Advertisers in Sponsored Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

Selfish Traffic Allocation for Server Farms.

[BibT_eX]

[DOI]

Artur Czumaj

SIAM J. Comput., 2010

Utilitarian Mechanism Design for Multi-Objective Optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Combinatorial auctions with externalities.

[BibT_eX]

[DOI]

Tomasz P. Michalak

Tuomas Sandholm

Michael J. Wooldridge

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2008

Utilitarian Mechanism Design for Single-Minded Agents.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Social Context Games.

[BibT_eX]

[DOI]

Itai Ashlagi

Moshe Tennenholtz

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

On the Approximability of Combinatorial Exchange Problems.

[BibT_eX]

[DOI]

Moshe Babaioff

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007

Stackelberg Network Pricing Games.

[BibT_eX]

[DOI]

Martin Hoefer

Electron. Colloquium Comput. Complex., 2007

2006

Efficient approximation algorithms for the achromatic number.

[BibT_eX]

[DOI]

Krzysztof Lorys

Theor. Comput. Sci., 2006

Computing equilibria for a service provider game with (Im)perfect information.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.

[BibT_eX]

[DOI]

Jörg Knoche

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Single-minded unlimited supply pricing on sparse instances.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Bicriteria Network Design via Iterative Rounding.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Geometric Network Design with Selfish Agents.

[BibT_eX]

[DOI]

Martin Hoefer

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Computing equilibria for congestion games with (im)perfect information.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Approximating minimum size {1, 2}-connected network.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Optimizing misdirection.

[BibT_eX]

[DOI]

Piotr Berman

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

Scheduling and Traffic Allocation for Tasks with Bounded Splittability.

[BibT_eX]

[DOI]

Peter Sanders

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

An Experimental Study of <i>k</i>-Splittable Scheduling for DNS-Based Traffic Allocation.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002

Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.

[BibT_eX]

[DOI]

Béla Csaba

Marek Karpinski

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Approximation algorithms for combinatorial optimization problems in graph coloring and network desig.

[BibT_eX]

[DOI]

PhD thesis, 2001

Approximation Algorithms for Bounded Facility Location Problems.

[BibT_eX]

[DOI]

Roberto Solis-Oba

J. Comb. Optim., 2001

Approximation Algorithms for Minimum Size 2-Connectivity Problems.

[BibT_eX]

[DOI]

V. S. Anil Kumar

Proceedings of the STACS 2001, 2001

1999

The STO problem is NP-complete.

[BibT_eX]

[DOI]

Leszek Pacholski

J. Symb. Comput., 1999

Approximation Algorithms for Bounded Facility Location.

[BibT_eX]

[DOI]

Roberto Solis-Oba

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1997

External Inverse Pattern Matching.

[BibT_eX]

[DOI]

Leszek Gasieniec

Piotr Indyk