Paolo Penna

Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

2017

No truthful mechanism can be better than n approximate for two natural problems.

[BibT_eX]

[DOI]

Stefano Leucci

Akaki Mamageishvili

CoRR, 2017

Truthful Mechanisms for Delivery with Mobile Agents.

[BibT_eX]

[DOI]

Andreas Bärtschi

Daniel Graf

CoRR, 2017

Energy-Efficient Delivery by Heterogeneous Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Sorting with Recurrent Comparison Errors.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy.

[BibT_eX]

[DOI]

Cong Chen

Yinfeng Xu

Proceedings of the Combinatorial Optimization and Applications, 2017

Truthful Mechanisms for Delivery with Agents.

[BibT_eX]

[DOI]

Andreas Bärtschi

Daniel Graf

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016

Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games.

[BibT_eX]

[DOI]

Akaki Mamageishvili

Oper. Res. Lett., 2016

Sequential Solutions in Machine Scheduling Games.

[BibT_eX]

[DOI]

CoRR, 2016

Sort well with energy-constrained comparisons.

[BibT_eX]

[DOI]

Barbara Geissmann

CoRR, 2016

Local Distributed Algorithms for Selfish Agents.

[BibT_eX]

[DOI]

Simon Collet

Pierre Fraigniaud

CoRR, 2016

Convergence to Equilibrium of Logit Dynamics for Strategic Games.

[BibT_eX]

[DOI]

Algorithmica, 2016

Bribeproof Mechanisms for Two-Values Domains.

[BibT_eX]

[DOI]

Matús Mihalák

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

On Computing the Total Displacement Number via Weighted Motzkin Paths.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Core-periphery clustering and collaboration networks.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015

Imperfect Best-Response Mechanisms.

[BibT_eX]

[DOI]

Diodato Ferraioli

Theory Comput. Syst., 2015

Mechanisms for Scheduling with Single-Bit Private Values.

[BibT_eX]

[DOI]

Vincenzo Auletta

George Christodoulou

Theory Comput. Syst., 2015

Logit Dynamics with Concurrent Updates for Local Interaction Potential Games.

[BibT_eX]

[DOI]

Algorithmica, 2015

On Sampling Simple Paths in Planar Graphs According to Their Lengths.

[BibT_eX]

[DOI]

Sandro Montanari

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Optimal collusion-resistant mechanisms with verification.

[BibT_eX]

[DOI]

Games Econ. Behav., 2014

2013

Logit Dynamics with Concurrent Updates for Local Interaction Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Data Delivery by Energy-Constrained Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2012

Reversibility and Mixing Time for Logit Dynamics with Concurrent Updates

[BibT_eX]

[DOI]

CoRR, 2012

2011

A response to "Mechanism Design with Partial Verification and Revelation Principle".

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2011

Alternatives to truthfulness are hard to recognize.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2011

2009

Online Train Disposition: To Wait or Not to Wait?

[BibT_eX]

[DOI]

Luzi Anderegg

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Strongly polynomial-time truthful mechanisms in one shot.

[BibT_eX]

[DOI]

Guido Proietti

Theor. Comput. Sci., 2009

On designing truthful mechanisms for online scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

The power of verification for one-parameter agents.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2009

Pseudonyms in Cost-Sharing Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Private Capacities in Mechanism Design.

[BibT_eX]

[DOI]

Vincenzo Auletta

Giuseppe Persiano

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

Guest editors' introduction.

[BibT_eX]

[DOI]

S. S. Ravi

ACM SIGMOBILE Mob. Comput. Commun. Rev., 2008

Interference Games in Wireless Networks.

[BibT_eX]

[DOI]

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

2007

Routing selfish unsplittable traffic.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

On-line load balancing made simple: Greedy strikes back.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem.

[BibT_eX]

[DOI]

Angelo Monti

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006

The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

New Constructions of Mechanisms with Verification.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Partial Digest is hard to solve for erroneous input data.

[BibT_eX]

[DOI]

Mark Cieliebak

Stephan J. Eidenbenz

Theor. Comput. Sci., 2005

On the approximability of the range assignment problem on radio networks in presence of selfish agents.

[BibT_eX]

[DOI]

Christoph Ambühl

Gianluca Rossi

Theor. Comput. Sci., 2005

XOR-Based Schemes for Fast Parallel IP Lookups.

[BibT_eX]

[DOI]

Gian Carlo Bongiovanni

Theory Comput. Syst., 2005

Free-Riders in Steiner Tree Cost-Sharing Games.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005

2004

On the Power Assignment Problem in Radio Networks.

[BibT_eX]

[DOI]

Mob. Networks Appl., 2004

On-line algorithms for the channel assignment problem in cellular networks.

[BibT_eX]

[DOI]

Pilu Crescenzi

Giorgio Gambosi

Discret. Appl. Math., 2004

Proximity drawings in polynomial area and volume.

[BibT_eX]

[DOI]

Paola Vocca

Comput. Geom., 2004

More Powerful and Simpler Cost-Sharing Methods.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

How to route and tax selfish unsplittable traffic.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Sharing the Cost of Multicast Transmissions in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees.

[BibT_eX]

[DOI]

Proceedings of the 1st ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, 2004

Truthful Mechanisms for Generalized Utilitarian Problems.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

The Minimum Range Assignment Problem on Linear Radio Networks.

[BibT_eX]

[DOI]

Algorithmica, 2003

Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.

[BibT_eX]

[DOI]

Christoph Ambühl

Gianluca Rossi

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Noisy Data Make the Partial Digest Problem NP-hard.

[BibT_eX]

[DOI]

Mark Cieliebak

Stephan J. Eidenbenz

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Online Load Balancing Made Simple: Greedy Strikes Back.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Improving Customer Proximity to Railway Stations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

On the approximability of two tree drawing conventions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Online train disposition: to wait or not to wait?

[BibT_eX]

[DOI]

Luzi Anderegg

Proceedings of the Algorithmic Methods and Models for Optimization of Railways, 2002

Server Placements, Roman Domination and other Dominating Set Variants.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001

On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

On Computing Ad-hoc Selective Families.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

On the Complexity of Train Assignment Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Parallel Read Operations Without Memory Contention

[BibT_eX]

[DOI]

Alexander E. Andreev

José D. P. Rolim

Electron. Colloquium Comput. Complex., 2000

Succinct Representations of Model Based Belief Revision.

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

The Power Range Assignment Problem in Radio Networks on the Plane.

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

A Note on Parallel Read Operations on Large Public Databases.

[BibT_eX]

Gian Carlo Bongiovanni

Proceedings of the ICALP Workshops 2000, 2000

1999

Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines.

[BibT_eX]

[DOI]

Alexander E. Andreev

José D. P. Rolim

Proceedings of the STACS 99, 1999

Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

1998

Strictly-upward Drawings of Ordered Search Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Linear area upward drawings of AVL trees.

[BibT_eX]

[DOI]

Adolfo Piperno

Comput. Geom., 1998

Proximity Drawings: Three Dimensions Are Better than Two.

[BibT_eX]

[DOI]

Paola Vocca

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Proximity drawings of binary trees in polynomial area.

[BibT_eX]

[DOI]

Paola Vocca

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Minimum-Area h-v Drawings of Complete Binary Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

Upward Drawings of Search Trees (Extended Abstract).

[BibT_eX]

[DOI]