Sergiu Hart

Orcid: 0000-0001-8851-6009

Affiliations:
  • Hebrew University, Jerusalem, Israel


According to our database1, Sergiu Hart authored at least 45 papers between 1976 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Stable Menus of Public Goods: A Matching Problem.
CoRR, 2024

2022
Monotonic Mechanisms for Selling Multiple Goods.
CoRR, 2022

Forecast Hedging and Calibration.
CoRR, 2022

Calibrated Forecasts: The Minimax Proof.
CoRR, 2022

"Calibeating": Beating Forecasters at Their Own Game.
CoRR, 2022

2020
The Better Half of Selling Separately.
ACM Trans. Economics and Comput., 2020

2019
Selling multiple correlated goods: Revenue maximization and menu-size complexity.
J. Econ. Theory, 2019

2018
The query complexity of correlated equilibria.
Games Econ. Behav., 2018

Smooth calibration, leaky forecasts, finite recall, and Nash dynamics.
Games Econ. Behav., 2018

2017
Approximate revenue maximization with multiple items.
J. Econ. Theory, 2017

2016
Allocation games with caps: from Captain Lotto to all-pay auctions.
Int. J. Game Theory, 2016

2015
Markets, correlation, and regret-matching.
Games Econ. Behav., 2015

2013
Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161).
Dagstuhl Reports, 2013

The menu-size complexity of auctions.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2011
Commentary: Nash equilibrium and dynamics.
Games Econ. Behav., 2011

2010
How long to equilibrium? The communication complexity of uncoupled equilibrium procedures.
Games Econ. Behav., 2010

2009
Proposals to host the Fourth World Congress of the Game Theory Society.
Games Econ. Behav., 2009

2008
Discrete Colonel Blotto and General Lotto games.
Int. J. Game Theory, 2008

Michael's questions.
Games Econ. Behav., 2008

2007
The communication complexity of uncoupled nash equilibrium procedures.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Stochastic uncoupled dynamics and Nash equilibrium.
Games Econ. Behav., 2006

2005
An axiomatization of the consistent non-transferable utility value.
Int. J. Game Theory, 2005

Stochastic uncoupled dynamics and nash equilibrium: extended abstract.
Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2005), 2005

2003
Regret-based continuous-time dynamics.
Games Econ. Behav., 2003

2002
Evolutionary dynamics and backward induction.
Games Econ. Behav., 2002

2001
A General Class of Adaptive Strategies.
J. Econ. Theory, 2001

1997
Potentials and Weighted Values of Nonatomic Games.
Math. Oper. Res., 1997

1996
The Absent-Minded Driver.
Proceedings of the Sixth Conference on Theoretical Aspects of Rationality and Knowledge, 1996

1995
Egalitarian Solutions of Large Games: II. The Asymptotic Approach.
Math. Oper. Res., 1995

Egalitarian Solutions of Large Games: I. A Continuum of Players.
Math. Oper. Res., 1995

1994
On Prize Games.
Proceedings of the Essays in Game Theory, In Honor of Michael Maschler, 1994

1989
Existence of Correlated Equilibria.
Math. Oper. Res., 1989

1986
Probabilistic Propositional Temporal Logics
Inf. Control., 1986

Nonlinearity of Davenport - Schinzel sequences and of generalized path compression schemes.
Comb., 1986

1985
Concurrent Probabilistic Programs, Or: How to Schedule if You Must.
SIAM J. Comput., 1985

Nonzero-Sum Two-Person Repeated Games with Incomplete Information.
Math. Oper. Res., 1985

1984
Verification of Probabilistic Programs.
SIAM J. Comput., 1984

Probabilistic Temporal Logics for Finite and Bounded Models
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
Termination of Probabilistic Concurrent Program.
ACM Trans. Program. Lang. Syst., 1983

Concurrent Probabilistic Program, or: How to Schedule if You Must.
Proceedings of the Automata, 1983

1982
Termination of Probabilistic Concurrent Programs.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

1981
Law of Large Numbers for Random Sets and Allocation Processes.
Math. Oper. Res., 1981

1980
Measure-Based Values of Market Games.
Math. Oper. Res., 1980

1976
A note on the edges of the n-cube.
Discret. Math., 1976


  Loading...