yusuke1997/dblp-id-title huggingface dataset:
Automatic Test Generation for Java-Card Applets
FIMI '04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Brighton, UK, November 1, 2004
A Space Optimization for FP-Growth
MAFIA: A Performance Study of Mining Maximal Frequent Itemsets
Algorithmic Features of Eclat
ARMOR: Association Rule Mining based on ORacle
Advances in Frequent Itemset Mining Implementations: Introduction to FIMI03
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
WebDocs: a real-life huge transactional dataset
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
Mining Frequent Itemsets using Patricia Tries
AIM: Another Itemset Miner
Surprising Results of Trie-based FIM Algorithms
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Efficiently Using Prefix-trees in Mining Frequent Itemsets
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
Recursion Pruning for the Apriori Algorithm
nonordfp: An FP-growth variation without rebuilding the FP-tree
AIM2: Improved implementation of AIM
Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization
Apriori, A Depth First Implementation
Intersecting data to closed sets with constraints
AFOPT: An Efficient Implementation of Pattern Growth Approach
A fast APRIORI implementation
Reducing the Main Memory Consumptions of FPmax* and FPclose
FIMI '03, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA
kDCI: on using direct count up to the third iteration
LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets
ABS: Adaptive Borders Search of frequent itemsets
A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback
Fair Division with Interdependent Values
On the Price of Anarchy of Highly Congested Nonatomic Network Games
Window-Games between TCP Flows
Analyzing Power in Weighted Voting Games with Super-Increasing Weights
Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings
Reconciling Selfish Routing with Social Good
Throw One's Cake - and Eat It Too
The Complexity of Cake Cutting with Unequal Shares
A Simplex-Like Algorithm for Fisher Markets
Distortion of Multi-winner Elections on the Line Metric: The Polar Comparison Rule
Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations
Strategic Characterization of the Index of an Equilibrium
Truthful Two-Facility Location with Candidate Locations
Excluding Braess's Paradox in Nonatomic Selfish Routing
Monotonicity in Mechanism Design
Repeatedly Matching Items to Agents Fairly and Efficiently
Maximin Fair Allocation of Indivisible Items Under Cost Utilities
Automated Equilibrium Analysis of 2˟ 2˟ 2 Games
Frugal Routing on Wireless Ad-Hoc Networks
Weakly-Acyclic (Internet) Routing Games
Efficiency of Restricted Tolls in Non-atomic Network Routing Games
Facets of the Fully Mixed Nash Equilibrium Conjecture
Commitment in First-Price Auctions
Near-Linear MIR Algorithms for Stochastically-Ordered Priors
The Parallel Complexity of Coloring Games
Dynamic Equilibria in Time-Varying Networks
Information Elicitation for Bayesian Auctions
Nash Equilibria in Fisher Market
Equilibrium Inefficiency in Resource Buying Games with Load-Dependent Costs
Sublogarithmic Approximation for Tollbooth Pricing on a Cactus
Brief Announcement: On Effective Affirmative Action in School Choice
A Clustering Coefficient Network Formation Game
Can Bandwidth Sharing Be Truthful?
The k-Facility Location Problem via Optimal Transport: A Bayesian Study of the Percentile Mechanisms
Scheduling a Cascade with Opposing Influences
Constant-Approximate and Constant-Strategyproof Two-Facility Location
A Two-Stage Mechanism for Ordinal Peer Assessment
Computation and Incentives of Competitive Equilibria in a Matching Market
Price of Stability in Survivable Network Design
The Multiple Attribution Problem in Pay-Per-Conversion Advertising
A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It
Fair Division with Subsidy
Data Curation from Privacy-Aware Agents
Congestion Games with Player-Specific Costs Revisited
Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching
Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games
The Balloon Popping Problem Revisited: Lower and Upper Bounds
On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games Under Noisy Feedback
The Big Match in Small Space - (Extended Abstract)
A Direct Reduction from k -Player to 2-Player Approximate Nash Equilibrium
When is Truthfully Allocating Chores No Harder Than Goods?
Imperfect Best-Response Mechanisms
Subjective vs.Objective Reality - The Risk of Running Late
On the Impossibility of Black-Box Transformations in Mechanism Design
Removal and Threshold Pricing: Truthful Two-Sided Markets with Multi-dimensional Participants
Complexity of Rational and Irrational Nash Equilibria
Prediction-Sharing During Training and Inference
Stackelberg Vertex Cover on a Path
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences
Symmetries of Quasi-Values
The Frontier of Intractability for EFX with Two Agents
Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Amsterdam, The Netherlands, September 3-6, 2024, Proceedings
Multimarket Oligopolies with Restricted Market Access
On Equilibria for ADM Minimization Games
Bertrand Competition in Networks
Pareto Optimality in Coalition Formation
Robustness Among Multiwinner Voting Rules
Efficient Money Burning in General Domains
Coordinating Monetary Contributions in Participatory Budgeting
Algorithmic Game Theory - 15th International Symposium, SAGT 2022, Colchester, UK, September 12-15, 2022, Proceedings
Computation of Nash Equilibria of Attack and Defense Games on Networks
Algorithmic Game Theory - 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021, Proceedings
Gehrlein Stable Committee with Multi-modal Preferences
The Communication Burden of Single Transferable Vote, in Practice
Principal-Agent Problems with Present-Biased Agents
The Convergence of Iterative Delegations in Liquid Democracy in a Social Network
On Reward Sharing in Blockchain Mining Pools
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling
Condorcet Markets
Performances of One-Round Walks in Linear Congestion Games
Characterizing Incentive Compatibility for Convex Valuations
On the Approximability of Combinatorial Exchange Problems
A New Derandomization of Auctions
Line-Up Elections: Parallel Voting with Shared Candidate Pool
Sharing Information with Competitors
"Beat-Your-Rival" Routing Games
Characterizing the Existence of Potential Functions in Weighted Congestion Games
Cooperative Equilibria in Iterated Social Dilemmas
On a Simple Hedonic Game with Graph-Restricted Communication
Brief Announcement: Computation of Fisher-Gale Equilibrium by Auction
Computing Constrained Approximate Equilibria in Polymatrix Games
The Anarchy of Scheduling Without Money
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics
An Improved Bound for the Tree Conjecture in Network Creation Games
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements
Congestion Games with Priority-Based Scheduling
Walrasian Equilibrium with Few Buyers
Combinatorial Agency of Threshold Functions
Bribeproof Mechanisms for Two-Values Domains
Mechanisms and Impossibilities for Truthful, Envy-Free Allocations
Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities
Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance
Metric Distortion Under Group-Fair Objectives
Cost Sharing in Two-Sided Markets
Price of Anarchy in Congestion Games with Altruistic/Spiteful Players
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
Matroid Bayesian Online Selection
Pricing Exotic Derivatives Using Regret Minimization
Financial Networks with Singleton Liability Priorities
Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games
Computational Complexity of k-Stable Matchings
Convergence of Ordered Improvement Paths in Generalized Congestion Games
Simple Games Versus Weighted Voting Games
Sensitivity of Wardrop Equilibria
Value of Targeting
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games
A Near Optimal Mechanism for Energy Aware Scheduling
Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game
Social Welfare in Battery Charging Games
Improved Hardness Results for the Clearing Problem in Financial Networks with Credit Default Swaps
Dividing Connected Chores Fairly
Computational Game Theory
Fairness Under Equal-Sized Bundles: Impossibility Results and Approximation Guarantees
Prophet Inequality with Competing Agents
Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games
Ambiguous Contracts
Efficient Rational Proofs with Strong Utility-Gap Guarantees
Pareto Optimal Matchings in Many-to-Many Markets with Ties
Strategy-Proof Budgeting via a VCG-Like Mechanism
Two-Buyer Sequential Multiunit Auctions with No Overbidding
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents
The Price of Anarchy in Network Creation Games Is (Mostly) Constant
Hedonic Expertise Games
Risk Robust Mechanism Design for a Prospect Theoretic Buyer
Inefficiency of Games with Social Context
Strategyproof Facility Location for Three Agents on a Circle
Agent-Constrained Truthful Facility Location Games
Algorithmic Game Theory - 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013. Proceedings
Auction Design with a Revenue Target
Approximate Equilibria for Strategic Two Person Games
Persuading Agents in Opinion Formation Games
Minimal Subsidies in Expense Sharing Games
Hide and Seek Game with Multiple Resources
The Impact of Spillback on the Price of Anarchy for Flows over Time
Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games
On Proportional Allocation in Hedonic Games
Vote Delegation and Misbehavior
On the Communication Complexity of Approximate Nash Equilibria
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
Is Shapley Cost Sharing Optimal?
Cost-Sharing Models in Participatory Sensing
Free-Riding and Free-Labor in Combinatorial Agency
Maximum Stable Matching with One-Sided Ties of Bounded Length
Equilibria of Plurality Voting: Lazy and Truth-Biased Voters
Risk-Free Bidding in Complement-Free Combinatorial Auctions
Constrained Swap Dynamics over a Social Network in Distributed Resource Reallocation
Targeted Intervention in Random Graphs
Algorithmic Game Theory - 18th International Symposium, SAGT 2025, Bath, UK, September 2-5, 2025, Proceedings
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
Online Fair Division for Personalized 2-Value Instances
Fairly Allocating Contiguous Blocks of Indivisible Items
On Revenue-Maximizing Mechanisms Assuming Convex Costs
The Declining Price Anomaly Is Not Universal in Multi-buyer Sequential Auctions (But Almost Is)
Liquid Price of Anarchy
Uniform Price Auctions: Equilibria and Efficiency
Optimal Revenue Guarantees for Pricing in Large Markets
Capacitated Network Design Games
Partition Equilibrium
Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree
Alternatives to Truthfulness Are Hard to Recognize
Strategic Voting in the Context of Stable-Matching of Teams
SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism
A Truthful and Accurate Forecasting Competition Mechanism on Bayesian Network Structured Events
Common Knowledge and State-Dependent Equilibria
Non-Adaptive Matroid Prophet Inequalities
Liquid Welfare Maximization in Auctions with Multiple Items
The Price of Anarchy of a Network Creation Game with Exponential Payoff
Algorithmic Game Theory - 16th International Symposium, SAGT 2023, Egham, UK, September 4-7, 2023, Proceedings
Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms
Online Matching with High Probability
Selfishness Level of Strategic Games
Peer Effects and Stability in Matching Markets
Logarithmic Query Complexity for Approximate Nash Computation in Large Games
Online Max-min Fair Allocation
Mechanism Design for Locating a Facility Under Partial Information
Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets
On the Hardness of Network Design for Bottleneck Routing Games
Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games
On Revenue Monotonicity in Combinatorial Auctions
Budget-Restricted Utility Games with Ordered Strategic Decisions
Diversity-Seeking Jump Games in Networks
Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games
The Price of Optimum in a Matching Game
Into the Unknown: Assigning Reviewers to Papers with Uncertain Affinities
On Submodular Prophet Inequalities and Correlation Gap
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)
Optimal Truth-Tracking Rules for the Aggregation of Incomplete Judgments
The Price of Stability of Envy-Free Equilibria in Multi-buyer Sequential Auctions
Bottleneck Congestion Games with Logarithmic Price of Anarchy
A Theoretical Examination of Practical Game Playing: Lookahead Search
Metric-Distortion Bounds Under Limited Information
Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback
Stochastic Stability in Internet Router Congestion Games
Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas
Threshold Mechanisms for Dynamic Procurement with Abandonment
Computing Stackelberg Equilibria of Large General-Sum Games
Connected Subgraph Defense Games
On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
Learning Approximately Optimal Contracts
Computing Stable Outcomes in Hedonic Games
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
The Convergence Time for Selfish Bin Packing
Approximate Competitive Equilibrium with Generic Budget
On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design
Incentives in Dominant Resource Fair Allocation Under Dynamic Demands
Auctions with Interdependence and SOS: Improved Approximation
Agent Incentives of Strategic Behavior in Resource Exchange
Basic Network Creation Games with Communication Interests
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
To Regulate or Not to Regulate: Using Revenue Maximization Tools to Maximize Consumer Utility
On the Impact of Player Capability on Congestion Games
Fair Division of Chores with Budget Constraints
Robustness of Voting Mechanisms to External Information
Approximate Well-Supported Nash Equilibria Below Two-Thirds
Lipschitz Continuity and Approximate Equilibria
Efficiency of Equilibria in Uniform Matroid Congestion Games
No Regret Learning in Oligopolies: Cournot vs. Bertrand
Experimental Results on the Process of Goal Formation and Aspiration Adaptation
Restricted Preference Domains in Social Choice: Two Perspectives
Profit Sharing with Thresholds and Non-monotone Player Utilities
Learning and Approximating the Optimal Strategy to Commit To
Approximate Mechanism Design for Distributed Facility Location
The Price of Equity with Binary Valuations and Few Agent Types
Brief Announcement: Effect of Strategic Grading and Early Offers in Matching Markets
On Dynamics in Basic Network Creation Games
Atomic Congestion Games: Fast, Myopic and Concurrent
The Efficiency of Best-Response Dynamics
Anarchy, Stability, and Utopia: Creating Better Matchings
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
An Optimal Bound to Access the Core in TU-Games
A Proof of the Nisan-Ronen Conjecture
Pricing Ad Slots with Consecutive Multi-unit Demand
Characterization and Computation of Equilibria for Indivisible Goods
Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Augsburg, Germany, September 16-18, 2020, Proceedings
Linear Contracts for Supermodular Functions Based on Graphs
Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints
Influence Maximization in Switching-Selection Threshold Models
A Truthful Mechanism for Offline Ad Slot Scheduling
Mechanisms for Scheduling with Single-Bit Private Values
Bayesian Optimal Stopping with Maximum Value Knowledge
Complexity of Safe Strategic Voting
On Selfish Creation of Robust Networks
The Web Graph as an Equilibrium
Lookahead Auctions with Pooling
Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Liverpool, UK, September 19-21, 2016. Proceedings
Approximate Nash Equilibria for Multi-player Games
A General Framework for Computing the Nucleolus via Dynamic Programming
Approximating Nash Equilibria in Tree Polymatrix Games
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
The Investment Management Game: Extending the Scope of the Notion of Core
Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets
The Impact of Tribalism on Social Welfare
An Improved Envy-Free Cake Cutting Protocol for Four Agents
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
When Can Limited Randomness Be Used in Repeated Games?
Prompt Mechanisms for Online Auctions
Algorithmic Game Theory - 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018, Proceedings
On Tree Equilibria in Max-Distance Network Creation Games
Mechanisms for Hiring a Matroid Base without Money
New Results on Equilibria in Strategic Candidacy
Equilibria in Dynamic Selfish Routing
Hotelling-Downs with Facility Synergy: The Mall Effect
Cost-Sharing Games with Rank-Based Utilities
On the Rate of Convergence of Fictitious Play
Anti-coordination Games and Stable Graph Colorings
An Approval-Based Model for Single-Step Liquid Democracy
History-Independent Distributed Multi-agent Learning
Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship
Algorithmic Game Theory, 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19, 2011. Proceedings
An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs
Tractable Graph Structures in EFX Orientation
A Classification of Weakly Acyclic Games
Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction
On the Existence of Pure Strategy Nash Equilibria in Integer-Splittable Weighted Congestion Games
Price of Anarchy for Graphic Matroid Congestion Games
On (Coalitional) Exchange-Stable Matching
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
Load Rebalancing Games in Dynamic Systems with Migration Costs
Congestion Games with Capacitated Resources
Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees
Efficient Best Response Computation for Strategic Network Formation Under Attack
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Athens, Greece, September 30 - October 3, 2019, Proceedings
The Computational Complexity of Weak Saddles
Algorithmic Game Theory - 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 - October 2, 2014. Proceedings
The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty
Optimal On-Line Allocation Rules with Verification
Brief Announcement: Resource Allocation Games with Multiple Resource Classes
Ad Auctions with Data
Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information
On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design
Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences
On Tightness of the Tsaknakis-Spirakis Algorithm for Approximate Nash Equilibrium
Complexity of Round-Robin Allocation with Potentially Noisy Queries
On Improved Interval Cover Mechanisms for Crowdsourcing Markets
Decentralized Update Selection with Semi-strategic Experts
Swap Bribery
Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines
Decentralized Dynamics for Finite Opinion Games
The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences
Bayesian Auctions with Friends and Foes
Optimizing over Serial Dictatorships
Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
Scheduling without Payments
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games
Swim till You Sink: Computing the Limit of a Game
Computing Fair and Efficient Allocations with Few Utility Values
Social Welfare in One-Sided Matchings: Random Priority and Beyond
Schelling Segregation with Strategic Agents
On the Structure of Weakly Acyclic Games
Strong and Weak Acyclicity in Iterative Voting
Complexity and Optimality of the Best Response Algorithm in Random Potential Games
Partition Equilibrium Always Exists in Resource Selection Games
Mechanism Design for Perturbation Stable Combinatorial Auctions
Edge-Dominance Games on Graphs
Plurality Voting with Truth-Biased Agents
Pure Nash Equilibria in a Generalization of Congestion Games Allowing Resource Failures
Greater Flexibility in Mechanism Design Through Altruism
Recognizing 1-Euclidean Preferences: An Alternative Approach
Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques
Friend of My Friend: Network Formation with Two-Hop Benefit
Non-clairvoyant Scheduling Games
A Hierarchical Model for Cooperative Games
On the Nucleolus of Shortest Path Games
Price Variation in a Bipartite Exchange Network
Approximating Stable Matchings with Ties of Bounded Size
On Learning Algorithms for Nash Equilibria
Group Activity Selection on Graphs: Parameterized Analysis
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form
Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
Commodity Auctions and Frugality Ratios
Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings
On the Hardness and Existence of Quasi-Strict Equilibria
Stochastic Congestion Games with Risk-Averse Players
Collective Schedules: Axioms and Algorithms
Doing Good with Spam Is Hard
The Team Order Problem: Maximizing the Probability of Matching Being Large Enough
Fairness in Temporal Slot Assignment
The Spectrum of Equilibria for the Colonel Blotto and the Colonel Lotto Games
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms
Conditional Value-at-Risk: Structure and Complexity of Equilibria
A Unifying Approximate Potential for Weighted Congestion Games
Single-Parameter Combinatorial Auctions with Partially Public Valuations
Reliability Weighted Voting Games
Brief Announcement: On the Fair Subset Sum Problem
Strong Price of Anarchy, Utility Games and Coalitional Dynamics
Bribery and Control in Stable Marriage
Fair Ride Allocation on a Line
Externalities among Advertisers in Sponsored Search
Stochastic Selfish Routing
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances
The Complexity of Fully Proportional Representation for Single-Crossing Electorates
EFX Allocations for Indivisible Chores: Matching-Based Approach
Dynamic Inefficiency: Anarchy without Stability