Michele Flammini

Hugo Gilbert

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

The Quality of Content Publishing in the Digital Era.

[BibT_eX]

[DOI]

Cosimo Vinci

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Strategyproof Mechanisms for Friends and Enemies Games.

[BibT_eX]

[DOI]

Bojana Kodric

Giovanna Varricchio

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

The Impact of Selfishness in Hypergraph Hedonic Games.

[BibT_eX]

[DOI]

Alessandro Aloisio

Cosimo Vinci

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Guest Editorial: Special Issue on Algorithmic Game Theory.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

On Non-Cooperativeness in Social Distance Games.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

Almost Envy-Free Allocations with Connected Bundles.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Building International Doctoral Schools in Computer Science in Italy, De Nicola's Way.

[BibT_eX]

[DOI]

Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

2018

Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

Pricing Problems with Buyer Preselection.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

On Fair Price Discrimination in Multi-Unit Markets.

[BibT_eX]

[DOI]

Manuel Mauro

Matteo Tonelli

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Online Coalition Structure Generation in Graph Games.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

On the Impact of Buyers Preselection in Pricing Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

On Social Envy-Freeness in Multi-Unit Markets.

[BibT_eX]

[DOI]

Manuel Mauro

Matteo Tonelli

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Network Movement Games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games.

[BibT_eX]

[DOI]

Qiang Zhang

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games.

[BibT_eX]

[DOI]

Raffaello Carosi

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

On Pareto Optimality in Social Distance Games.

[BibT_eX]

[DOI]

Alkida Balliu

Dennis Olivetti

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Nash Stability in Social Distance Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Report on 1st GSSI Summer Meeting on Algorithms.

[BibT_eX]

[DOI]

Giuseppe Persiano

Bull. EATCS, 2016

Price of Pareto Optimality in Hedonic Games.

[BibT_eX]

[DOI]

Edith Elkind

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

On the Price of Stability of Fractional Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Nash Stability in Fractional Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Approximating the Revenue Maximization Problem with Sharp Demands.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2014, 2014

The Price of Envy-Freeness in Machine Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

The price of stability of fair undirected broadcast games is constant.

[BibT_eX]

[DOI]

SIGecom Exch., 2013

The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

On the Sequential Price of Anarchy of Isolation Games.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Some Anomalies of Farsighted Strategic Behavior.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Mobile Network Creation Games.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

On Bidimensional Congestion Games.

[BibT_eX]

[DOI]

Vasco Gallotti

Proceedings of the Structural Information and Communication Complexity, 2012

2011

Optimizing regenerator cost in traffic grooming.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Performance of One-Round Walks in Linear Congestion Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

FUB, IASI-CNR, UNIVAQ at TREC 2011 Microblog Track.

[BibT_eX]

[DOI]

Fondazione Ugo Bordoni

Proceedings of The Twentieth Text REtrieval Conference, 2011

Social Context Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Improved Stable Retrieval in Noisy Collections.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information Retrieval Theory, 2011

2010

On the bicriteria k-server problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Designing Fast Converging Cost Sharing Methods for Multicast Transmissions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Stackelberg Strategies for Network Design Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Traffic Grooming: Combinatorial Results and Practical Resolutions.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Game-Theoretic Approaches to Optimization Problems in Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

Layouts for mobility management in wireless ATM networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

On the complexity of the regenerator placement problem in optical networks.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Performances of One-Round Walks in Linear Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Minimizing total busy time in parallel scheduling with application to optical networks.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

On the Performances of Nash Equilibria in Isolation Games.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Tightening the upper bound for the minimum energy broadcasting.

[BibT_eX]

[DOI]

Wirel. Networks, 2008

Selfishness, collusion and power of local search for the ADMs minimization problem.

[BibT_eX]

[DOI]

Comput. Networks, 2008

Graphical Congestion Games.

[BibT_eX]

[DOI]

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

Graphical congestion games with linear latencies.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

When Ignorance Helps: Graphical Multicast Cost Sharing Games.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

The Speed of Convergence in Congestion Games under Best-Response Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2008, 2008

2007

Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.

[BibT_eX]

[DOI]

Stefania Di Giannantonio

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Experimental Evaluations of Algorithms for IP Table Minimization.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

On the convergence of multicast games in directed networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Sharing the cost of multicast transmissions in wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Efficient offline algorithms for the bicriteria k-server problem and online applications.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Competitive algorithms for the bicriteria k-server problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Approximating the Traffic Grooming Problem in Tree and Star Networks.

[BibT_eX]

[DOI]

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

On Minimizing the Number of ADMs in a General Topology Optical Network.

[BibT_eX]

[DOI]

Mordechai Shalom

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Tight Bounds for Selfish and Greedy Load Balancing.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Christos Kaklamanis

Panagiotis Kanellopoulos

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

