A general framework for applying safety analysis to safety critical real-time applications using fault trees. - Vassilis C. Gerogiannis; Ioannis Caragiannis; Manthos A. Tsoukarellas (RTS, 1997)

Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters. - Vincenzo Auletta; Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (SIROCCO, 1997)

Efficient wavelength routing in trees with low-degree converters. - Vincenzo Auletta; Ioannis Caragiannis; Christos Kaklamanis; Giuseppe Persiano (Multichannel Optical Networks: Theory and Practice, 1998)

On the Complexity of Wavelength Converters. - Vincenzo Auletta; Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (MFCS, 1998)

Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. - Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (SIROCCO, 1998)

Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. - Athanasios Bouganis; Ioannis Caragiannis; Christos Kaklamanis (WAE, 1999)

Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note). - Constantinos Bartzis; Ioannis Caragiannis; Christos Kaklamanis; Ioannis Vergados (Euro-Par, 2000)

Greedy Dynamic Hot-Potato Routing on Arrays. - Ioannis Caragiannis; Christos Kaklamanis; Ioannis Vergados (ISPAN, 2000)

Efficient on-line communication in cellular networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (SPAA, 2000)

Symmetric Communication in All-Optical Tree Networks. - Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (Parallel Process. Lett., 2000)

Fractional Path Coloring with Applications to WDM Networks. - Ioannis Caragiannis; Afonso Ferreira; Christos Kaklamanis; Stephane Perennes; Hervé Rivano (ICALP, 2001)

Competitive Analysis of On-line Randomized Call Control in Cellular Networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (IPDPS, 2001)

Wavelength Routing in All-optical Tree Networks: A Survey. - Ioannis Caragiannis; Christos Kaklamanis; Giuseppe Persiano (Comput. Artif. Intell., 2001)

Sparse and limited wavelength conversion in all-optical tree networks. - Vincenzo Auletta; Ioannis Caragiannis; Luisa Gargano; Christos Kaklamanis; Pino Persiano (Theor. Comput. Sci., 2001)

New Results for Energy-Efficient Broadcasting in Wireless Networks. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (ISAAC, 2002)

New bounds on the size of the minimum feedback vertex set in meshes and butterflies. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (Inf. Process. Lett., 2002)

Efficient On-Line Frequency Allocation and Call Control in Cellular Networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (Theory Comput. Syst., 2002)

Randomized path coloring on binary trees. - Vincenzo Auletta; Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (Theor. Comput. Sci., 2002)

Edge coloring of bipartite graphs with constraints. - Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano (Theor. Comput. Sci., 2002)

Power Consumption Problems in Ad-Hoc Wireless Networks. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (WAOA, 2003)

Simple On-Line Algorithms for Call Control in Cellular Networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (WAOA, 2003)

Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. - Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano; Anastasios Sidiropoulos (WAOA, 2003)

A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (Inf. Process. Lett., 2003)

Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks. - Stavros Athanassopoulos; Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (ADHOC-NOW, 2004)

Online Algorithms for Disk Graphs. - Ioannis Caragiannis; Aleksei V. Fishkin; Christos Kaklamanis; Evi Papaioannou (MFCS, 2004)

Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. - Ioannis Caragiannis; Christos Kaklamanis (STACS, 2004)

Approximate constrained bipartite edge coloring. - Ioannis Caragiannis; Afonso Ferreira; Christos Kaklamanis; Stephane Perennes; Pino Persiano; Hervé Rivano (Discret. Appl. Math., 2004)

Geometric Clustering to Minimize the Sum of Cluster Sizes. - Vittorio Bilò; Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (ESA, 2005)

New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (Euro-Par, 2005)

Basic Computations in Wireless Networks. - Ioannis Caragiannis; Clemente Galdi; Christos Kaklamanis (ISAAC, 2005)

Network Load Games. - Ioannis Caragiannis; Clemente Galdi; Christos Kaklamanis (ISAAC, 2005)

A Tight Bound for Online Coloring of Disk Graphs. - Ioannis Caragiannis; Aleksei V. Fishkin; Christos Kaklamanis; Evi Papaioannou (SIROCCO, 2005)

Energy-Efficient Wireless Network Design. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (Theory Comput. Syst., 2006)

