Laurent Gourvès

Theor. Comput. Sci., 2019

Agreeable sets with matroidal constraints.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Local envy-freeness in house allocation problems.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2019

On a Simple Hedonic Game with Graph-Restricted Communication.

[BibT_eX]

[DOI]

Vittorio Bilò

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

On the Problem of Assigning PhD Grants.

[BibT_eX]

[DOI]

Katarína Cechlárová

Julien Lesca

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

2018

Subset sum problems with digraph constraints.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Covering Clients with Types and Budgets.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Local Envy-Freeness in House Allocation Problems.

[BibT_eX]

[DOI]

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

2017

Bi-objective matchings with the triangle inequality.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The Price of Optimum: Complexity and Approximation for a Matching Game.

[BibT_eX]

[DOI]

Algorithmica, 2017

Selfish Transportation Games.

[BibT_eX]

[DOI]

Dimitris Fotakis

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Object Allocation via Swaps along a Social Network.

[BibT_eX]

[DOI]

Julien Lesca

Anaëlle Wilczynski

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Approximate Maximin Share Allocations in Matroids.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Conference Program Design with Single-Peaked and Single-Crossing Preferences.

[BibT_eX]

[DOI]

Dimitris Fotakis

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

How Hard Is It for a Party to Nominate an Election Winner?.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Achieving Proportional Representation in Conference Programs.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Strategic Voting in a Social Context: Considerate Equilibria.

[BibT_eX]

[DOI]

Julien Lesca

Anaëlle Wilczynski

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

Worst case compromises in matroids with applications to the allocation of indivisible goods.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles.

[BibT_eX]

[DOI]

Luérbio Faria

Theor. Comput. Sci., 2015

Congestion Games with Capacitated Resources.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Approximating the optimal sequence of acquisitions and sales with a capped budget.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Approximate tradeoffs on weighted labeled matroids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Profitable Deviation Strong Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014

The Lazy Matroid Problem.

[BibT_eX]

[DOI]

Aris Pagourtzis

Proceedings of the Theoretical Computer Science, 2014

Near Fairness in Matroids.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

On regular and approximately fair allocations of indivisible goods.

[BibT_eX]

[DOI]

Diodato Ferraioli

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Single approximation for the biobjective Max TSP.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Approximation with a fixed number of solutions of some multiobjective maximization problems.

[BibT_eX]

[DOI]

Cristina Bazgan

J. Discrete Algorithms, 2013

Complexity of trails, paths and circuits in arc-colored digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Fair solutions for some multiagent optimization problems.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2013

A Protocol for Cutting Matroids Like Cakes.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

A Matroid Approach to the Worst Case Allocation of Indivisible Goods.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.

[BibT_eX]

[DOI]

Aris Pagourtzis

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Possible Winners in Approval Voting.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012

Strategic Coloring of a Graph.

[BibT_eX]

[DOI]

Internet Math., 2012

On paths, trails and closed trails in edge-colored graphs.

[BibT_eX]

[DOI]

Adria Ramos de Lyra

Discret. Math. Theor. Comput. Sci., 2012

Cooperation in multiorganization matching.

[BibT_eX]

[DOI]

Fanny Pascual

Algorithmic Oper. Res., 2012

Cost allocation protocols for network formation on connection situations.

[BibT_eX]

[DOI]

Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012

Approximate Tradeoffs on Matroids.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

2011

Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems.

[BibT_eX]

[DOI]

Cristina Bazgan

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

The Price of Optimum in a Matching Game.

[BibT_eX]

[DOI]

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

Strategy-Proof Mechanisms for Facility Location Games with Many Facilities.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

2010

Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

Labeled Traveling Salesman Problems: Complexity and approximation.

[BibT_eX]

[DOI]

Discret. Optim., 2010

The minimum reload s-t path, trail and walk problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Minimum regulation of uncoordinated matchings

[BibT_eX]

[DOI]

CoRR, 2010

The Max <i>k</i>-Cut Game and Its Strong Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On a Labeled Vehicle Routing Problem.

[BibT_eX]

[DOI]

Hatem Chatti

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On the Impact of Local Taxes in a Set Cover Game.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2010

2009

On the minimum hitting set of bundles problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On s-t paths and trails in edge-colored graphs.

[BibT_eX]

[DOI]

Fábio Protti

Electron. Notes Discret. Math., 2009

Selfish Scheduling with Setup Times.

[BibT_eX]

[DOI]

Orestis Telelis

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

On Strong Equilibria in the Max Cut Game.

[BibT_eX]

[DOI]

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

The Minimum Reload s-tPath/Trail/Walk Problems.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

2008

Three Selfish Spanning Tree Games.

[BibT_eX]

[DOI]

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

On Labeled Traveling Salesman Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Approximation in Multiobjective Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

On the Performance of Congestion Games for Optimum Satisfiability Problems.

[BibT_eX]

[DOI]

Aristotelis Giannakos

Vangelis Th. Paschos

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

Complexity and Approximation Results for the Connected Vertex Cover Problem.

[BibT_eX]

[DOI]

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

Scheduling Selfish Tasks: About the Performance of Truthful Algorithms.

[BibT_eX]

[DOI]

George Christodoulou

Fanny Pascual

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Fair cost-sharing methods for the minimum spanning tree game.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Approximation algorithms for the bi-criteria weighted MAX-CUT problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Approximation results for a bicriteria job scheduling problem on a single machine without preemption.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

(Non)-Approximability for the Multi-criteria <i>TSP</i>(1, 2).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem.

[BibT_eX]

[DOI]