Synthesis of Concurrent and Distributed Adaptors for Component-Based Systems.

[BibT_eX]

[DOI]

Proceedings of the Software Architecture, Third European Workshop, 2006

On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing.

[BibT_eX]

[DOI]

Mordechai Shalom

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

On routing of wavebands for all-to-all communications in all-optical paths and cycles.

[BibT_eX]

[DOI]

Andrzej Proskurowski

Theor. Comput. Sci., 2005

The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting.

[BibT_eX]

[DOI]

Stéphane Pérennes

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Asymptotically Optimal Solutions for Small World Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 19th International Conference, 2005

On Nash Equilibria in Non-cooperative All-Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Approximating the Traffic Grooming Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols.

[BibT_eX]

[DOI]

Stéphane Pérennes

SIAM J. Discret. Math., 2004

Sharing the cost of multicast transmissions in wireless networks.

[BibT_eX]

[DOI]

Chiara Di Francescomarino

Giovanna Melideo

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

On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Pareto Approximations for the Bicriteria Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

On the IP Routing Tables Minimization with Addresses Reassignment.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Improved approximation results for the minimum energy broadcasting problem.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004

2003

Deadlock Prevention by Acyclic Orientations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Minimum Flow Time Graph Ordering.

[BibT_eX]

[DOI]

Claudio Arbib

Fabrizio Marinelli

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

Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem.

[BibT_eX]

[DOI]

Roberto Giovannelli

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles.

[BibT_eX]

Andrzej Proskurowski

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Wireless ATM Layouts for Chain Networks.

[BibT_eX]

[DOI]

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

Quality of Service in Wireless Networks.

[BibT_eX]

[DOI]

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

Dynamic Layouts for Wireless ATM.

[BibT_eX]

[DOI]

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

2002

On the upper chromatic number of (v3, b2)-configurations.

[BibT_eX]

[DOI]

Claudio Arbib

Discret. Appl. Math., 2002

Allocation Problems in Scalable Distributed Data Structures.

[BibT_eX]

Adriano Di Pasquale

Enrico Nardelli

Proceedings of the Distributed Data & Structures 4, 2002

Routing and Communication in Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2002, 2002

2001

On the Optimality of General Lower Bounds for Broadcasting and Gossiping.

[BibT_eX]

[DOI]

Stephane Perennes

SIAM J. Discret. Math., 2001

2000

Low-congested interval routing schemes for hypercubelike networks.

[BibT_eX]

[DOI]

Serafino Cicerone

Gabriele Di Stefano

Networks, 2000

How to Survive While Visiting a Graph.

[BibT_eX]

[DOI]

Claudio Arbib

Enrico Nardelli

Discret. Appl. Math., 2000

On Multicriteria Online Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

Compact-Port Routing Models and Applications to Distance-Hereditary Graphs.

[BibT_eX]

Serafino Cicerone

Gabriele Di Stefano

Proceedings of the SIROCCO'99, 1999

1998

Multidimensional Interval Routing Schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load.

[BibT_eX]

[DOI]

Tamar Eilam

Parallel Process. Lett., 1998

Characterization results of all shortest paths interval routing schemes.

[BibT_eX]

Proceedings of the SIROCCO'98, 1998

Static and Dynamic Low-Congested Interval Routing Schemes.

[BibT_eX]

[DOI]

Serafino Cicerone

Gabriele Di Stefano

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

On Devising Boolean Routing Schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

On the Hardness of Devising Interval Routing Schemes.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1997

Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).

[BibT_eX]

[DOI]

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

ATM Layouts with Bounded Hop Count and Congestion.

[BibT_eX]

[DOI]

Enrico Nardelli

Guido Proietti

Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Deadlock-Free Interval Routing Schemes.

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Simple, Efficient Routing Schemes for All-Optical Networks.

[BibT_eX]

[DOI]

Christian Scheideler

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Lower Bounds on Systolic Gossip.

[BibT_eX]

[DOI]

Stephane Perennes

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract).

[BibT_eX]

[DOI]

Tamar Eilam

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1995

On Devising Boolean Routing Schemes.

[BibT_eX]

[DOI]

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

Multi-Dimensional Interval Routing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Interval Routing Schemes.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Systolic Acyclic Orientations for Deadlock Prevention.

[BibT_eX]

Proceedings of the Structure, Information and Communication Complexity, 1995

The Complexity of Interval Routing on Random Graphs.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Jan van Leeuwen

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994

On the Learnability of Monotone k \mu-DNF Formulae Under Product Distributions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Interval Labeling Scheme for Chordal Rings.

[BibT_eX]

Proceedings of the Structural Information and Communication Complexity, 1994

1993

Boolean Routing.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

1992

Learning DNF Formulae Under Classes of Probability Distributions.

[BibT_eX]

[DOI]