Approximation Algorithms for Path Coloring in Trees. - Ioannis Caragiannis; Christos Kaklamanis; Giuseppe Persiano (Efficient Approximation and Online Algorithms, 2006)

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. - Stavros Athanassopoulos; Ioannis Caragiannis; Christos Kaklamanis (FCT, 2007)

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs. - Ioannis Caragiannis; Aleksei V. Fishkin; Christos Kaklamanis; Evi Papaioannou (Discret. Appl. Math., 2007)

A tight bound for online colouring of disk graphs. - Ioannis Caragiannis; Aleksei V. Fishkin; Christos Kaklamanis; Evi Papaioannou (Theor. Comput. Sci., 2007)

Minimum Energy Communication in Ad Hoc Wireless Networks. - Ioannis Caragiannis; Panagiotis Kanellopoulos; Christos Kaklamanis (Handbook of Parallel Computing, 2007)

Online Call Admission Control in Wireless Cellular Networks. - Ioannis Caragiannis; Evi Papaioannou; Christos Kaklamanis (Handbook of Parallel Computing, 2007)

Topic 12: Theory and Algorithms for Parallel Computation. - Geppino Pucci; Coromoto León; Ioannis Caragiannis; Kieran T. Herley (Euro-Par, 2008)

Better bounds for online load balancing on unrelated machines. - Ioannis Caragiannis (SODA, 2008)

Communication in wireless networks with directional antennas. - Ioannis Caragiannis; Christos Kaklamanis; Evangelos Kranakis; Danny Krizanc; Andreas Wiese (SPAA, 2008)

Improving the Efficiency of Load Balancing Games through Taxes. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (WINE, 2008)

Competitive algorithms and lower bounds for online randomized call control in cellular networks. - Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (Networks, 2008)

Scheduling to maximize participation. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Evi Papaioannou (Theor. Comput. Sci., 2008)

On Low-Envy Truthful Allocations. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou (ADT, 2009)

An Improved Approximation Bound for Spanning Star Forest and Color Saving. - Stavros Athanassopoulos; Ioannis Caragiannis; Christos Kaklamanis; Maria Kyropoulou (MFCS, 2009)

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. - Stavros Athanassopoulos; Ioannis Caragiannis; Christos Kaklamanis (Theory Comput. Syst., 2009)

Wavelength Management in WDM Rings to Maximize the Number of Connections. - Ioannis Caragiannis (SIAM J. Discret. Math., 2009)

Game-Theoretic Approaches to Optimization Problems in Communication Networks. - Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli 001; Michele Flammini; Christos Kaklamanis; Gianpiero Monaco; Luca Moscardelli (Graphs and Algorithms in Communication Networks, 2010)

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks. - Alfredo Navarra; Ioannis Caragiannis; Michele Flammini; Christos Kaklamanis; Ralf Klasing (Graphs and Algorithms in Communication Networks, 2010)

Approximation Algorithms and Mechanism Design for Minimax Approval Voting. - Ioannis Caragiannis; Dimitris Kalaitzis; Evangelos Markakis (AAAI, 2010)

The Impact of Altruism on the Efficiency of Atomic Congestion Games. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou; Evi Papaioannou (TGC, 2010)

Fractional Path Coloring in Bounded Degree Trees with Applications. - Ioannis Caragiannis; Afonso Ferreira; Christos Kaklamanis; Stéphane Pérennes; Hervé Rivano (Algorithmica, 2010)

Taxes for linear atomic congestion games. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (ACM Trans. Algorithms, 2010)

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms. - Ioannis Caragiannis; Christos Kaklamanis; Maria Kyropoulou (FAW-AAIM, 2011)

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (FOCS, 2011)

Towards More Expressive Cake Cutting. - Ioannis Caragiannis; John K. Lai; Ariel D. Procaccia (IJCAI, 2011)

On the efficiency of equilibria in generalized second price auctions. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou (EC, 2011)

Voting almost maximizes social welfare despite limited communication. - Ioannis Caragiannis; Ariel D. Procaccia (Artif. Intell., 2011)

Tight Bounds for Selfish and Greedy Load Balancing. - Ioannis Caragiannis; Michele Flammini; Christos Kaklamanis; Panagiotis Kanellopoulos; Luca Moscardelli (Algorithmica, 2011)

Efficient computation of approximate pure Nash equilibria - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (CoRR, 2011)

Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (CoRR, 2011)

Revenue Guarantees in Sponsored Search Auctions. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou (ESA, 2012)

