Michal Feldman

According to our database1, Michal Feldman authored at least 97 papers between 2003 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Introduction to the Special Issue on EC'15.
ACM Trans. Economics and Comput., 2018

Pricing Multi-unit Markets.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

99% Revenue via Enhanced Competition.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Prophets and Secretaries with Overbooking.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Interdependent Values without Single-Crossing.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Truthful Prompt Scheduling for Minimizing Sum of Completion Times.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Approximate modularity revisited.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Makespan Minimization via Posted Prices.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

The Competition Complexity of Auctions: A Bulow-Klemperer Result for Multi-Dimensional Bidders.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

A Simple and Approximately Optimal Mechanism for a Buyer with Complements: Abstract.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Pricing social goods.
Proceedings of the 12th workshop on the Economics of Networks, Systems and Computation, 2017

Stable Secretaries.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

The Efficiency of Best-Response Dynamics.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Online Random Sampling for Budgeted Settings.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Liquid Price of Anarchy.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Pricing Social Goods.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Correlated and Coarse Equilibria of Single-Item Auctions.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

The price of anarchy in large games.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Simple Mechanisms for Agents with Complements.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

On Voting and Facility Location.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Lottery Pricing Equilibria.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The Invisible Hand of Dynamic Market Pricing.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Dynamics of Evolving Social Groups.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Online Pricing with Strategic and Patient Buyers.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Oblivious Rounding and the Integrality Gap.
Proceedings of the Approximation, 2016

Variations on the Hotelling-Downs Model.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Convergence to Strong Equilibrium in Network Design Games.
SIGMETRICS Performance Evaluation Review, 2015

Welfare and Revenue Guarantees for Competitive Bundling Equilibrium.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Combinatorial Auctions via Posted Prices.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Implementing the Wisdom of Waze.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

How Robust Is the Wisdom of the Crowds?
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

A Unified Framework for Strong Price of Anarchy in Clustering Games.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Do Capacity Constraints Constrain Coalitions?
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

A Unifying Hierarchy of Valuations with Complements and Substitutes.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Introduction.
Games and Economic Behavior, 2014

Clearing Markets via Bundles.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Sequential decision making with vector outcomes.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks.
Proceedings of the Approximation, 2014

2013
Introduction to the Special Issue on Algorithmic Game Theory.
ACM Trans. Economics and Comput., 2013

Mechanism design with a restricted action space.
Games and Economic Behavior, 2013

Approximate strong equilibria in job scheduling games with two uniformly related machines.
Discrete Applied Mathematics, 2013

Limits of Efficiency in Sequential Auctions.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

The Asymmetric Matrix Partition Problem.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Combinatorial walrasian equilibrium.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Simultaneous auctions are (almost) efficient.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Strategyproof facility location and the least squares objective.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Pricing public goods for private sale.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Efficient parking allocation as online bipartite matching with posted prices.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Computing optimal contracts in combinatorial agencies.
Theor. Comput. Sci., 2012

Envy-Free Makespan Approximation.
SIAM J. Comput., 2012

Combinatorial agency.
J. Economic Theory, 2012

Convergence of Best-Response Dynamics in Games with Conflicting Congestion Effects.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Revenue maximizing envy-free multi-unit auctions with budgets.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Signaling schemes for revenue maximization.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Mechanism design on discrete lines and cycles.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Capacitated Network Design Games.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Mechanisms and Impossibilities for Truthful, Envy-Free Allocations.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Stability scores: measuring coalitional stability.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Mastering multi-player games.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

On Maxsum Fair Cake Divisions.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Revenue Enhancement in Ad Auctions.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Truth, Envy, and Truthful Market Clearing Bundle Pricing.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Solving Cooperative Reliability Games.
Proceedings of the UAI 2011, 2011

Dynamic Inefficiency: Anarchy without Stability.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Economical Graph Discovery.
Proceedings of the Innovations in Computer Science, 2011

2010
Structured coalitions in resource selection games.
ACM TIST, 2010

Strategyproof Approximation of the Minimax on Networks.
Math. Oper. Res., 2010

A note on competitive diffusion through social networks.
Inf. Process. Lett., 2010

Walking in circles.
Discrete Mathematics, 2010

Envy-free makespan approximation: extended abstract.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Bayesian ignorance.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Playing Games without Observing Payoffs.
Proceedings of the Innovations in Computer Science, 2010

Adversarial Leakage in Games.
Proceedings of the Innovations in Computer Science, 2010

2009
The Proportional-Share Allocation Market for Computational Resources.
IEEE Trans. Parallel Distrib. Syst., 2009

A prescriptive approach for playing games.
SIGecom Exchanges, 2009

Efficient graph topologies in network routing games.
Games and Economic Behavior, 2009

Optimal Incentives for Participation with Type-Dependent Externalities.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies.
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

Partition Equilibrium.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Free-Riding and Free-Labor in Combinatorial Agency.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008
Conflicting Congestion Effects in Resource Allocation Games.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Approximate Strong Equilibrium in Job Scheduling Games.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007
Hidden-Action in Network Routing.
IEEE Journal on Selected Areas in Communications, 2007

Strong price of anarchy.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Strong equilibrium in cost sharing connection games.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

2006
Free-riding and whitewashing in peer-to-peer systems.
IEEE Journal on Selected Areas in Communications, 2006

Mixed Strategies in Combinatorial Agency.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Implementation with a bounded action space.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

Combinatorial agency.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

2005
Overcoming free-riding behavior in peer-to-peer systems.
SIGecom Exchanges, 2005

The Evolution of Cooperation under Cheap Pseudonyms.
Proceedings of the 7th IEEE International Conference on E-Commerce Technology (CEC 2005), 2005

A price-anticipating resource allocation mechanism for distributed shared clusters.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

Hidden-action in multi-hop routing.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

2004
Robust incentive techniques for peer-to-peer networks.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

2003
Workshop Report for 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03) 21-22 February 2003 - Claremont Hotel, Berkeley, CA, USA.
Proceedings of the Peer-to-Peer Systems II, Second International Workshop, 2003


  Loading...