Ioannis Caragiannis

According to our database1, Ioannis Caragiannis authored at least 114 papers between 1997 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Almost Envy-Free Allocations with Connected Bundles.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Knowledge, Fairness, and Social Constraints.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Information Retention in Heterogeneous Majority Dynamics.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Opting Into Optimal Matchings.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Learning a Ground Truth Ranking Using Noisy Approval Votes.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Bounding the Inefficiency of Compromise.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Robustness in Discrete Preference Games.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Optimizing Positional Scoring Rules for Rank Aggregation.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Dodgson's Rule and Young's Rule.
Proceedings of the Handbook of Computational Social Choice, 2016

Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

How Effective Can Simple Ordinal Peer Grading Be?
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The Unreasonable Fairness of Maximum Nash Welfare.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Subset Selection via Implicit Utilitarian Voting.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Achieving Proportional Representation in Conference Programs.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Generalized Discrete Preference Games.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Truthful Univariate Estimators.
Proceedings of the 33nd International Conference on Machine Learning, 2016

co-rank: An Online Tool for Collectively Deciding Efficient Rankings Among Peers.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

An Algorithmic Framework for Strategic Fair Division.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Bounding the inefficiency of outcomes in generalized second price auctions.
J. Economic Theory, 2015

Minority Becomes Majority in Social Networks.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Near-Optimal Asymmetric Binary Matrix Partitions.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Efficiency and Complexity of Price Competition Among Single-Product Vendors.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Aggregating Partial Rankings with Applications to Peer Grading in Massive Online Open Courses.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Revenue Guarantees in the Generalized Second Price Auction.
ACM Trans. Internet Techn., 2014

Welfare Guarantees for Proportional Allocations.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Modal Ranking: A Uniquely Robust Voting Rule.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Biased Games.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Tight approximation bounds for combinatorial frugal coverage algorithms.
J. Comb. Optim., 2013

When do noisy votes reveal the truth?
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Limitations of Deterministic Auction Design for Correlated Bidders.
Proceedings of the Algorithms - ESA 2013, 2013

How Bad Is Selfish Voting?
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Computing approximate pure Nash equilibria in congestion games.
SIGecom Exchanges, 2012

Enforcing efficient equilibria in network design games via subsidies.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Space Lower Bounds for Low-Stretch Greedy Embeddings.
Proceedings of the Structural Information and Communication Complexity, 2012

Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Mechanism design: from partial to probabilistic verification.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Optimal social choice functions: a utilitarian view.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Revenue Guarantees in Sponsored Search Auctions.
Proceedings of the Algorithms - ESA 2012, 2012

2011
An Improved 2-Agent Kidney Exchange Mechanism.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

On the efficiency of equilibria in generalized second price auctions.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Towards More Expressive Cake Cutting.
Proceedings of the IJCAI 2011, 2011

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Fractional Path Coloring in Bounded Degree Trees with Applications.
Algorithmica, 2010

The Impact of Altruism on the Efficiency of Atomic Congestion Games.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Socially desirable approximations for Dodgson's voting rule.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Improved Lower Bounds on the Price of Stability of Undirected Network Design Games.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Voting Almost Maximizes Social Welfare Despite Limited Communication.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Approximation Algorithms and Mechanism Design for Minimax Approval Voting.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Game-Theoretic Approaches to Optimization Problems in Communication Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.
Theory Comput. Syst., 2009

The Efficiency of Fair Division.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On the approximability of Dodgson and Young elections.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Efficient coordination mechanisms for unrelated machine scheduling.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Energy-Efficient Communication in Multi-interface Wireless Networks.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

An Improved Approximation Bound for Spanning Star Forest and Color Saving.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

On Low-Envy Truthful Allocations.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008
Competitive algorithms and lower bounds for online randomized call control in cellular networks.
Networks, 2008

Improving the Efficiency of Load Balancing Games through Taxes.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Communication in wireless networks with directional antennas.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Better bounds for online load balancing on unrelated machines.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Topic 12: Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2008, 2008

2007
Online Call Admission Control in Wireless Cellular Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Minimum Energy Communication in Ad Hoc Wireless Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

A tight bound for online colouring of disk graphs.
Theor. Comput. Sci., 2007

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs.
Discrete Applied Mathematics, 2007

Wavelength Management in WDM Rings to Maximize the Number of Connections.
Proceedings of the STACS 2007, 2007

An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006
Approximation Algorithms for Path Coloring in Trees.
Proceedings of the Efficient Approximation and Online Algorithms, 2006

Scheduling to Maximize Participation.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Tight Bounds for Selfish and Greedy Load Balancing.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Taxes for Linear Atomic Congestion Games.
Proceedings of the Algorithms, 2006

2005
A Tight Bound for Online Coloring of Disk Graphs.
Proceedings of the Structural Information and Communication Complexity, 2005

Network Load Games.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Basic Computations in Wireless Networks.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

Geometric Clustering to Minimize the Sum of Cluster Sizes.
Proceedings of the Algorithms, 2005

2004
Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks.
Proceedings of the STACS 2004, 2004

Online Algorithms for Disk Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem.
Inf. Process. Lett., 2003

Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Simple On-Line Algorithms for Call Control in Cellular Networks.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Power Consumption Problems in Ad-Hoc Wireless Networks.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Energy-Efficient Wireless Network Design.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks.
Theory Comput. Syst., 2002

Wavelength Routing in All-Optical Tree Networks: A Survey.
Bulletin of the EATCS, 2002

New Results for Energy-Efficient Broadcasting in Wireless Networks.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
Sparse and limited wavelength conversion in all-optical tree networks.
Theor. Comput. Sci., 2001

Wavelength Routing in All-optical Tree Networks: A Survey.
Computers and Artificial Intelligence, 2001

Approximate Constrained Bipartite Edge Coloring.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies.
Proceedings of the SIROCCO 8, 2001

Competitive Analysis of On-line Randomized Call Control in Cellular Networks.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Fractional Path Coloring with Applications to WDM Networks.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Symmetric Communication in All-Optical Tree Networks.
Parallel Processing Letters, 2000

Efficient on-line communication in cellular networks.
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Greedy Dynamic Hot-Potato Routing on Arrays.
Proceedings of the 5th International Symposium on Parallel Architectures, 2000

Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note).
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

Randomized path coloring on binary trees.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks.
Proceedings of the Algorithm Engineering, 1999

Edge Coloring of Bipartite Graphs with Constraints.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1998
Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees.
Proceedings of the SIROCCO'98, 1998

On the Complexity of Wavelength Converters.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Efficient wavelength routing in trees with low-degree converters.
Proceedings of the Multichannel Optical Networks: Theory and Practice, 1998

1997
Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters.
Proceedings of the SIROCCO'97, 1997

A general framework for applying safety analysis to safety critical real-time applications using fault trees.
Proceedings of the Ninth Euromicro Workshop on Real-Time Systems, 1997


  Loading...