Mechanism design: from partial to probabilistic verification. - Ioannis Caragiannis; Edith Elkind; Mario Szegedy; Lan Yu (EC, 2012)

On the approximability of Dodgson and Young elections. - Ioannis Caragiannis; Jason A. Covey; Michal Feldman; Christopher M. Homan; Christos Kaklamanis; Nikos Karanikolas; Ariel D. Procaccia; Jeffrey S. Rosenschein (Artif. Intell., 2012)

On the efficiency of equilibria in generalized second price auctions - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou; Brendan Lucier; Renato Paes Leme; Éva Tardos (CoRR, 2012)

The Efficiency of Fair Division. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou (Theory Comput. Syst., 2012)

Computing approximate pure Nash equilibria in congestion games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (SIGecom Exch., 2012)

How Bad Is Selfish Voting? - Simina Brânzei; Ioannis Caragiannis; Jamie Morgenstern; Ariel D. Procaccia (AAAI, 2013)

Efficient Coordination Mechanisms for Unrelated Machine Scheduling. - Ioannis Caragiannis (Algorithmica, 2013)

Equilibria of Generalized Cut and Choose Protocols. - Simina Brânzei; Ioannis Caragiannis; David Kurokawa; Ariel D. Procaccia (CoRR, 2013)

Tight approximation bounds for combinatorial frugal coverage algorithms. - Ioannis Caragiannis; Christos Kaklamanis; Maria Kyropoulou (J. Comb. Optim., 2013)

A 6/5-approximation algorithm for the maximum 3-cover problem. - Ioannis Caragiannis; Gianpiero Monaco (J. Comb. Optim., 2013)

Energy-Efficient Communication in Multi-interface Wireless Networks. - Stavros Athanassopoulos; Ioannis Caragiannis; Christos Kaklamanis; Evi Papaioannou (Theory Comput. Syst., 2013)

Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. - Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli 001; Gianpiero Monaco (Theory Comput. Syst., 2013)

An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. - Ioannis Caragiannis; Michele Flammini; Luca Moscardelli (IEEE/ACM Trans. Netw., 2013)

Biased Games. - Ioannis Caragiannis; David Kurokawa; Ariel D. Procaccia (AAAI, 2014)

Modal Ranking: A Uniquely Robust Voting Rule. - Ioannis Caragiannis; Ariel D. Procaccia; Nisarg Shah 001 (AAAI, 2014)

Discrete preference games: social influence through coordination, and beyond. - Vincenzo Auletta; Ioannis Caragiannis; Diodato Ferraioli; Clemente Galdi; Giuseppe Persiano (CoRR, 2014)

Socially desirable approximations for dodgson's voting rule. - Ioannis Caragiannis; Christos Kaklamanis; Nikos Karanikolas; Ariel D. Procaccia (ACM Trans. Algorithms, 2014)

Revenue Guarantees in the Generalized Second Price Auction. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou (ACM Trans. Internet Techn., 2014)

Aggregating Partial Rankings with Applications to Peer Grading in Massive Online Open Courses. - Ioannis Caragiannis; George A. Krimpas; Alexandros A. Voudouris (AAMAS, 2015)

Minority Becomes Majority in Social Networks. - Vincenzo Auletta; Ioannis Caragiannis; Diodato Ferraioli; Clemente Galdi; Giuseppe Persiano (WINE, 2015)

Optimal social choice functions: A utilitarian view. - Craig Boutilier; Ioannis Caragiannis; Simi Haber; Tyler Lu; Ariel D. Procaccia; Or Sheffet (Artif. Intell., 2015)

Enforcing Efficient Equilibria in Network Design Games via Subsidies. - John Augustine; Ioannis Caragiannis; Angelo Fanelli 001; Christos Kalaitzis (Algorithmica, 2015)

Bounding the inefficiency of outcomes in generalized second price auctions. - Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos; Maria Kyropoulou; Brendan Lucier; Renato Paes Leme; Éva Tardos (J. Econ. Theory, 2015)

An improved 2-agent kidney exchange mechanism. - Ioannis Caragiannis; Aris Filos-Ratsikas; Ariel D. Procaccia (Theor. Comput. Sci., 2015)

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (ACM Trans. Economics and Comput., 2015)

An Algorithmic Framework for Strategic Fair Division. - Simina Brânzei; Ioannis Caragiannis; David Kurokawa; Ariel D. Procaccia (AAAI, 2016)

