Carmine Ventre

ORCID: 0000-0003-1464-1215
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Auction Theory and Applications
  • Game Theory and Voting Systems
  • Game Theory and Applications
  • Complex Systems and Time Series Analysis
  • Economic theories and models
  • Optimization and Search Problems
  • Blockchain Technology Applications and Security
  • Consumer Market Behavior and Pricing
  • Stock Market Forecasting Methods
  • Financial Markets and Investment Strategies
  • Opinion Dynamics and Social Influence
  • Banking stability, regulation, efficiency
  • Supply Chain and Inventory Management
  • Law, Economics, and Judicial Systems
  • Logic, Reasoning, and Knowledge
  • Complex Network Analysis Techniques
  • Experimental Behavioral Economics Studies
  • Market Dynamics and Volatility
  • Cryptography and Data Security
  • Time Series Analysis and Forecasting
  • Mobile Crowdsensing and Crowdsourcing
  • Bayesian Modeling and Causal Inference
  • Multi-Agent Systems and Negotiation
  • Transportation Planning and Optimization
  • Digital Platforms and Economics

King's College London
2019-2025

University of Essex
2016-2019

Teesside University
2011-2017

University of Liverpool
2008-2011

University of Salerno
2004-2008

Abstract In recent years, the tendency of number financial institutions to include cryptocurrencies in their portfolios has accelerated. Cryptocurrencies are first pure digital assets be included by asset managers. Although they have some commonalities with more traditional assets, own separate nature and behaviour as an is still process being understood. It therefore important summarise existing research papers results on cryptocurrency trading, including available trading platforms,...

10.1186/s40854-021-00321-6 article EN cc-by Financial Innovation 2022-02-07

The cryptocurrency market is amongst the fastest-growing of all financial markets in world. Unlike traditional markets, such as equities, foreign exchange and commodities, considered to have larger volatility illiquidity. This paper inspired by recent success using machine learning for stock prediction. In this work, we analyze present characteristics a high-frequency setting. particular, applied approach predict direction mid-price changes on upcoming tick. We show that there are universal...

10.1080/1351847x.2021.1908390 article EN cc-by European Journal of Finance 2021-04-05

10.1016/j.tcs.2016.04.033 article EN Theoretical Computer Science 2016-05-01

In this paper, we consider the facility location problem un- der a novel model recently proposed in literature, which combines no-money constraint (i.e. impossibility to employ monetary transfers between mechanism and agents) with presence of heterogeneous facilities, i.e. facilities serving different purposes. Agents thus have significantly cost w.r.t. classical homogeneous studied literature. We initiate study non-utilitarian optimization functions under model. particular, case where goal...

10.1609/aaai.v29i1.9307 article EN Proceedings of the AAAI Conference on Artificial Intelligence 2015-02-16

One of the main challenges in mechanism design is to carefully engineer incentives ensuring truthfulness while maintaining strong social welfare approximation guarantees. But these objectives are often conflict, making it impossible effective mechanisms. An important class problems that belong this category budget-feasible Here, designer needs procure services maximum value from a set agents being on budget, i.e., having limited budget enforce truthfulness. However, as empirical studies...

10.48550/arxiv.2502.12306 preprint EN arXiv (Cornell University) 2025-02-17

10.5220/0013312900003890 article EN Proceedings of the 14th International Conference on Agents and Artificial Intelligence 2025-01-01

We study the exploration-exploitation trade-off for large multiplayer coordination games where players strategise via Q-Learning, a common learning framework in multi-agent reinforcement learning. Q-Learning is known to have two shortcomings, namely non-convergence and potential equilibrium selection problems, when there are multiple fixed points, called Quantal Response Equilibria (QRE). Furthermore, whilst QRE full support finite games, it not clear how behaves as game becomes large. In...

10.1609/aaai.v39i13.33495 article EN Proceedings of the AAAI Conference on Artificial Intelligence 2025-04-11

