Michal Feldman

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Multi-agent contracts
Journal of the ACM
2026-06-03Paper
Order-competitive ratio
SIAM Journal on Computing
2026-03-31Paper
The competition complexity of prophet inequalities (edit)
Mathematics of Operations Research
2026-03-20Paper
Combinatorial contracts
SIAM Journal on Computing
2025-12-17Paper
Pandora's box problem with time constraints
Artificial Intelligence
2025-12-12Paper
Pandora's problem with combinatorial cost
Mathematics of Operations Research
2025-11-26Paper
Tight bounds for secretary matching in general graphs
Mathematics of Operations Research
2025-11-26Paper
Bayesian and randomized clock auctions
Operations Research
2025-11-10Paper
On the (In)approximability of combinatorial contracts2025-11-04Paper
Constant approximation for private interdependent valuations2025-08-15Paper
Combinatorial contracts2025-08-13Paper
Settling the communication complexity of combinatorial auctions with two subadditive buyers2025-08-12Paper
Prophet inequalities made easy: stochastic optimization by pricing non-stochastic inputs2025-08-06Paper
Ambiguous contracts
Econometrica
2025-05-25Paper
Algorithmic contract theory: a survey
Foundations and Trends in Theoretical Computer Science
2025-01-28Paper
Combinatorial contracts beyond Gross substitutes2024-11-28Paper
Truthful matching with online items and Offline agents2024-11-14Paper
Combinatorial auctions with interdependent valuations: SOS to the rescue
Mathematics of Operations Research
2024-06-27Paper
Interdependent public projects2024-05-14Paper
``Who is next in line?'' On the significance of knowing the arrival order in Bayesian online settings2024-05-14Paper
An economics-based analysis of RANKING for online bipartite matching2024-05-14Paper
Multi-agent contracts2024-05-08Paper
Truthful Matching with Online Items and Offline Agents
Algorithmica
2024-04-24Paper
On Fair Division under Heterogeneous Matroid Constraints
Journal of Artificial Intelligence Research
2023-08-28Paper
Lookahead auctions with pooling
Algorithmic Game Theory
2023-07-28Paper
Simultaneous 2nd price item auctions with no-underbidding
Games and Economic Behavior
2023-06-23Paper
On the power and limits of dynamic pricing in combinatorial markets
(available as arXiv preprint)
2023-03-21Paper
scientific article; zbMATH DE number 7650074 (Why is no real title available?)2023-02-03Paper
Auction Design under Interdependent Values (Invited Talk)2022-07-21Paper
Prophet matching with general arrivals
Mathematics of Operations Research
2022-06-27Paper
Prophet inequality with competing agents
(available as arXiv preprint)
2022-06-01Paper
Max-min greedy matching
Theory of Computing
2022-05-18Paper
Truthful prompt scheduling for minimizing sum of completion times2021-08-04Paper
A simple and approximately optimal mechanism for a buyer with complements
Operations Research
2021-06-17Paper
Simultaneous auctions without complements are (almost) efficient
Games and Economic Behavior
2020-10-26Paper
Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
SIAM Journal on Computing
2020-08-03Paper
Pricing multi-unit markets
(available as arXiv preprint)
2020-06-18Paper
Pricing social goods
(available as arXiv preprint)
2020-05-27Paper
Approximate modularity revisited
SIAM Journal on Computing
2020-01-28Paper
Online random sampling for budgeted settings
Theory of Computing Systems
2019-09-05Paper
Stable secretaries
Algorithmica
2019-06-27Paper
On the approximability of Dodgson and Young elections2019-05-06Paper
Oblivious rounding and the integrality gap2018-04-19Paper
Online random sampling for budgeted settings
Algorithmic Game Theory
2018-02-13Paper
Liquid price of anarchy
(available as arXiv preprint)
2018-02-13Paper
The efficiency of best-response dynamics
(available as arXiv preprint)
2018-02-13Paper
Combinatorial auctions via posted prices
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
2017-10-05Paper
The price of anarchy in large games
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
2017-09-29Paper
Approximate modularity revisited
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
2017-08-17Paper
Sequential decision making with vector outcomes
Proceedings of the 5th conference on Innovations in theoretical computer science
2017-05-19Paper
Reaching consensus via non-Bayesian asynchronous learning in social networks
(available as arXiv preprint)
2017-03-22Paper
Correlated and Coarse Equilibria of Single-Item Auctions
Web and Internet Economics
2017-02-10Paper
Capacitated network design games
Theory of Computing Systems
2016-01-13Paper
Welfare and revenue guarantees for competitive bundling equilibrium
Web and Internet Economics
2016-01-08Paper
Combinatorial Walrasian equilibrium
SIAM Journal on Computing
2016-01-07Paper
A unified framework for strong price of anarchy in clustering games
Automata, Languages, and Programming
2015-11-04Paper
Economical graph discovery
Operations Research
2015-08-28Paper
Bayesian ignorance
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
2015-03-02Paper
Clearing markets via bundles
Algorithmic Game Theory
2015-01-14Paper
The asymmetric matrix partition problem
Web and Internet Economics
2015-01-12Paper
Limits of efficiency in sequential auctions
Web and Internet Economics
2015-01-12Paper
Strong price of anarchy2014-12-18Paper
Convergence of best-response dynamics in games with conflicting congestion effects
Information Processing Letters
2014-12-09Paper
Combinatorial Walrasian equilibrium
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
2014-08-07Paper
Simultaneous auctions are (almost) efficient
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
2014-08-07Paper
Approximate strong equilibria in job scheduling games with two uniformly related machines
Discrete Applied Mathematics
2014-04-22Paper
Mechanism design with a restricted action space
Games and Economic Behavior
2014-03-13Paper
Adversarial Leakage in Games
SIAM Journal on Discrete Mathematics
2013-06-27Paper
Capacitated network design games
Algorithmic Game Theory
2013-03-13Paper
On the approximability of Dodgson and Young elections
Artificial Intelligence
2012-11-15Paper
Conflicting congestion effects in resource allocation games
Operations Research
2012-11-08Paper
Bayesian ignorance
Theoretical Computer Science
2012-10-11Paper
Computing optimal contracts in combinatorial agencies
Theoretical Computer Science
2012-10-11Paper
Envy-free makespan approximation
SIAM Journal on Computing
2012-05-30Paper
Combinatorial agency
Journal of Economic Theory
2012-05-14Paper
Dynamic inefficiency: anarchy without stability
Algorithmic Game Theory
2011-10-28Paper
Strategyproof approximation of the minimax on networks
Mathematics of Operations Research
2011-04-27Paper
Walking in circles
Discrete Mathematics
2010-10-28Paper
A note on competitive diffusion through social networks
Information Processing Letters
2010-09-07Paper
Mixed strategies in combinatorial agency
Journal of Artificial Intelligence Research
2010-08-06Paper
Approximate strong equilibrium in job scheduling games
Journal of Artificial Intelligence Research
2009-12-10Paper
Partition equilibrium (extended abstract)
Algorithmic Game Theory
2009-12-01Paper
Free-riding and free-labor in combinatorial agency
Algorithmic Game Theory
2009-12-01Paper
Strong equilibrium in cost sharing connection games
Games and Economic Behavior
2009-08-27Paper
Efficient graph topologies in network routing games
Games and Economic Behavior
2009-06-08Paper
Strong price of anarchy
Games and Economic Behavior
2009-03-24Paper
Incentives in peer-to-peer systems2008-09-12Paper
Approximate Strong Equilibrium in Job Scheduling Games
Algorithmic Game Theory
2008-05-02Paper


Research outcomes over time


This page was built for person: Michal Feldman