co-rank: An Online Tool for Collectively Deciding Efficient Rankings Among Peers. - Ioannis Caragiannis; George A. Krimpas; Marianna Panteli; Alexandros A. Voudouris (AAAI, 2016)

Truthful Univariate Estimators. - Ioannis Caragiannis; Ariel D. Procaccia; Nisarg Shah 001 (ICML, 2016)

Generalized Discrete Preference Games. - Vincenzo Auletta; Ioannis Caragiannis; Diodato Ferraioli; Clemente Galdi; Giuseppe Persiano (IJCAI, 2016)

Achieving Proportional Representation in Conference Programs. - Ioannis Caragiannis; Laurent Gourvès; Jérôme Monnot (IJCAI, 2016)

Discrete Preference Games in Heterogeneous Social Networks: Subverted Majorities and the Swing Player. - Vincenzo Auletta; Ioannis Caragiannis; Diodato Ferraioli; Clemente Galdi; Giuseppe Persiano (CoRR, 2016)

Welfare Guarantees for Proportional Allocations. - Ioannis Caragiannis; Alexandros A. Voudouris (Theory Comput. Syst., 2016)

Space lower bounds for low-stretch greedy embeddings. - Ioannis Caragiannis; Christos Kalaitzis (Theor. Comput. Sci., 2016)

When Do Noisy Votes Reveal the Truth? - Ioannis Caragiannis; Ariel D. Procaccia; Nisarg Shah 001 (ACM Trans. Economics and Comput., 2016)

Limitations of Deterministic Auction Design for Correlated Bidders. - Ioannis Caragiannis; Christos Kaklamanis; Maria Kyropoulou (ACM Trans. Comput. Theory, 2016)

Dodgson's Rule and Young's Rule. - Ioannis Caragiannis; Edith Hemaspaandra; Lane A. Hemaspaandra (Handbook of Computational Social Choice, 2016)

Robustness in Discrete Preference Games. - Vincenzo Auletta; Ioannis Caragiannis; Diodato Ferraioli; Clemente Galdi; Giuseppe Persiano (AAMAS, 2017)

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. - Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco (ICALP, 2017)

Bounding the Inefficiency of Compromise. - Ioannis Caragiannis; Panagiotis Kanellopoulos; Alexandros A. Voudouris (IJCAI, 2017)

Learning a Ground Truth Ranking Using Noisy Approval Votes. - Ioannis Caragiannis; Evi Micha (IJCAI, 2017)

Opting Into Optimal Matchings. - Avrim Blum; Ioannis Caragiannis; Nika Haghtalab; Ariel D. Procaccia; Eviatar B. Procaccia; Rohit Vaish (SODA, 2017)

Information Retention in Heterogeneous Majority Dynamics. - Vincenzo Auletta; Ioannis Caragiannis; Diodato Ferraioli; Clemente Galdi; Giuseppe Persiano (WINE, 2017)

Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling. - Ioannis Caragiannis; Vasilis Gkatzelis; Cosimo Vinci (WINE, 2017)

Efficiency and complexity of price competition among single-product vendors. - Ioannis Caragiannis; Xenophon Chatzigeorgiou; Panagiotis Kanellopoulos; George A. Krimpas; Nikos Protopapas; Alexandros A. Voudouris (Artif. Intell., 2017)

Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin (Algorithmica, 2017)

Subset Selection Via Implicit Utilitarian Voting. - Ioannis Caragiannis; Swaprava Nath; Ariel D. Procaccia; Nisarg Shah 001 (J. Artif. Intell. Res., 2017)

Knowledge, Fairness, and Social Constraints. - Haris Aziz 001; Sylvain Bouveret; Ioannis Caragiannis; Ira Giagkousi; Jérôme Lang (AAAI, 2018)

Near-Optimal Asymmetric Binary Matrix Partitions. - Fidaa Abed; Ioannis Caragiannis; Alexandros A. Voudouris (Algorithmica, 2018)

Truthful mechanisms for ownership transfer with expert advice. - Ioannis Caragiannis; Aris Filos-Ratsikas; Swaprava Nath; Alexandros A. Voudouris (CoRR, 2018)

Fair allocation of combinations of indivisible goods and chores. - Haris Aziz 001; Ioannis Caragiannis; Ayumi Igarashi 001 (CoRR, 2018)

Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items. - Ioannis Caragiannis; Nick Gravin; Xin Huang (EC, 2019)