10.1016/j.geb.2012.09.002 article EN Games and Economic Behavior 2012-09-17

In recent years, the tendency of number financial institutions including cryptocurrencies in their portfolios has accelerated. Cryptocurrencies are first pure digital assets to be included by asset managers. Although they have some commonalities with more traditional assets, own separate nature and behaviour as an is still process being understood. It therefore important summarise existing research papers results on cryptocurrency trading, available trading platforms, signals, strategy risk...

10.48550/arxiv.2003.11352 preprint EN other-oa arXiv (Cornell University) 2020-01-01

10.1109/icbc59979.2024.10634354 article EN 2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) 2024-05-27

We design and analyze deterministic truthful approximation mechanisms for multi-unit Combinatorial Auctions with only a constant number of distinct goods, each in arbitrary limited supply. Prospective buyers (bidders) have preferences over multisets items, i.e. more than one unit per good. Our objective is to determine allocations that maximize the Social Welfare. Despite recent theoretical advances on (for several goods) auctions single good), results combined setting are much scarser. main...

10.5555/2484920.2485029 article EN Adaptive Agents and Multi-Agents Systems 2013-05-06

Motivated by privacy and security concerns in online social networks, we study the role of pressure opinion games. These are games, important economics sociology, that model formation opinions a network. We enrich definition (noisy) best-response dynamics for games introducing pressure, increasing with time, to reach an agreement.We prove clique always converges consensus (no matter level noise) if is high enough. Moreover, provide (tight) bounds on speed convergence; these polynomial number...

10.24963/ijcai.2017/512 article EN 2017-07-28

Algorithmic Mechanism Design attempts to marry computation and incentives, mainly by leveraging monetary transfers between designer selfish agents involved. This is principally because in absence of money, very little can be done enforce truthfulness. However, certain applications, money unavailable, morally unacceptable or might simply at odds with the objective mechanism. For example, Combinatorial Auctions (CAs), paradigmatic problem area, we aim solutions maximum social welfare, but...

10.5555/2615731.2617410 article EN Adaptive Agents and Multi-Agents Systems 2014-05-05

We aim at identifying a minimal set of conditions under which algorithms with good approximation guarantees are truthful without money. In line recent literature, we wish to express such via verification assumptions, i.e., kind agents' misbehavior that can be made impossible by the designer.We initiate this research endeavour for paradigmatic problem in approximate mechanism design money, facility location. It is known how truthfulness imposes (even severe) losses and certain notions...

10.5555/2936924.2936939 article EN Adaptive Agents and Multi-Agents Systems 2016-05-09

We present the first general positive result on construction of collusion-resistant mechanisms, that is, mechanisms guarantee dominant strategies even when agents can form arbitrary coalitions and exchange compensations (sometimes referred to as transferable utilities or side payments). This is a much stronger solution concept compared truthful group-strategyproof only impossibility results were known for this type in "classical" model.

10.1145/1566374.1566396 article EN 2009-07-06

Abstract In Stackelberg pricing a leader sets prices for items to maximize revenue from follower purchasing feasible subset of items. We consider computationally bounded followers who cannot optimize exactly over the range all subsets, but apply publicly known algorithms determine purchase. This corresponds general multidimensional when customers their valuation functions efficiently still aim act rationally best ability. two versions this novel type problem. MIn‐KNAPSACK variant are...

10.1002/net.20457 article EN Networks 2011-09-30

We design and analyze deterministic truthful approximation mechanisms for multi-unit Combinatorial Auctions involving only a constant number of distinct goods, each in arbitrary limited supply. Prospective buyers (bidders) have preferences over multisets items, i.e., more than one unit per good. Our objective is to determine allocations that maximize the Social Welfare. main results are multi-minded submodular bidders. In first setting bidder has positive value being allocated multiset from...

10.1613/jair.4587 article EN cc-by Journal of Artificial Intelligence Research 2015-08-31
Coming Soon ...