A Contribution to the Critique of Liquid Democracy. - Ioannis Caragiannis; Evi Micha (IJCAI, 2019)

Deanonymizing Social Networks Using Structural Information. - Ioannis Caragiannis; Evanthia Tsitsoka (IJCAI, 2019)

Optimizing positional scoring rules for rank aggregation. - Ioannis Caragiannis; Xenophon Chatzigeorgiou; George A. Krimpas; Alexandros A. Voudouris (Artif. Intell., 2019)

An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. - Ioannis Caragiannis; Angelo Fanelli 001 (Theory Comput. Syst., 2019)

The Unreasonable Fairness of Maximum Nash Welfare. - Ioannis Caragiannis; David Kurokawa; Hervé Moulin 001; Ariel D. Procaccia; Nisarg Shah 001; Junxing Wang (ACM Trans. Economics and Comput., 2019)

Simple posted pricing mechanisms for selling a divisible item. - Ioannis Caragiannis; Apostolis Kerentzis (CoRR, 2020)

How Effective Can Simple Ordinal Peer Grading Be? - Ioannis Caragiannis; George A. Krimpas; Alexandros A. Voudouris (ACM Trans. Economics and Comput., 2020)

On Interim Envy-Free Allocation Lotteries. - Ioannis Caragiannis; Panagiotis Kanellopoulos; Maria Kyropoulou (EC, 2021)

Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. - Ioannis Caragiannis; Nick Gravin; Pinyan Lu; Zihe Wang 001 (WINE, 2021)

Computing Envy-Freeable Allocations with Limited Subsidies. - Ioannis Caragiannis; Stavros Ioannidis 001 (WINE, 2021)

Stable fractional matchings. - Ioannis Caragiannis; Aris Filos-Ratsikas; Panagiotis Kanellopoulos; Rohit Vaish (Artif. Intell., 2021)

On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. - Ioannis Caragiannis; Angelo Fanelli 001 (J. Comput. Syst. Sci., 2021)

The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users. - Ioannis Caragiannis; Alexandros A. Voudouris (Math. Oper. Res., 2021)

The Complexity of Learning Approval-Based Multiwinner Voting Rules. - Ioannis Caragiannis; Karl Fehrs (AAAI, 2022)

A Little Charity Guarantees Fair Connected Graph Partitioning. - Ioannis Caragiannis; Evi Micha; Nisarg Shah 001 (AAAI, 2022)

Beyond Cake Cutting: Allocating Homogeneous Divisible Goods. - Ioannis Caragiannis; Vasilis Gkatzelis; Alexandros Psomas 001; Daniel Schoepflin 001 (AAMAS, 2022)

Fair allocation of indivisible goods and chores. - Haris Aziz 001; Ioannis Caragiannis; Ayumi Igarashi 001; Toby Walsh (Auton. Agents Multi Agent Syst., 2022)

Evaluating approval-based multiwinner voting in terms of robustness to noise. - Ioannis Caragiannis; Christos Kaklamanis; Nikos Karanikolas; George A. Krimpas (Auton. Agents Multi Agent Syst., 2022)

The metric distortion of multiwinner voting. - Ioannis Caragiannis; Nisarg Shah 001; Alexandros A. Voudouris (Artif. Intell., 2022)

Bounding the Inefficiency of Compromise in Opinion Formation. - Ioannis Caragiannis; Panagiotis Kanellopoulos; Alexandros A. Voudouris (Algorithmica, 2022)

Adjudication with Rational Jurors. - Ioannis Caragiannis; Nikolaj I. Schwartzbach (CoRR, 2022)

Almost envy-free allocations with connected bundles. - Vittorio Bilò; Ioannis Caragiannis; Michele Flammini; Ayumi Igarashi 001; Gianpiero Monaco; Dominik Peters; Cosimo Vinci; William S. Zwicker (Games Econ. Behav., 2022)

Impartial Selection with Additive Approximation Guarantees. - Ioannis Caragiannis; George Christodoulou 001; Nicos Protopapas (Theory Comput. Syst., 2022)

State of the Art Analysis of Resource Allocation Techniques in 5G MIMO Networks. - Christos Bouras; Ioannis Caragiannis; Apostolos Gkamas; Nicos Protopapas; Tasos Sardelis; Kyriakos N. Sgarbas (ICOIN, 2023)

New Fairness Concepts for Allocating Indivisible Items. - Ioannis Caragiannis; Jugal Garg; Nidhi Rathi; Eklavya Sharma; Giovanna Varricchio (IJCAI, 2023)

Outsourcing Adjudication to Strategic Jurors. - Ioannis Caragiannis; Nikolaj I. Schwartzbach (IJCAI, 2023)

Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming. - Ioannis Caragiannis; Zhile Jiang (STOC, 2023)

Impartial Selection with Prior Information. - Ioannis Caragiannis; George Christodoulou 001; Nicos Protopapas (WWW, 2023)

Portioning using ordinal preferences: Fairness and efficiency. - Stéphane Airiau; Haris Aziz 001; Ioannis Caragiannis; Justin Kruger; Jérôme Lang; Dominik Peters (Artif. Intell., 2023)

Beyond the worst case: Distortion in impartial culture electorate. - Ioannis Caragiannis; Karl Fehrs (CoRR, 2023)

Low-Distortion Clustering with Ordinal and Limited Cardinal Information. - Jakob Burkhardt; Ioannis Caragiannis; Karl Fehrs; Matteo Russo 002; Chris Schwiegelshohn; Sudarshan Shyam (AAAI, 2024)

On the Complexity of Pareto-Optimal and Envy-Free Lotteries. - Ioannis Caragiannis; Kristoffer Arnsfelt Hansen; Nidhi Rathi (AAMAS, 2024)

Can a Few Decide for Many? The Metric Distortion of Sortition. - Ioannis Caragiannis; Evi Micha; Jannik Peters 001 (ICML, 2024)

Randomized Learning-Augmented Auctions with Revenue Guarantees. - Ioannis Caragiannis; Georgios Kalantzis 002 (IJCAI, 2024)

Proportional Fairness in Non-Centroid Clustering. - Ioannis Caragiannis; Evi Micha; Nisarg Shah 001 (NeurIPS, 2024)

Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship. - Ioannis Caragiannis; Sebastian Homrighausen (SAGT, 2024)

Truthful aggregation of budget proposals with proportionality guarantees. - Ioannis Caragiannis; George Christodoulou 001; Nicos Protopapas (Artif. Intell., 2024)

An impossibility result for strongly group-strategyproof multi-winner approval-based voting. - Ioannis Caragiannis; Rob LeGrand; Evangelos Markakis; Emmanouil Pountourakis (CoRR, 2024)

On the satisfiability of random 3-SAT formulas with k-wise independent clauses. - Ioannis Caragiannis; Nick Gravin; Zhile Jiang (CoRR, 2024)

Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship. - Ioannis Caragiannis; Aris Filos-Ratsikas; Søren Kristoffer Stiil Frederiksen; Kristoffer Arnsfelt Hansen; Zihan Tan (Math. Program., 2024)

Truthful ownership transfer with expert advice. - Ioannis Caragiannis; Aris Filos-Ratsikas; Swaprava Nath; Alexandros A. Voudouris (Math. Program., 2024)

Repeatedly matching items to agents fairly and efficiently. - Ioannis Caragiannis; Shivika Narang (Theor. Comput. Sci., 2024)

Optimizing Over Serial Dictatorships. - Ioannis Caragiannis; Nidhi Rathi (Theory Comput. Syst., 2024)

Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity. - Ioannis Caragiannis; Kurt Mehlhorn; Nidhi Rathi (AAAI, 2025)

A New Lower Bound for Multicolor Discrepancy with Applications to Fair Division. - Ioannis Caragiannis; Kasper Green Larsen; Sudarshan Shyam (SAGT, 2025)

A new lower bound for multi-color discrepancy with applications to fair division. - Ioannis Caragiannis; Kasper Green Larsen; Sudarshan Shyam (CoRR, 2025)

Mechanisms for Selling an Item Among a Strategic Bidder and a Profiled Agent. - Ioannis Caragiannis; Georgios Kalantzis 002 (CoRR, 2025)

Quantile agent utility and implications to randomized social choice. - Ioannis Caragiannis; Sanjukta Roy 001 (CoRR, 2025)

Rethinking Pricing in Energy Markets: Pay-as-Bid vs Pay-as-Clear. - Ioannis Caragiannis; Zhile Jiang; Stratis Skoulakis (CoRR, 2025)

Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations. - Martin Jupakkal Andersen; Ioannis Caragiannis; Anders Bo Ipsen; Alexander Søltoft (CoRR, 2025)